./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb7c0b0be083ae28de17688b83fb766e3f101f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:16:36,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:16:36,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:16:36,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:16:36,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:16:36,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:16:36,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:16:36,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:16:36,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:16:36,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:16:36,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:16:36,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:16:36,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:16:36,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:16:36,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:16:36,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:16:36,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:16:36,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:16:36,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:16:36,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:16:36,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:16:36,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:16:36,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:16:36,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:16:36,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:16:36,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:16:36,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:16:36,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:16:36,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:16:36,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:16:36,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:16:36,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:16:36,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:16:36,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:16:36,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:16:36,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:16:36,982 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 14:16:36,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:16:36,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:16:36,993 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:16:36,993 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:16:36,993 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:16:36,993 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:16:36,993 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:16:36,994 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:16:36,994 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:16:36,994 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:16:36,994 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:16:36,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:16:36,994 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:16:36,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:16:36,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:16:36,996 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:16:36,996 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:16:36,996 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:16:36,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:16:36,996 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:16:36,996 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:16:36,997 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:16:36,997 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2018-11-23 14:16:37,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:16:37,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:16:37,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:16:37,028 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:16:37,029 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:16:37,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2018-11-23 14:16:37,062 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/data/d7bb80dc1/41169e664f2949b9955d0ee0a4d41df4/FLAG40ac0251c [2018-11-23 14:16:37,484 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:16:37,484 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2018-11-23 14:16:37,492 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/data/d7bb80dc1/41169e664f2949b9955d0ee0a4d41df4/FLAG40ac0251c [2018-11-23 14:16:37,500 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/data/d7bb80dc1/41169e664f2949b9955d0ee0a4d41df4 [2018-11-23 14:16:37,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:16:37,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:16:37,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:16:37,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:16:37,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:16:37,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8308fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37, skipping insertion in model container [2018-11-23 14:16:37,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:16:37,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:16:37,722 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:16:37,730 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:16:37,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:16:37,824 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:16:37,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37 WrapperNode [2018-11-23 14:16:37,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:16:37,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:16:37,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:16:37,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:16:37,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:16:37,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:16:37,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:16:37,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:16:37,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... [2018-11-23 14:16:37,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:16:37,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:16:37,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:16:37,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:16:37,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc42cf19-04d2-4e5c-bfe0-13e356c7cb47/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:16:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:16:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:16:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:16:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:16:37,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:16:37,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:16:38,101 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:16:38,101 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 14:16:38,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:38 BoogieIcfgContainer [2018-11-23 14:16:38,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:16:38,102 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:16:38,102 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:16:38,105 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:16:38,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:16:38,106 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:16:37" (1/3) ... [2018-11-23 14:16:38,107 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91a6f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:38, skipping insertion in model container [2018-11-23 14:16:38,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:16:38,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:37" (2/3) ... [2018-11-23 14:16:38,108 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@91a6f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:38, skipping insertion in model container [2018-11-23 14:16:38,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:16:38,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:38" (3/3) ... [2018-11-23 14:16:38,109 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-termination.c.i [2018-11-23 14:16:38,152 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:16:38,153 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:16:38,153 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:16:38,153 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:16:38,153 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:16:38,153 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:16:38,153 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:16:38,153 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:16:38,153 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:16:38,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:16:38,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 14:16:38,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:16:38,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:16:38,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:16:38,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 14:16:38,185 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:16:38,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:16:38,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 14:16:38,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:16:38,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:16:38,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:16:38,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 14:16:38,192 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 3#L552-4true [2018-11-23 14:16:38,193 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 20#L552-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 3#L552-4true [2018-11-23 14:16:38,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 14:16:38,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 14:16:38,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:38,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:38,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:38,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:16:38,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:16:38,334 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:16:38,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:16:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:16:38,344 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 14:16:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:16:38,349 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 14:16:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:16:38,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 14:16:38,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 14:16:38,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 14:16:38,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 14:16:38,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 14:16:38,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 14:16:38,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:16:38,356 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 14:16:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 14:16:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 14:16:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 14:16:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 14:16:38,373 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 14:16:38,373 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 14:16:38,374 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:16:38,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 14:16:38,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 14:16:38,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:16:38,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:16:38,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 14:16:38,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:16:38,375 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 44#L552-4 [2018-11-23 14:16:38,375 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 51#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 55#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 46#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 47#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 44#L552-4 [2018-11-23 14:16:38,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 14:16:38,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:38,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 14:16:38,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:38,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:16:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 14:16:38,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:38,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:38,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:38,629 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-23 14:16:38,782 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 14:16:38,982 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-23 14:16:39,056 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:16:39,057 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:16:39,057 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:16:39,057 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:16:39,057 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:16:39,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:16:39,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:16:39,058 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:16:39,058 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 14:16:39,058 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:16:39,058 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:16:39,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:39,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:16:39,765 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:16:39,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:39,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:39,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:39,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:39,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:39,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,772 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:16:39,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,776 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:16:39,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:39,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,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 [2018-11-23 14:16:39,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:39,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:39,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,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 [2018-11-23 14:16:39,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:39,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:39,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:39,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:39,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:39,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:39,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:39,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:39,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:39,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,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 [2018-11-23 14:16:39,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:39,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:39,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:39,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 [2018-11-23 14:16:39,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:39,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:39,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:39,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:39,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:39,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:39,850 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:16:39,864 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:16:39,865 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 14:16:39,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:16:39,867 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:16:39,867 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:16:39,868 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2018-11-23 14:16:39,908 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 14:16:39,915 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 14:16:39,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:39,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:39,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:40,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:16:40,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 14:16:40,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-23 14:16:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:16:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:16:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 14:16:40,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 14:16:40,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:40,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 14:16:40,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:40,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 14:16:40,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:40,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 14:16:40,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:16:40,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 14:16:40,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 14:16:40,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 14:16:40,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 14:16:40,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:16:40,071 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 14:16:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 14:16:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 14:16:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 14:16:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 14:16:40,072 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 14:16:40,072 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 14:16:40,072 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:16:40,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 14:16:40,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:16:40,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:16:40,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:16:40,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:16:40,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:16:40,073 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 178#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 193#L555-5 [2018-11-23 14:16:40,073 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 187#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 188#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 193#L555-5 [2018-11-23 14:16:40,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 14:16:40,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:40,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:40,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:40,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:40,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:40,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 14:16:40,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:40,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 14:16:40,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:40,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:40,377 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-23 14:16:40,441 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:16:40,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:16:40,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:16:40,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:16:40,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:16:40,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:16:40,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:16:40,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:16:40,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 14:16:40,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:16:40,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:16:40,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:40,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:41,032 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 14:16:41,040 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:16:41,040 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:16:41,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:41,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:41,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:41,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,089 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:16:41,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:16:41,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,102 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:16:41,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,105 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:16:41,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,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 [2018-11-23 14:16:41,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:41,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:41,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:41,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:41,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:41,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:41,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:41,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:41,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:16:41,177 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 14:16:41,177 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 14:16:41,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:16:41,178 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:16:41,178 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:16:41,178 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 14:16:41,232 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 14:16:41,234 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 14:16:41,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:41,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:41,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:41,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 14:16:41,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 14:16:41,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-11-23 14:16:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:16:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:16:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 14:16:41,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 14:16:41,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:41,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 14:16:41,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:41,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 14:16:41,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:41,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 14:16:41,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:16:41,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 14:16:41,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 14:16:41,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 14:16:41,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 14:16:41,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:16:41,320 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 14:16:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 14:16:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 14:16:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 14:16:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 14:16:41,322 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 14:16:41,322 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 14:16:41,323 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:16:41,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 14:16:41,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:16:41,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:16:41,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:16:41,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:16:41,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:16:41,324 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L565 assume !(main_~length1~0 < 1); 359#L565-2 assume !(main_~length2~0 < 1); 357#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 350#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 351#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 367#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 372#L555-1 assume !cstrspn_#t~short7; 371#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 370#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 355#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 356#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 352#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 354#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 366#L555-5 [2018-11-23 14:16:41,324 INFO L796 eck$LassoCheckResult]: Loop: 366#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 360#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 361#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 366#L555-5 [2018-11-23 14:16:41,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 14:16:41,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:41,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:41,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:41,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:16:41,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:16:41,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:16:41,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:41,379 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 14:16:41,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:41,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:41,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:41,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:16:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:16:41,490 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-23 14:16:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:16:41,548 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-23 14:16:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 14:16:41,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-23 14:16:41,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 14:16:41,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-23 14:16:41,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 14:16:41,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 14:16:41,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-23 14:16:41,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:16:41,551 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-23 14:16:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-23 14:16:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 14:16:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 14:16:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-23 14:16:41,552 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 14:16:41,552 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-23 14:16:41,552 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:16:41,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-23 14:16:41,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 14:16:41,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:16:41,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:16:41,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:16:41,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 14:16:41,554 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 436#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 430#L565 assume !(main_~length1~0 < 1); 431#L565-2 assume !(main_~length2~0 < 1); 429#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 422#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 423#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 439#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 440#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 442#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 441#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 427#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 428#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 424#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 426#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 438#L555-5 [2018-11-23 14:16:41,554 INFO L796 eck$LassoCheckResult]: Loop: 438#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 432#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 433#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 438#L555-5 [2018-11-23 14:16:41,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 14:16:41,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:16:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 14:16:41,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:41,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:16:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 14:16:41,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:16:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:16:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:16:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:16:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:16:42,156 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2018-11-23 14:16:42,708 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-23 14:16:42,710 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:16:42,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:16:42,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:16:42,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:16:42,710 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:16:42,710 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:16:42,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:16:42,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:16:42,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 14:16:42,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:16:42,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:16:42,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:42,864 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:16:43,286 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-23 14:16:43,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:16:43,802 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-23 14:16:44,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:16:44,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:16:44,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:44,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:44,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:44,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:44,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,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 [2018-11-23 14:16:44,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:16:44,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:16:44,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:16:44,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,040 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:16:44,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,042 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:16:44,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,048 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 14:16:44,048 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 14:16:44,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,070 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-23 14:16:44,070 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 14:16:44,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,176 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:16:44,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,178 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:16:44,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:16:44,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:16:44,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:16:44,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:16:44,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:16:44,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:16:44,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:16:44,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:16:44,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:16:44,208 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:16:44,209 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:16:44,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:16:44,209 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:16:44,210 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:16:44,210 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-23 14:16:44,355 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-23 14:16:44,357 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 14:16:44,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:44,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:44,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:44,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 14:16:44,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 14:16:44,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 14:16:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:16:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:16:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 14:16:44,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 14:16:44,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:44,447 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:16:44,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:44,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:44,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:44,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 14:16:44,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 14:16:44,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 14:16:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:16:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:16:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 14:16:44,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 14:16:44,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:44,564 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 14:16:44,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:44,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:44,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:44,622 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 14:16:44,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 14:16:44,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-23 14:16:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:16:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:16:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 14:16:44,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 14:16:44,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:44,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 14:16:44,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:44,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 14:16:44,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:16:44,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 14:16:44,650 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:16:44,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 14:16:44,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:16:44,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:16:44,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:16:44,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:16:44,651 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:16:44,651 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:16:44,651 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:16:44,651 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:16:44,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:16:44,651 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:16:44,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:16:44,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:16:44 BoogieIcfgContainer [2018-11-23 14:16:44,656 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:16:44,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:16:44,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:16:44,656 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:16:44,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:38" (3/4) ... [2018-11-23 14:16:44,659 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:16:44,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:16:44,660 INFO L168 Benchmark]: Toolchain (without parser) took 7157.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 956.4 MB in the beginning and 842.8 MB in the end (delta: 113.7 MB). Peak memory consumption was 442.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:16:44,660 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:16:44,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:16:44,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.98 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:16:44,661 INFO L168 Benchmark]: Boogie Preprocessor took 22.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:16:44,662 INFO L168 Benchmark]: RCFGBuilder took 222.09 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:16:44,662 INFO L168 Benchmark]: BuchiAutomizer took 6553.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 842.8 MB in the end (delta: 256.0 MB). Peak memory consumption was 440.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:16:44,663 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.4 GB. Free memory is still 842.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:16:44,665 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.98 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.09 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6553.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 842.8 MB in the end (delta: 256.0 MB). Peak memory consumption was 440.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.4 GB. Free memory is still 842.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 122 SDslu, 72 SDs, 0 SdLazy, 103 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax105 hnf99 lsp86 ukn70 mio100 lsp31 div136 bol100 ite100 ukn100 eq161 hnf77 smp95 dnf675 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 128ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...