./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-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/openbsd_cstrstr-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 a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20:47,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:47,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:20:47,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:20:47,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:20:47,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:20:47,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:20:47,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:20:47,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:20:47,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:20:47,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:20:47,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:20:47,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:20:47,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:20:47,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:20:47,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:20:47,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:20:47,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:20:47,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:20:47,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:20:47,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:20:47,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:20:47,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:20:47,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:20:47,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:20:47,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:20:47,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:20:47,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:20:47,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:20:47,970 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:20:47,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:20:47,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:20:47,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:20:47,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:20:47,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:20:47,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:20:47,977 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:20:48,009 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:20:48,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:20:48,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:20:48,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:20:48,011 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:20:48,012 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:20:48,012 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:20:48,012 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:20:48,012 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:20:48,012 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:20:48,013 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:20:48,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:20:48,016 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:20:48,017 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:20:48,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:20:48,017 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:20:48,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:20:48,017 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:20:48,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:20:48,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:20:48,019 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:20:48,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:20:48,020 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:20:48,020 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:20:48,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:20:48,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:20:48,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:20:48,021 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:20:48,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:20:48,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:20:48,022 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:20:48,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:20:48,023 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 -> a7a59a18d7efd93cdbe5aac5e25a2b00fcb94883 [2019-01-02 00:20:48,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:20:48,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:20:48,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:20:48,094 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:20:48,094 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:20:48,095 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:48,155 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4d42be6/506d7ca62e834fa791d590c2bfbc2396/FLAG9a29f3b99 [2019-01-02 00:20:48,719 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:20:48,722 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:48,743 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4d42be6/506d7ca62e834fa791d590c2bfbc2396/FLAG9a29f3b99 [2019-01-02 00:20:48,967 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4d42be6/506d7ca62e834fa791d590c2bfbc2396 [2019-01-02 00:20:48,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:20:48,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:20:48,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:48,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:20:48,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:20:48,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:48" (1/1) ... [2019-01-02 00:20:48,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79041f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:48, skipping insertion in model container [2019-01-02 00:20:48,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:48" (1/1) ... [2019-01-02 00:20:48,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:20:49,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:20:49,422 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:49,433 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:20:49,608 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:49,674 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:20:49,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49 WrapperNode [2019-01-02 00:20:49,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:49,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:49,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:20:49,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:20:49,686 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:20:49" (1/1) ... [2019-01-02 00:20:49,704 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:20:49" (1/1) ... [2019-01-02 00:20:49,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:49,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:20:49,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:20:49,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:20:49,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (1/1) ... [2019-01-02 00:20:49,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:20:49,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:20:49,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:20:49,775 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:20:49,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (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:20:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:20:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:20:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:20:49,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:20:49,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:20:49,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:20:50,372 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:20:50,373 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-02 00:20:50,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:50 BoogieIcfgContainer [2019-01-02 00:20:50,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:20:50,374 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:20:50,374 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:20:50,378 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:20:50,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:50,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:20:48" (1/3) ... [2019-01-02 00:20:50,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47d8af88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:50, skipping insertion in model container [2019-01-02 00:20:50,381 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:50,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:49" (2/3) ... [2019-01-02 00:20:50,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47d8af88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:50, skipping insertion in model container [2019-01-02 00:20:50,381 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:50,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:50" (3/3) ... [2019-01-02 00:20:50,384 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:50,441 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:20:50,442 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:20:50,442 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:20:50,442 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:20:50,442 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:20:50,442 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:20:50,443 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:20:50,443 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:20:50,443 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:20:50,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-01-02 00:20:50,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-02 00:20:50,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:50,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:50,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:20:50,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:50,489 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:20:50,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-01-02 00:20:50,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-01-02 00:20:50,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:50,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:50,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:20:50,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:50,503 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 12#L581true assume !(main_~length1~0 < 1); 3#L581-2true assume !(main_~length2~0 < 1); 27#L584-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 6#L566true assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 30#L544-4true [2019-01-02 00:20:50,504 INFO L796 eck$LassoCheckResult]: Loop: 30#L544-4true call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 8#L544-1true assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 26#L544-3true cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 30#L544-4true [2019-01-02 00:20:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-01-02 00:20:50,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:50,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:50,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2019-01-02 00:20:50,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:50,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2019-01-02 00:20:50,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:50,945 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-02 00:20:52,214 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-01-02 00:20:52,470 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-02 00:20:52,483 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:52,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:52,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:52,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:52,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:52,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:52,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:52,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:52,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:20:52,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:52,487 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:52,520 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:20:52,543 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:20:52,549 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:20:52,552 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:20:52,560 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:20:52,563 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:20:52,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:52,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:52,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:20:52,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:20:52,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:52,632 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:20:52,648 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:20:52,654 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:20:53,219 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-02 00:20:53,408 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-01-02 00:20:53,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:53,418 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:20:53,419 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:20:53,421 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:20:53,425 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:20:53,430 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:20:53,432 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:20:53,433 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:20:53,436 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:20:53,438 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:20:53,441 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:20:53,443 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:20:53,795 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-02 00:20:54,547 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-02 00:20:54,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:54,738 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:54,740 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:20:54,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,750 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:20:54,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,755 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:20:54,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,759 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:20:54,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,763 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:20:54,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,768 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:20:54,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:54,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:54,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,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:20:54,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:54,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,800 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:20:54,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,805 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:20:54,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,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:20:54,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,812 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:20:54,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:54,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:54,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:54,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,823 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:20:54,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:54,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:54,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,841 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:20:54,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:54,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:54,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,860 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:20:54,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:54,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:54,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,885 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:20:54,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,886 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:54,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,899 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:54,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:54,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:54,996 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:20:54,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:54,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:54,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:54,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:54,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:54,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:55,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:55,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:20:55,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:55,007 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:20:55,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:55,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:55,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:20:55,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:55,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:55,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:20:55,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:55,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:55,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:55,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:55,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:55,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:55,073 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:55,093 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:20:55,094 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:20:55,097 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:55,098 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:55,098 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:55,099 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2019-01-02 00:20:55,304 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-02 00:20:55,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:55,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:55,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:55,462 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:20:55,481 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:20:55,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2019-01-02 00:20:55,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 4 states. Result 80 states and 111 transitions. Complement of second has 7 states. [2019-01-02 00:20:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:20:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:20:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2019-01-02 00:20:55,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-02 00:20:55,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:55,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-02 00:20:55,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:55,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-02 00:20:55,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:55,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2019-01-02 00:20:55,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-02 00:20:55,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2019-01-02 00:20:55,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:20:55,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-02 00:20:55,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-02 00:20:55,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:55,671 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-02 00:20:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-02 00:20:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-02 00:20:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-02 00:20:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-01-02 00:20:55,696 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-02 00:20:55,696 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-02 00:20:55,696 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:20:55,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2019-01-02 00:20:55,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-02 00:20:55,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:55,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:55,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:55,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:55,700 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 245#L581 assume !(main_~length1~0 < 1); 231#L581-2 assume !(main_~length2~0 < 1); 232#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 237#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 238#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 240#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 241#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 233#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 234#L568-4 [2019-01-02 00:20:55,700 INFO L796 eck$LassoCheckResult]: Loop: 234#L568-4 goto; 250#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 246#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 247#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 235#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 236#L551 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 248#L559 cstrstr_#t~ret16 := cstrncmp_#res; 239#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 234#L568-4 [2019-01-02 00:20:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2019-01-02 00:20:55,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:55,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:55,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:55,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2019-01-02 00:20:55,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:55,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:55,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:55,892 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:20:55,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:20:55,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:20:55,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:20:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:20:55,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:20:55,902 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:20:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:20:56,083 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-01-02 00:20:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:20:56,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-01-02 00:20:56,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-02 00:20:56,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2019-01-02 00:20:56,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:20:56,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:20:56,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2019-01-02 00:20:56,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:56,088 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-02 00:20:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2019-01-02 00:20:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-02 00:20:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-02 00:20:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-01-02 00:20:56,091 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-02 00:20:56,091 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-02 00:20:56,091 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:20:56,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2019-01-02 00:20:56,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-02 00:20:56,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:56,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:56,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:56,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:56,094 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 317#L581 assume !(main_~length1~0 < 1); 299#L581-2 assume !(main_~length2~0 < 1); 300#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 307#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 308#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 312#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 313#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 301#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 302#L568-4 [2019-01-02 00:20:56,095 INFO L796 eck$LassoCheckResult]: Loop: 302#L568-4 goto; 298#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 303#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 296#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 297#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 304#L551 assume !(0 == cstrncmp_~n % 4294967296); 321#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 311#L559 cstrstr_#t~ret16 := cstrncmp_#res; 309#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 302#L568-4 [2019-01-02 00:20:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2019-01-02 00:20:56,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:56,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:56,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2019-01-02 00:20:56,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:56,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:56,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:20:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2019-01-02 00:20:56,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:56,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:56,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:56,380 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:20:56,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:20:56,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-02 00:20:56,885 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2019-01-02 00:20:57,015 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-02 00:20:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:20:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:20:57,016 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-02 00:20:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:20:57,148 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-01-02 00:20:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:20:57,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2019-01-02 00:20:57,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-02 00:20:57,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2019-01-02 00:20:57,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-02 00:20:57,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-02 00:20:57,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2019-01-02 00:20:57,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:57,154 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-02 00:20:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2019-01-02 00:20:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-02 00:20:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-02 00:20:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-01-02 00:20:57,159 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-01-02 00:20:57,159 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-01-02 00:20:57,159 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:20:57,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2019-01-02 00:20:57,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-02 00:20:57,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:57,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:57,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:57,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:57,164 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 398#L581 assume !(main_~length1~0 < 1); 378#L581-2 assume !(main_~length2~0 < 1); 379#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 387#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 388#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 393#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 394#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 380#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 381#L568-4 goto; 377#L569-2 [2019-01-02 00:20:57,164 INFO L796 eck$LassoCheckResult]: Loop: 377#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 382#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 376#L569 assume !!(cstrstr_~sc~0 != cstrstr_~c~0); 377#L569-2 [2019-01-02 00:20:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2019-01-02 00:20:57,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:57,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:57,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:57,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:57,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2019-01-02 00:20:57,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:57,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:57,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:57,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:57,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2019-01-02 00:20:57,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:57,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:57,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:57,381 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:20:57,916 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 130 [2019-01-02 00:20:58,646 WARN L181 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-01-02 00:20:58,649 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:58,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:58,649 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:58,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:58,649 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:58,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:58,649 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:58,649 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:58,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-02 00:20:58,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:58,650 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:58,655 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:20:58,662 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:20:58,663 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:20:58,665 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:20:58,666 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:20:58,667 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:20:58,682 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:20:58,685 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:20:58,686 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:20:58,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:58,689 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:20:58,691 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:20:58,692 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:20:58,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:59,328 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-01-02 00:20:59,476 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-01-02 00:20:59,477 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:20:59,480 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:20:59,486 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:20:59,489 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:20:59,491 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:20:59,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:59,503 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:20:59,507 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:20:59,508 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:20:59,512 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:20:59,800 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-02 00:21:00,133 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-02 00:21:00,683 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-02 00:21:00,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:00,819 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:00,819 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:21:00,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,822 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:21:00,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,824 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:21:00,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:00,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,828 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:21:00,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,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:21:00,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,832 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:21:00,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:00,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:00,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,835 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:21:00,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,837 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:21:00,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,839 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:21:00,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,841 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:21:00,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,846 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:21:00,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,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:21:00,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:00,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:00,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:00,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,850 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:21:00,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:00,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:00,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:00,858 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:21:00,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:00,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:00,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:00,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:00,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:00,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:00,892 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:00,927 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:21:00,931 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:21:00,931 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:00,932 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:00,933 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:00,933 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2) = -1*ULTIMATE.start_cstrstr_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_2 Supporting invariants [] [2019-01-02 00:21:01,234 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2019-01-02 00:21:01,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:01,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:01,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:01,476 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:21:01,476 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:21:01,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-02 00:21:01,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2019-01-02 00:21:01,617 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:21:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:21:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2019-01-02 00:21:01,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-02 00:21:01,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:01,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-02 00:21:01,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:01,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-02 00:21:01,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:01,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2019-01-02 00:21:01,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:21:01,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2019-01-02 00:21:01,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-02 00:21:01,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:21:01,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2019-01-02 00:21:01,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:01,623 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-02 00:21:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2019-01-02 00:21:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-02 00:21:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-02 00:21:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-01-02 00:21:01,628 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-02 00:21:01,628 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-02 00:21:01,628 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:21:01,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-01-02 00:21:01,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:21:01,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:01,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:01,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:01,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:01,630 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 644#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 645#L581 assume !(main_~length1~0 < 1); 621#L581-2 assume !(main_~length2~0 < 1); 622#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 635#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 636#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 642#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 643#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 649#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 640#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 641#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 623#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 624#L568-4 goto; 625#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 626#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 616#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 617#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 627#L551 assume !(0 == cstrncmp_~n % 4294967296); 650#L553-4 [2019-01-02 00:21:01,631 INFO L796 eck$LassoCheckResult]: Loop: 650#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 637#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 629#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 630#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 647#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 650#L553-4 [2019-01-02 00:21:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2019-01-02 00:21:01,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:01,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:01,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2019-01-02 00:21:01,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:01,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:01,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:01,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:01,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2019-01-02 00:21:01,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:01,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:01,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:21:02,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:21:02,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:21:02,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:02,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:21:02,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:21:02,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-02 00:21:02,389 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-02 00:21:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-02 00:21:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-02 00:21:02,432 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand 12 states. [2019-01-02 00:21:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:21:02,649 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-01-02 00:21:02,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:21:02,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2019-01-02 00:21:02,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:21:02,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2019-01-02 00:21:02,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:21:02,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:21:02,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2019-01-02 00:21:02,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:02,654 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-02 00:21:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2019-01-02 00:21:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-02 00:21:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-02 00:21:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-01-02 00:21:02,658 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-01-02 00:21:02,658 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-01-02 00:21:02,658 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:21:02,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-01-02 00:21:02,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:21:02,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:02,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:02,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:02,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:02,660 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 847#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 848#L581 assume !(main_~length1~0 < 1); 824#L581-2 assume !(main_~length2~0 < 1); 825#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 836#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 837#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 856#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 852#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 853#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 845#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 846#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 857#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 843#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 844#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 826#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 827#L568-4 goto; 828#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 829#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 819#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 820#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 830#L551 assume !(0 == cstrncmp_~n % 4294967296); 854#L553-4 [2019-01-02 00:21:02,660 INFO L796 eck$LassoCheckResult]: Loop: 854#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 840#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 832#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 833#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 850#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 854#L553-4 [2019-01-02 00:21:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2019-01-02 00:21:02,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:02,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2019-01-02 00:21:02,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:02,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2019-01-02 00:21:02,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:03,254 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-02 00:21:04,437 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-01-02 00:21:05,260 WARN L181 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2019-01-02 00:21:05,263 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:05,263 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:05,263 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:05,263 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:05,263 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:05,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:05,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:05,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:05,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-02 00:21:05,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:05,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:05,268 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:21:05,278 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:21:05,281 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:21:05,309 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:21:05,333 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:21:05,357 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:21:05,380 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:21:05,405 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:21:05,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,454 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:21:05,492 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:21:05,518 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:21:05,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,544 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:21:05,550 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:21:05,552 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:21:05,555 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:21:05,557 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:21:05,558 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:21:05,560 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:21:05,562 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:21:05,565 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:21:05,566 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:21:05,567 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:21:05,571 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:21:05,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:05,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:06,644 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 135 [2019-01-02 00:21:06,987 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-01-02 00:21:06,987 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:21:06,989 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:21:06,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:06,992 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:21:06,994 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:21:06,996 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:21:06,998 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:21:07,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:07,007 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:21:07,380 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-02 00:21:07,863 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-01-02 00:21:08,075 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-02 00:21:09,034 WARN L181 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-01-02 00:21:09,312 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-02 00:21:09,428 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-02 00:21:09,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:09,573 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:09,574 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:21:09,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,583 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:21:09,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,589 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:21:09,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,590 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:21:09,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,595 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:21:09,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,599 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:21:09,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,604 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:21:09,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,606 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:21:09,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,615 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:21:09,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,617 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:21:09,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,623 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:21:09,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,628 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:21:09,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:09,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,637 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:21:09,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:09,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,641 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:21:09,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:09,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,650 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:21:09,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,657 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:21:09,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,659 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:21:09,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,661 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:21:09,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,664 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:21:09,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:09,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,672 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:21:09,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,679 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:21:09,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,683 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:21:09,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:09,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:09,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:09,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,688 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:21:09,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,689 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:21:09,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,690 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:21:09,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,695 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:21:09,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:09,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,709 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:21:09,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:21:09,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,715 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-02 00:21:09,715 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-02 00:21:09,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,739 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:21:09,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,740 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:21:09,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,751 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:21:09,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,789 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:21:09,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,793 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:21:09,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,798 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:21:09,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:09,801 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:21:09,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:09,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:09,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:09,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:09,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:09,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:09,923 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:09,982 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:21:09,982 INFO L444 ModelExtractionUtils]: 81 out of 85 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:21:09,983 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:09,986 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:09,987 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:09,987 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_1 Supporting invariants [] [2019-01-02 00:21:10,558 INFO L297 tatePredicateManager]: 49 out of 51 supporting invariants were superfluous and have been removed [2019-01-02 00:21:10,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:10,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:10,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:10,693 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:21:10,694 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-02 00:21:10,694 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-02 00:21:10,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 86 states and 99 transitions. Complement of second has 9 states. [2019-01-02 00:21:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-02 00:21:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2019-01-02 00:21:10,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 5 letters. [2019-01-02 00:21:10,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:10,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 27 letters. Loop has 5 letters. [2019-01-02 00:21:10,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:10,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 22 letters. Loop has 10 letters. [2019-01-02 00:21:10,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:10,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 99 transitions. [2019-01-02 00:21:10,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:21:10,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 63 states and 74 transitions. [2019-01-02 00:21:10,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-02 00:21:10,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-02 00:21:10,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 74 transitions. [2019-01-02 00:21:10,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:21:10,775 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-01-02 00:21:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 74 transitions. [2019-01-02 00:21:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-01-02 00:21:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-02 00:21:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-01-02 00:21:10,779 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-01-02 00:21:10,779 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-01-02 00:21:10,779 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:21:10,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-01-02 00:21:10,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-02 00:21:10,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:10,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:10,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:21:10,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:21:10,782 INFO L794 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1294#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~ret24.base, main_#t~ret24.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~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1295#L581 assume !(main_~length1~0 < 1); 1270#L581-2 assume !(main_~length2~0 < 1); 1271#L584-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.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);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1283#L566 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~mem14;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1284#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1304#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1309#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1305#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1292#L544-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1293#L544-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1300#L544-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1290#L544-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1291#L544-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1272#L546 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1273#L568-4 goto; 1274#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1275#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1307#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1316#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1313#L551 assume !(0 == cstrncmp_~n % 4294967296); 1314#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1310#L554 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 1308#L559 cstrstr_#t~ret16 := cstrncmp_#res; 1285#L568-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1286#L568-4 goto; 1269#L569-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1276#L570 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1265#L569 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1266#L568-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1277#L551 assume !(0 == cstrncmp_~n % 4294967296); 1301#L553-4 [2019-01-02 00:21:10,782 INFO L796 eck$LassoCheckResult]: Loop: 1301#L553-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 1287#L554 assume !(cstrncmp_#t~mem6 != cstrncmp_#t~mem7);havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem7;cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post11.base, 1 + cstrncmp_#t~post11.offset;call cstrncmp_#t~mem12 := read~int(cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, 1); 1279#L556 assume !(0 == cstrncmp_#t~mem12);havoc cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset;havoc cstrncmp_#t~mem12; 1280#L553-1 cstrncmp_#t~pre4 := cstrncmp_~n - 1;cstrncmp_~n := cstrncmp_~n - 1; 1297#L553-2 assume !!(0 != cstrncmp_#t~pre4 % 4294967296);havoc cstrncmp_#t~pre4; 1301#L553-4 [2019-01-02 00:21:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2019-01-02 00:21:10,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:10,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:10,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2019-01-02 00:21:10,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:10,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2019-01-02 00:21:10,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:10,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:10,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:10,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:21:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:11,506 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-02 00:21:13,492 WARN L181 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 328 DAG size of output: 261 [2019-01-02 00:21:14,552 WARN L181 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 159 [2019-01-02 00:21:14,560 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:14,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:14,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:14,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:14,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:14,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:14,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:14,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:14,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2019-01-02 00:21:14,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:14,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:14,565 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:21:14,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:21:14,582 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:21:14,585 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:21:14,588 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:21:14,591 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:21:14,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:21:14,635 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:21:14,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:14,639 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:21:14,641 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:21:14,643 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:21:14,646 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:21:14,648 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:21:14,650 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:21:14,662 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:21:14,664 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:21:14,666 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:21:14,668 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:21:14,672 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:21:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:14,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:14,682 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:21:14,684 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:21:14,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:14,697 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:21:16,206 WARN L181 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 147 [2019-01-02 00:21:16,626 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-01-02 00:21:16,627 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:21:16,635 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:21:16,638 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:21:16,639 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:21:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:16,644 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:21:16,646 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:21:16,649 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:21:16,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:16,654 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:21:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:21:17,343 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-01-02 00:21:17,719 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-02 00:21:18,720 WARN L181 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-01-02 00:21:18,964 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-02 00:21:19,075 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-02 00:21:19,777 WARN L181 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-01-02 00:21:19,897 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:19,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:19,897 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:21:19,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,909 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:21:19,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,911 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:21:19,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:19,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,917 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:21:19,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,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:21:19,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,927 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:21:19,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:19,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:19,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,933 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:21:19,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,938 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:21:19,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,940 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:21:19,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,945 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:21:19,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,949 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:21:19,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,953 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:21:19,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,957 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:21:19,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,959 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:21:19,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,963 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:21:19,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,967 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:21:19,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,974 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:21:19,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,976 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:21:19,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,981 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:21:19,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,989 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:21:19,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,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:21:19,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:19,992 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:21:19,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:19,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:19,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:19,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:19,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:19,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:19,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:19,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,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:21:20,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:20,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,007 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:21:20,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:20,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:20,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:20,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,013 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:21:20,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,014 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:21:20,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,016 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:21:20,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:20,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:20,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,036 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:21:20,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:20,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,041 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:21:20,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:20,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,055 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:21:20,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,058 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:21:20,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,067 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:21:20,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,108 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:21:20,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:20,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:20,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:21:20,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:20,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:20,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:20,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:20,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:20,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:20,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:20,285 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:21:20,286 INFO L444 ModelExtractionUtils]: 78 out of 85 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:21:20,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:20,287 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:20,287 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:20,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_2) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrstr_#in~s.base)_2 Supporting invariants [] [2019-01-02 00:21:21,587 INFO L297 tatePredicateManager]: 82 out of 84 supporting invariants were superfluous and have been removed [2019-01-02 00:21:21,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:21,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:21,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:21,737 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:21:21,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-02 00:21:21,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:21:21,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 80 states and 94 transitions. Complement of second has 9 states. [2019-01-02 00:21:21,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-02 00:21:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2019-01-02 00:21:21,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 32 letters. Loop has 5 letters. [2019-01-02 00:21:21,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:21,842 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:21,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:21,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:22,084 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:21:22,085 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-02 00:21:22,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:21:22,174 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 79 states and 93 transitions. Complement of second has 9 states. [2019-01-02 00:21:22,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-02 00:21:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-01-02 00:21:22,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2019-01-02 00:21:22,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,178 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:21:22,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:22,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:22,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:22,355 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:21:22,355 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-01-02 00:21:22,355 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:21:22,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 82 states and 96 transitions. Complement of second has 8 states. [2019-01-02 00:21:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:21:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-02 00:21:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2019-01-02 00:21:22,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 32 letters. Loop has 5 letters. [2019-01-02 00:21:22,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 37 letters. Loop has 5 letters. [2019-01-02 00:21:22,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 32 letters. Loop has 10 letters. [2019-01-02 00:21:22,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:22,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 96 transitions. [2019-01-02 00:21:22,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:22,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 0 states and 0 transitions. [2019-01-02 00:21:22,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:21:22,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:21:22,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:21:22,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:22,578 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:22,578 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:22,578 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:22,578 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:21:22,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:21:22,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:22,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:21:22,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:21:22 BoogieIcfgContainer [2019-01-02 00:21:22,595 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:21:22,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:21:22,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:21:22,596 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:21:22,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:50" (3/4) ... [2019-01-02 00:21:22,604 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:21:22,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:21:22,607 INFO L168 Benchmark]: Toolchain (without parser) took 33635.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.1 MB). Free memory was 951.3 MB in the beginning and 1.5 GB in the end (delta: -540.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:22,608 INFO L168 Benchmark]: CDTParser took 0.16 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:21:22,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:22,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:22,613 INFO L168 Benchmark]: Boogie Preprocessor took 38.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:22,613 INFO L168 Benchmark]: RCFGBuilder took 599.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:22,614 INFO L168 Benchmark]: BuchiAutomizer took 32221.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 382.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -417.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:22,618 INFO L168 Benchmark]: Witness Printer took 8.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:22,624 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.16 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 702.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 599.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32221.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 382.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -417.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 8.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s] and consists of 6 locations. One nondeterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 29.5s. Construction of modules took 0.5s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 267 SDtfs, 341 SDslu, 547 SDs, 0 SdLazy, 218 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital298 mio100 ax100 hnf99 lsp97 ukn89 mio100 lsp45 div139 bol100 ite100 ukn100 eq171 hnf76 smp95 dnf225 smp87 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...