./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:19:26,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:19:26,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:19:26,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:19:26,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:19:26,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:19:26,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:19:26,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:19:26,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:19:26,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:19:26,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:19:26,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:19:26,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:19:26,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:19:26,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:19:26,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:19:26,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:19:26,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:19:26,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:19:26,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:19:26,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:19:26,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:19:26,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:19:26,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:19:26,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:19:26,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:19:26,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:19:26,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:19:26,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:19:26,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:19:26,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:19:26,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:19:26,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:19:26,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:19:26,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:19:26,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:19:26,559 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:19:26,586 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:19:26,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:19:26,590 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:19:26,591 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:19:26,591 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:19:26,591 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:19:26,591 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:19:26,591 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:19:26,591 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:19:26,595 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:19:26,595 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:19:26,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:19:26,595 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:19:26,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:19:26,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:19:26,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:19:26,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:19:26,596 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:19:26,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:19:26,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:19:26,597 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:19:26,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:19:26,597 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:19:26,597 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:19:26,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:19:26,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:19:26,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:19:26,601 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:19:26,602 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:19:26,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:19:26,603 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:19:26,604 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:19:26,604 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2019-01-02 00:19:26,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:19:26,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:19:26,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:19:26,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:19:26,696 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:19:26,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:26,756 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a911f37c/cb1a76e044d34aff98c66c7f39d8f333/FLAGc310dcf7f [2019-01-02 00:19:27,335 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:19:27,336 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:27,353 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a911f37c/cb1a76e044d34aff98c66c7f39d8f333/FLAGc310dcf7f [2019-01-02 00:19:27,577 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a911f37c/cb1a76e044d34aff98c66c7f39d8f333 [2019-01-02 00:19:27,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:19:27,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:19:27,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:27,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:19:27,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:19:27,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:27" (1/1) ... [2019-01-02 00:19:27,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7641ba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:27, skipping insertion in model container [2019-01-02 00:19:27,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:27" (1/1) ... [2019-01-02 00:19:27,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:19:27,655 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:19:27,950 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:27,962 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:19:28,109 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:28,180 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:19:28,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28 WrapperNode [2019-01-02 00:19:28,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:28,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:28,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:19:28,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:19:28,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:28,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:19:28,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:19:28,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:19:28,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:19:28,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:19:28,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:19:28,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:19:28,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (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-02 00:19:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:19:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:19:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:19:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:19:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:19:28,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:19:28,908 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:19:28,908 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:19:28,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:28 BoogieIcfgContainer [2019-01-02 00:19:28,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:19:28,910 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:19:28,911 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:19:28,915 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:19:28,916 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:28,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:19:27" (1/3) ... [2019-01-02 00:19:28,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d089cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:28, skipping insertion in model container [2019-01-02 00:19:28,917 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:28,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (2/3) ... [2019-01-02 00:19:28,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d089cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:28, skipping insertion in model container [2019-01-02 00:19:28,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:28,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:28" (3/3) ... [2019-01-02 00:19:28,921 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:28,978 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:19:28,979 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:19:28,979 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:19:28,979 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:19:28,979 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:19:28,979 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:19:28,979 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:19:28,980 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:19:28,980 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:19:28,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:19:29,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:29,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,030 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:19:29,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:19:29,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:29,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,048 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 15#L545-4true [2019-01-02 00:19:29,048 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 18#L550true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 13#L545-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 15#L545-4true [2019-01-02 00:19:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:19:29,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-02 00:19:29,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:29,271 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-02 00:19:29,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:29,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:19:29,278 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:19:29,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:19:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:19:29,299 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-02 00:19:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:29,307 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-02 00:19:29,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:19:29,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-02 00:19:29,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-02 00:19:29,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-02 00:19:29,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-02 00:19:29,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-02 00:19:29,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:29,320 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-02 00:19:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-02 00:19:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-02 00:19:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-02 00:19:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-02 00:19:29,354 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-02 00:19:29,354 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-02 00:19:29,355 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:29,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-02 00:19:29,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:29,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,357 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 55#L545-4 [2019-01-02 00:19:29,357 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 50#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 46#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 47#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5; 49#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 55#L545-4 [2019-01-02 00:19:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-02 00:19:29,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-02 00:19:29,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,475 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-02 00:19:29,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:30,034 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-02 00:19:31,068 WARN L181 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-02 00:19:31,496 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-02 00:19:31,679 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-02 00:19:31,695 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:31,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:31,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:31,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:31,697 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:31,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:31,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:31,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:31,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:19:31,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:31,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:31,728 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-02 00:19:31,756 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-02 00:19:31,761 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-02 00:19:31,766 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-02 00:19:31,773 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-02 00:19:31,775 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-02 00:19:31,780 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-02 00:19:31,786 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-02 00:19:31,788 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-02 00:19:31,792 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-02 00:19:31,794 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-02 00:19:31,800 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-02 00:19:31,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-02 00:19:31,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,812 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-02 00:19:31,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-02 00:19:31,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:31,829 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-02 00:19:32,246 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-02 00:19:32,605 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:19:32,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:32,609 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-02 00:19:33,285 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-01-02 00:19:33,887 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:19:33,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:33,953 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:33,956 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-02 00:19:33,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,966 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-02 00:19:33,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,969 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-02 00:19:33,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,972 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-02 00:19:33,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,975 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-02 00:19:33,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,978 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-02 00:19:33,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:33,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,985 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-02 00:19:33,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,988 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-02 00:19:33,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:33,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:33,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:33,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:33,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:33,994 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-02 00:19:33,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:33,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:33,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:33,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:33,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:33,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,001 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-02 00:19:34,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,004 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-02 00:19:34,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,012 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-02 00:19:34,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,015 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-02 00:19:34,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,097 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:34,125 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:19:34,125 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:34,128 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:34,129 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:34,130 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:34,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2019-01-02 00:19:34,269 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:19:34,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:34,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:34,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:34,423 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-02 00:19:34,427 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-02 00:19:34,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-02 00:19:34,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-02 00:19:34,521 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-02 00:19:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-02 00:19:34,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-02 00:19:34,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:34,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-02 00:19:34,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:34,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-02 00:19:34,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:34,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-02 00:19:34,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:34,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-02 00:19:34,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:19:34,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:19:34,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-02 00:19:34,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:34,530 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-02 00:19:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-02 00:19:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-02 00:19:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-02 00:19:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-02 00:19:34,533 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-02 00:19:34,533 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-02 00:19:34,533 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:34,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-02 00:19:34,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:34,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:34,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:34,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:34,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:34,536 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 195#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 185#L548-5 [2019-01-02 00:19:34,536 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 180#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 181#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 185#L548-5 [2019-01-02 00:19:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-02 00:19:34,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:34,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-02 00:19:34,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:34,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:34,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:34,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-02 00:19:34,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:34,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:34,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:34,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:34,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:34,830 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-02 00:19:34,980 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-02 00:19:35,333 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-02 00:19:35,489 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-02 00:19:35,493 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:35,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:35,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:35,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:35,494 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:35,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:35,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:35,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:35,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:19:35,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:35,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:35,499 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-02 00:19:35,547 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-02 00:19:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,586 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-02 00:19:35,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,590 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-02 00:19:35,593 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-02 00:19:35,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,603 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-02 00:19:35,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,616 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-02 00:19:35,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:35,965 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-02 00:19:36,252 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-02 00:19:36,252 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-02 00:19:37,122 WARN L181 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:19:37,751 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-02 00:19:37,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:37,771 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:37,771 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-02 00:19:37,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,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-02 00:19:37,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,780 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-02 00:19:37,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,784 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-02 00:19:37,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,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-02 00:19:37,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,792 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-02 00:19:37,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,796 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-02 00:19:37,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:37,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:37,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,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-02 00:19:37,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,809 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-02 00:19:37,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,815 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-02 00:19:37,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,820 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-02 00:19:37,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:37,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:37,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,830 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-02 00:19:37,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,836 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-02 00:19:37,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,842 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-02 00:19:37,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,849 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-02 00:19:37,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,856 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-02 00:19:37,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,861 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-02 00:19:37,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,864 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-02 00:19:37,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:37,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:37,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:37,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,869 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-02 00:19:37,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,872 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:37,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,881 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:37,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:37,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,922 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-02 00:19:37,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:37,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:37,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:37,931 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-02 00:19:37,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:37,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:37,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:37,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:37,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:37,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:37,976 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:37,996 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:19:37,997 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:19:37,998 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:37,999 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:38,000 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:38,001 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2019-01-02 00:19:38,101 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-02 00:19:38,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:38,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:38,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:38,442 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-02 00:19:38,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:19:38,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-02 00:19:38,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-02 00:19:38,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:19:38,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-02 00:19:38,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:38,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-02 00:19:38,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:38,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-02 00:19:38,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:38,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-02 00:19:38,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:38,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-02 00:19:38,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-02 00:19:38,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:38,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-02 00:19:38,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:38,511 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-02 00:19:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-02 00:19:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-02 00:19:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:19:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-02 00:19:38,516 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:19:38,516 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:19:38,516 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:19:38,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-02 00:19:38,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:38,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:38,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:38,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:38,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:38,521 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L558 assume !(main_~length1~0 < 1); 359#L558-2 assume !(main_~length2~0 < 1); 364#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 376#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 377#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 379#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 380#L548-1 assume !cstrpbrk_#t~short7; 366#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5; 367#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 372#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 373#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 374#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 368#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 365#L548-5 [2019-01-02 00:19:38,521 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 360#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 361#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 365#L548-5 [2019-01-02 00:19:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-02 00:19:38,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:38,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:38,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:38,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:38,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:39,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:39,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-02 00:19:39,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:19:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-02 00:19:39,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:39,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,461 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-02 00:19:39,571 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-02 00:19:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:19:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:19:39,572 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-02 00:19:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:39,663 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-02 00:19:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:19:39,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-02 00:19:39,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:19:39,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-02 00:19:39,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-02 00:19:39,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:39,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-02 00:19:39,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:39,668 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-02 00:19:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-02 00:19:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-02 00:19:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-02 00:19:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-02 00:19:39,671 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:19:39,671 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:19:39,671 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:19:39,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-02 00:19:39,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:39,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:39,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:39,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:39,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:39,673 INFO L794 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 430#L558 assume !(main_~length1~0 < 1); 431#L558-2 assume !(main_~length2~0 < 1); 436#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 450#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 451#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 442#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 443#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 452#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5; 445#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 446#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 447#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 448#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 440#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 437#L548-5 [2019-01-02 00:19:39,673 INFO L796 eck$LassoCheckResult]: Loop: 437#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 432#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 433#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 437#L548-5 [2019-01-02 00:19:39,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:39,673 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-02 00:19:39,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:39,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:39,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:39,702 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-02 00:19:39,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:39,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-02 00:19:39,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:39,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:40,071 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-02 00:19:40,730 WARN L181 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 137 [2019-01-02 00:19:41,860 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-02 00:19:41,863 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:41,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:41,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:41,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:41,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:41,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:41,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:41,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:41,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-02 00:19:41,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:41,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:41,874 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-02 00:19:41,900 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-02 00:19:41,902 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-02 00:19:41,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-02 00:19:41,907 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-02 00:19:41,909 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-02 00:19:41,913 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-02 00:19:41,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-02 00:19:42,129 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:19:43,149 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-01-02 00:19:43,302 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:19:43,303 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-02 00:19:43,306 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-02 00:19:43,308 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-02 00:19:43,310 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-02 00:19:43,314 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-02 00:19:43,317 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-02 00:19:43,319 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-02 00:19:43,320 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-02 00:19:43,323 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-02 00:19:43,325 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-02 00:19:43,335 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-02 00:19:43,337 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-02 00:19:43,914 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-02 00:19:44,472 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:19:45,001 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-02 00:19:45,201 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-02 00:19:45,220 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:45,220 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:45,220 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-02 00:19:45,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:45,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:45,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:45,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,222 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-02 00:19:45,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:45,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:45,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:45,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,224 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-02 00:19:45,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:45,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:45,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:45,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:45,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:45,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:45,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:45,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,228 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-02 00:19:45,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:45,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:45,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:45,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,230 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-02 00:19:45,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,233 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-02 00:19:45,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:45,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:45,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:45,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:45,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:45,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,244 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-02 00:19:45,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,247 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-02 00:19:45,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,250 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-02 00:19:45,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,253 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-02 00:19:45,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,254 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:45,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,258 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:45,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:45,276 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-02 00:19:45,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:45,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:45,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:45,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:45,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:45,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:45,296 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:45,309 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:19:45,309 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:45,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:45,311 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:45,311 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:45,311 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-01-02 00:19:45,659 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2019-01-02 00:19:45,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:45,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:45,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:45,789 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-02 00:19:45,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:19:45,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:19:45,842 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-02 00:19:45,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:19:45,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:19:45,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:45,846 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:45,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:45,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:45,965 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-02 00:19:45,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:19:45,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:19:46,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-02 00:19:46,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:19:46,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:19:46,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:46,028 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:46,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:46,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:46,113 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-02 00:19:46,113 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:19:46,113 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:19:46,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2019-01-02 00:19:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-02 00:19:46,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:19:46,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:46,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-02 00:19:46,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:46,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-02 00:19:46,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:46,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-02 00:19:46,176 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:46,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-02 00:19:46,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:46,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:46,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:46,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:46,177 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:46,177 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:46,177 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:46,177 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:19:46,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:46,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:46,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:46,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:46 BoogieIcfgContainer [2019-01-02 00:19:46,197 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:46,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:46,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:46,198 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:46,198 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:28" (3/4) ... [2019-01-02 00:19:46,204 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:46,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:46,208 INFO L168 Benchmark]: Toolchain (without parser) took 18626.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -215.0 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:46,210 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:46,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:46,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:46,214 INFO L168 Benchmark]: Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:46,215 INFO L168 Benchmark]: RCFGBuilder took 624.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:46,217 INFO L168 Benchmark]: BuchiAutomizer took 17286.62 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -124.1 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:46,219 INFO L168 Benchmark]: Witness Printer took 9.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:46,224 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 598.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 624.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17286.62 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -124.1 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. * Witness Printer took 9.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 91 SDslu, 72 SDs, 0 SdLazy, 105 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp92 ukn72 mio100 lsp30 div132 bol100 ite100 ukn100 eq162 hnf81 smp91 dnf701 smp43 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...