./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f39f60c3148e6a8957b92a35d12d506fd8229368 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:35:00,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:35:01,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:35:01,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:35:01,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:35:01,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:35:01,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:35:01,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:35:01,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:35:01,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:35:01,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:35:01,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:35:01,046 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:35:01,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:35:01,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:35:01,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:35:01,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:35:01,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:35:01,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:35:01,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:35:01,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:35:01,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:35:01,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:35:01,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:35:01,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:35:01,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:35:01,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:35:01,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:35:01,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:35:01,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:35:01,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:35:01,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:35:01,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:35:01,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:35:01,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:35:01,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:35:01,098 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:35:01,126 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:35:01,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:35:01,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:35:01,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:35:01,131 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:35:01,131 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:35:01,132 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:35:01,132 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:35:01,132 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:35:01,132 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:35:01,132 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:35:01,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:35:01,134 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:35:01,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:35:01,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:35:01,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:35:01,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:35:01,135 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:35:01,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:35:01,135 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:35:01,135 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:35:01,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:35:01,136 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:35:01,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:35:01,136 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:35:01,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:35:01,136 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:35:01,136 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:35:01,139 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:35:01,139 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 -> f39f60c3148e6a8957b92a35d12d506fd8229368 [2019-01-01 21:35:01,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:35:01,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:35:01,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:35:01,197 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:35:01,197 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:35:01,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2019-01-01 21:35:01,266 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3307764f/ef534261f5684f01b701626124bee23b/FLAG7071001cf [2019-01-01 21:35:01,804 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:35:01,805 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2019-01-01 21:35:01,813 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3307764f/ef534261f5684f01b701626124bee23b/FLAG7071001cf [2019-01-01 21:35:02,138 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3307764f/ef534261f5684f01b701626124bee23b [2019-01-01 21:35:02,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:35:02,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:35:02,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:02,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:35:02,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:35:02,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7f6200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02, skipping insertion in model container [2019-01-01 21:35:02,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:35:02,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:35:02,387 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:02,407 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:35:02,444 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:02,471 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:35:02,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02 WrapperNode [2019-01-01 21:35:02,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:02,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:02,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:35:02,473 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:35:02,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:02,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:35:02,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:35:02,519 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:35:02,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:35:02,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:35:02,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:35:02,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:35:02,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:35:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:35:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:35:02,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:35:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:35:03,199 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:35:03,200 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-01 21:35:03,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:03 BoogieIcfgContainer [2019-01-01 21:35:03,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:35:03,201 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:35:03,201 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:35:03,205 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:35:03,205 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:03,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:35:02" (1/3) ... [2019-01-01 21:35:03,207 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675973f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:03, skipping insertion in model container [2019-01-01 21:35:03,207 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:03,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (2/3) ... [2019-01-01 21:35:03,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675973f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:03, skipping insertion in model container [2019-01-01 21:35:03,208 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:03,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:03" (3/3) ... [2019-01-01 21:35:03,210 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2019-01-01 21:35:03,273 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:35:03,274 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:35:03,274 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:35:03,275 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:35:03,275 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:35:03,275 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:35:03,275 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:35:03,276 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:35:03,276 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:35:03,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:35:03,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:03,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:03,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:03,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,328 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:35:03,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:35:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:03,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:03,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:03,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,340 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 17#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L30-4true [2019-01-01 21:35:03,341 INFO L796 eck$LassoCheckResult]: Loop: 3#L30-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 9#L30-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 7#L33-5true assume !true; 4#L33-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 20#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 5#L30-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L30-4true [2019-01-01 21:35:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2019-01-01 21:35:03,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2019-01-01 21:35:03,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:03,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:35:03,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:35:03,616 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:35:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:35:03,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:35:03,635 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-01 21:35:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:35:03,643 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-01-01 21:35:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:35:03,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-01 21:35:03,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:03,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2019-01-01 21:35:03,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:35:03,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:35:03,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-01 21:35:03,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:03,654 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:35:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-01 21:35:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 21:35:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:35:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-01 21:35:03,682 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:35:03,682 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:35:03,683 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:35:03,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-01 21:35:03,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:35:03,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:03,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:03,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,685 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 61#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 57#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 50#L30-4 [2019-01-01 21:35:03,687 INFO L796 eck$LassoCheckResult]: Loop: 50#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 55#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 56#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 60#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 52#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 50#L30-4 [2019-01-01 21:35:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2019-01-01 21:35:03,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2019-01-01 21:35:03,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2019-01-01 21:35:03,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:04,435 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-01-01 21:35:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:04,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:35:04,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:35:05,081 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-01 21:35:05,711 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-01 21:35:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:35:05,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:35:05,712 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-01 21:35:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:35:06,069 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-01 21:35:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:35:06,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2019-01-01 21:35:06,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:35:06,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2019-01-01 21:35:06,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-01 21:35:06,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 21:35:06,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2019-01-01 21:35:06,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:06,074 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-01 21:35:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2019-01-01 21:35:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-01 21:35:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:35:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-01 21:35:06,078 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:06,078 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-01 21:35:06,079 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:35:06,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-01-01 21:35:06,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-01 21:35:06,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:06,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:06,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:06,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:06,083 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 127#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 128#L14-3 assume !(build_nondet_String_~length~0 < 1); 136#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 142#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 141#L30-4 [2019-01-01 21:35:06,083 INFO L796 eck$LassoCheckResult]: Loop: 141#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 140#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 123#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 124#L33-1 assume !cstrcspn_#t~short7; 129#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 120#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 121#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 138#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 141#L30-4 [2019-01-01 21:35:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2019-01-01 21:35:06,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:06,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:06,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2019-01-01 21:35:06,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:06,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:06,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2019-01-01 21:35:06,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:06,427 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-01-01 21:35:06,992 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-01-01 21:35:07,142 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 21:35:07,156 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:07,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:07,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:07,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:07,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:07,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:07,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:07,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:07,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-01 21:35:07,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:07,159 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:07,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,695 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-01-01 21:35:07,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:08,394 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:35:09,176 WARN L181 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:35:09,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:09,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:09,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:09,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:09,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:09,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:09,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:09,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:09,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:09,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:09,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:09,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:09,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:09,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:09,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:09,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:09,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:09,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:09,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:09,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:09,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:09,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:09,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:09,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:09,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:09,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:09,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:09,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:09,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:09,392 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:09,443 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:35:09,444 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:35:09,449 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:09,451 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:35:09,451 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:09,457 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2019-01-01 21:35:09,555 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-01 21:35:09,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:35:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:09,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:09,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:09,715 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:35:09,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:35:09,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2019-01-01 21:35:09,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:35:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-01-01 21:35:09,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2019-01-01 21:35:09,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:09,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2019-01-01 21:35:09,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:09,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2019-01-01 21:35:09,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:09,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-01-01 21:35:09,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:09,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2019-01-01 21:35:09,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:35:09,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:35:09,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-01-01 21:35:09,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:35:09,814 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:35:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-01-01 21:35:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-01 21:35:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:35:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 21:35:09,819 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:35:09,819 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 21:35:09,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:35:09,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-01 21:35:09,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:09,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:09,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:09,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:09,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:09,822 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 306#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 301#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 290#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 292#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 297#L33-5 [2019-01-01 21:35:09,822 INFO L796 eck$LassoCheckResult]: Loop: 297#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 298#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 304#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 297#L33-5 [2019-01-01 21:35:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2019-01-01 21:35:09,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:09,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:09,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2019-01-01 21:35:09,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:09,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:09,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2019-01-01 21:35:09,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:10,177 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:35:10,639 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2019-01-01 21:35:10,893 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 21:35:10,895 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:10,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:10,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:10,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:10,896 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:10,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:10,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:10,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:10,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:35:10,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:10,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:10,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:10,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:11,412 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-01-01 21:35:11,529 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 21:35:11,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:11,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:11,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:11,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:11,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:11,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:12,730 WARN L181 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:35:12,981 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 21:35:13,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:13,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:13,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:13,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:13,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:13,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:13,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:13,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:13,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:13,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:13,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:13,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:13,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:13,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:13,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:35:13,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:13,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:13,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:13,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:13,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:13,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:13,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:13,147 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:35:13,148 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:35:13,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:13,149 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:35:13,151 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:13,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-01-01 21:35:13,209 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:35:13,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:35:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:13,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:13,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:13,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-01 21:35:13,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-01 21:35:13,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2019-01-01 21:35:13,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:35:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 21:35:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:35:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:35:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:35:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:13,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2019-01-01 21:35:13,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:13,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2019-01-01 21:35:13,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:35:13,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:35:13,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-01-01 21:35:13,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:35:13,543 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-01 21:35:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-01-01 21:35:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-01-01 21:35:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:35:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-01-01 21:35:13,547 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:35:13,547 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-01 21:35:13,547 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:35:13,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2019-01-01 21:35:13,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:13,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:13,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:13,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:13,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:13,552 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 489#L14 assume !(build_nondet_String_~length~0 < 1); 493#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 483#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 487#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 481#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 469#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 470#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 482#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 490#L33-1 assume !cstrcspn_#t~short7; 491#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 475#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 476#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 474#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 471#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 473#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 477#L33-5 [2019-01-01 21:35:13,552 INFO L796 eck$LassoCheckResult]: Loop: 477#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 478#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 485#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 477#L33-5 [2019-01-01 21:35:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2019-01-01 21:35:13,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2019-01-01 21:35:13,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:13,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:13,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2019-01-01 21:35:13,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:13,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:13,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:35:13,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:35:13,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:13,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:13,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-01 21:35:13,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 21:35:13,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:35:13,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:35:13,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:35:13,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2019-01-01 21:35:52,380 WARN L181 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 21:36:18,678 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:36:34,450 WARN L181 SmtUtils]: Spent 2.89 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:36:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:36:34,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-01-01 21:36:34,593 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:36:34,917 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:36:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:36:34,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=140, Unknown=7, NotChecked=0, Total=182 [2019-01-01 21:36:34,919 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-01-01 21:36:35,393 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-01 21:36:40,301 WARN L181 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-01-01 21:36:43,942 WARN L181 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-01 21:36:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:44,056 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2019-01-01 21:36:44,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:36:44,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2019-01-01 21:36:44,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:36:44,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2019-01-01 21:36:44,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 21:36:44,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:36:44,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2019-01-01 21:36:44,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:44,062 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-01 21:36:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2019-01-01 21:36:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-01-01 21:36:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 21:36:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-01 21:36:44,066 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 21:36:44,066 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 21:36:44,066 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:36:44,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-01-01 21:36:44,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:36:44,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:44,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:44,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:44,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:44,073 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 666#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 667#L14 assume !(build_nondet_String_~length~0 < 1); 671#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 660#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 661#L14-3 assume !(build_nondet_String_~length~0 < 1); 665#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 658#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 646#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 647#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 675#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 668#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 669#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 651#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 652#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 653#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 648#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 650#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 654#L33-5 [2019-01-01 21:36:44,073 INFO L796 eck$LassoCheckResult]: Loop: 654#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 655#L33-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 662#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 654#L33-5 [2019-01-01 21:36:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2019-01-01 21:36:44,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:44,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:44,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:44,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:44,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2019-01-01 21:36:44,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:44,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:44,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2019-01-01 21:36:44,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:44,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:44,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:44,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:44,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:44,455 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:36:44,570 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:36:45,548 WARN L181 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 157 [2019-01-01 21:36:46,792 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 112 DAG size of output: 112 [2019-01-01 21:36:46,795 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:46,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:46,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:46,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:46,796 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:46,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:46,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:46,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:46,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-01 21:36:46,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:46,797 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:46,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:46,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:47,140 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:36:48,248 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-01-01 21:36:48,407 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-01 21:36:48,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:48,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:48,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:50,113 WARN L181 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 182 DAG size of output: 130 [2019-01-01 21:36:50,255 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:37:11,657 WARN L181 SmtUtils]: Spent 21.34 s on a formula simplification. DAG size of input: 250 DAG size of output: 151 [2019-01-01 21:37:12,669 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-01 21:37:12,712 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:12,712 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:12,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:12,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:12,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37: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 [2019-01-01 21:37:12,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:12,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:12,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:12,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:12,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:12,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:12,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:12,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:12,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:12,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:12,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:12,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:12,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:12,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:12,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:12,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:12,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:12,828 INFO L205 nArgumentSynthesizer]: 32 stem disjuncts [2019-01-01 21:37:12,828 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:37:12,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:13,331 INFO L402 nArgumentSynthesizer]: We have 468 Motzkin's Theorem applications. [2019-01-01 21:37:13,332 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 21:37:29,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:40,390 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-01-01 21:37:40,391 INFO L444 ModelExtractionUtils]: 384 out of 404 variables were initially zero. Simplification set additionally 17 variables to zero. [2019-01-01 21:37:40,393 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:40,399 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2019-01-01 21:37:40,400 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:40,401 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 Supporting invariants [] [2019-01-01 21:37:40,573 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2019-01-01 21:37:40,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:37:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:40,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:40,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:40,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-01 21:37:40,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:37:40,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2019-01-01 21:37:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 21:37:40,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:37:40,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:40,849 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:40,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:40,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:41,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-01 21:37:41,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:37:41,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2019-01-01 21:37:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 21:37:41,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:37:41,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,261 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:37:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:41,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:41,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:41,447 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-01 21:37:41,447 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-01 21:37:41,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 6 states. [2019-01-01 21:37:41,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:37:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-01-01 21:37:41,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:37:41,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:37:41,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 21:37:41,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:41,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2019-01-01 21:37:41,584 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:41,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2019-01-01 21:37:41,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:41,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:41,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:41,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:41,585 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:41,585 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:41,585 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:41,585 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:37:41,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:41,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:41,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:41,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:41 BoogieIcfgContainer [2019-01-01 21:37:41,594 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:41,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:41,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:41,595 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:41,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:03" (3/4) ... [2019-01-01 21:37:41,601 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:41,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:41,602 INFO L168 Benchmark]: Toolchain (without parser) took 159459.95 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 946.0 MB in the beginning and 1.4 GB in the end (delta: -473.2 MB). Peak memory consumption was 702.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:41,605 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:41,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.51 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:41,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.64 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:41,606 INFO L168 Benchmark]: Boogie Preprocessor took 45.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:41,607 INFO L168 Benchmark]: RCFGBuilder took 636.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:41,611 INFO L168 Benchmark]: BuchiAutomizer took 158392.85 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -332.0 MB). Peak memory consumption was 724.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:41,613 INFO L168 Benchmark]: Witness Printer took 7.04 ms. Allocated memory is still 2.2 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:41,620 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.51 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.64 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 636.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 158392.85 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -332.0 MB). Peak memory consumption was 724.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.04 ms. Allocated memory is still 2.2 GB. Free memory is still 1.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 158.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 147.0s. Construction of modules took 0.7s. Büchi inclusion checks took 10.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 187 SDslu, 188 SDs, 0 SdLazy, 297 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital346 mio100 ax100 hnf99 lsp91 ukn74 mio100 lsp69 div114 bol100 ite100 ukn100 eq182 hnf88 smp79 dnf2898 smp56 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27573ms VariablesStem: 32 VariablesLoop: 16 DisjunctsStem: 32 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 468 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...