./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fcd11173df80f9a00fde2714abfd2a4ff8d40757 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:36:17,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:36:17,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:36:17,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:36:17,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:36:17,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:36:17,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:36:17,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:36:17,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:36:17,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:36:17,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:36:17,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:36:17,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:36:17,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:36:17,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:36:17,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:36:17,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:36:17,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:36:17,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:36:17,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:36:17,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:36:17,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:36:17,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:36:17,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:36:17,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:36:17,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:36:17,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:36:17,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:36:17,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:36:17,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:36:17,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:36:17,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:36:17,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:36:17,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:36:17,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:36:17,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:36:17,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:36:17,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:36:17,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:36:17,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:36:17,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:36:17,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:36:17,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:36:17,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:36:17,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:36:17,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:36:17,949 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:36:17,949 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:36:17,950 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:36:17,951 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:36:17,951 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:36:17,951 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:36:17,953 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:36:17,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:36:17,953 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:36:17,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:36:17,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:36:17,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:36:17,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:36:17,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:36:17,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:36:17,956 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:36:17,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:36:17,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:36:17,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:36:17,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:36:17,957 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:36:17,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:36:17,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:36:17,958 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:36:17,959 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:36:17,960 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:36:17,960 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2019-11-28 20:36:18,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:36:18,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:36:18,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:36:18,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:36:18,297 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:36:18,297 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2019-11-28 20:36:18,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98024818/584458d0655f4bfeb79242ae0fc1b481/FLAG2a841bc26 [2019-11-28 20:36:18,906 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:36:18,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2019-11-28 20:36:18,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98024818/584458d0655f4bfeb79242ae0fc1b481/FLAG2a841bc26 [2019-11-28 20:36:19,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98024818/584458d0655f4bfeb79242ae0fc1b481 [2019-11-28 20:36:19,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:36:19,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:36:19,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:36:19,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:36:19,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:36:19,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:19,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bbc6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19, skipping insertion in model container [2019-11-28 20:36:19,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:19,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:36:19,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:36:19,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:36:19,797 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:36:19,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:36:19,970 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:36:19,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19 WrapperNode [2019-11-28 20:36:19,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:36:19,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:36:19,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:36:19,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:36:19,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:36:20,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:36:20,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:36:20,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:36:20,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... [2019-11-28 20:36:20,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:36:20,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:36:20,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:36:20,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:36:20,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:36:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:36:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:36:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:36:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:36:20,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:36:20,635 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:36:20,636 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:36:20,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:20 BoogieIcfgContainer [2019-11-28 20:36:20,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:36:20,638 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:36:20,638 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:36:20,641 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:36:20,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:36:20,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:36:19" (1/3) ... [2019-11-28 20:36:20,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36a3bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:36:20, skipping insertion in model container [2019-11-28 20:36:20,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:36:20,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:19" (2/3) ... [2019-11-28 20:36:20,645 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36a3bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:36:20, skipping insertion in model container [2019-11-28 20:36:20,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:36:20,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:20" (3/3) ... [2019-11-28 20:36:20,647 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2019-11-28 20:36:20,693 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:36:20,694 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:36:20,694 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:36:20,694 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:36:20,694 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:36:20,694 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:36:20,694 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:36:20,695 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:36:20,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 20:36:20,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:36:20,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:20,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:20,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:36:20,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:36:20,737 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:36:20,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 20:36:20,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:36:20,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:20,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:20,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:36:20,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:36:20,749 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2019-11-28 20:36:20,750 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-11-28 20:36:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 20:36:20,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:20,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143585328] [2019-11-28 20:36:20,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:20,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-28 20:36:20,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:20,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274614276] [2019-11-28 20:36:20,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:20,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274614276] [2019-11-28 20:36:20,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:36:20,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:36:20,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484106263] [2019-11-28 20:36:20,973 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:36:20,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:36:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:36:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:36:20,994 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-28 20:36:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:36:21,002 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-28 20:36:21,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:36:21,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-28 20:36:21,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:36:21,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-28 20:36:21,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 20:36:21,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 20:36:21,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-28 20:36:21,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:36:21,014 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:36:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-28 20:36:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 20:36:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:36:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-28 20:36:21,043 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:36:21,043 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-28 20:36:21,044 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:36:21,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-28 20:36:21,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:36:21,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:21,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:21,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:36:21,046 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:21,046 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2019-11-28 20:36:21,046 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-11-28 20:36:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-28 20:36:21,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:21,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409016212] [2019-11-28 20:36:21,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:21,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-28 20:36:21,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:21,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278199668] [2019-11-28 20:36:21,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:21,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-28 20:36:21,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:21,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108158294] [2019-11-28 20:36:21,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:21,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:21,535 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-28 20:36:21,853 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-28 20:36:22,267 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-11-28 20:36:22,409 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 20:36:22,422 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:36:22,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:36:22,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:36:22,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:36:22,423 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:36:22,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:22,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:36:22,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:36:22,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration2_Lasso [2019-11-28 20:36:22,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:36:22,425 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:36:22,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:22,978 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-28 20:36:23,180 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-28 20:36:23,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:23,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:23,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:23,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:24,057 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-11-28 20:36:24,129 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:36:24,136 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:24,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:24,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:24,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:24,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:24,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:24,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:24,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:24,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:24,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:24,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:24,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:24,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:24,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:24,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:24,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:24,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:24,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:24,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:36:24,570 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 20:36:24,570 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:24,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:24,658 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:36:24,659 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:36:24,660 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [1*ULTIMATE.start_main_~length1~0 - 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 >= 0] [2019-11-28 20:36:24,767 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2019-11-28 20:36:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:24,844 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:36:24,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:24,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:36:24,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:24,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:36:24,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 20:36:25,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-11-28 20:36:25,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:36:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:36:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-28 20:36:25,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 20:36:25,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:25,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-28 20:36:25,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:25,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-28 20:36:25,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:25,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-28 20:36:25,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:25,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-28 20:36:25,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:36:25,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:36:25,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-28 20:36:25,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:25,020 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 20:36:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-28 20:36:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 20:36:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:36:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 20:36:25,022 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 20:36:25,022 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 20:36:25,022 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:36:25,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-28 20:36:25,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:25,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:25,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:25,024 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:25,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:36:25,024 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 190#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 191#L382 assume !(main_~length1~0 < 1); 192#L382-2 assume !(main_~length2~0 < 1); 189#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 186#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 188#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 198#L372-5 [2019-11-28 20:36:25,025 INFO L796 eck$LassoCheckResult]: Loop: 198#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 193#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 194#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 198#L372-5 [2019-11-28 20:36:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-28 20:36:25,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:25,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547887998] [2019-11-28 20:36:25,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:25,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-28 20:36:25,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:25,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434780136] [2019-11-28 20:36:25,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:25,132 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-28 20:36:25,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:25,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379314936] [2019-11-28 20:36:25,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:25,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:25,379 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-28 20:36:25,818 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-11-28 20:36:25,985 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 20:36:25,988 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:36:25,988 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:36:25,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:36:25,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:36:25,989 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:36:25,989 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:25,989 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:36:25,989 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:36:25,989 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration3_Lasso [2019-11-28 20:36:25,989 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:36:25,989 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:36:26,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,453 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-28 20:36:26,611 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-28 20:36:26,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:26,847 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-28 20:36:27,548 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-28 20:36:27,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:36:27,579 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:27,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:27,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:27,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:27,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:27,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:27,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:27,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:27,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:27,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:27,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:27,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:27,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:27,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:27,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:27,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:27,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:27,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:27,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:27,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:27,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:27,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:27,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:27,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:27,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:27,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:27,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:27,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:27,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:27,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:27,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:27,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:27,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:36:27,830 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 20:36:27,830 INFO L444 ModelExtractionUtils]: 11 out of 52 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:27,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:36:27,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:36:27,843 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:36:27,843 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-28 20:36:27,910 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2019-11-28 20:36:27,913 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:36:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:27,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:36:27,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:27,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:36:27,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:28,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:36:28,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:36:28,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-11-28 20:36:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:36:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:36:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:36:28,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 20:36:28,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:28,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 20:36:28,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:28,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 20:36:28,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:28,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-28 20:36:28,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:28,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-28 20:36:28,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:36:28,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:36:28,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-28 20:36:28,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:28,077 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-28 20:36:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-28 20:36:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-28 20:36:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:36:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-28 20:36:28,081 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 20:36:28,081 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-28 20:36:28,081 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:36:28,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-28 20:36:28,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:28,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:28,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:28,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:28,083 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:36:28,084 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 379#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 380#L382 assume !(main_~length1~0 < 1); 381#L382-2 assume !(main_~length2~0 < 1); 378#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 374#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 375#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 388#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 384#L372-1 assume !cstrcspn_#t~short210; 385#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 370#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 371#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 372#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 373#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 377#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 387#L372-5 [2019-11-28 20:36:28,084 INFO L796 eck$LassoCheckResult]: Loop: 387#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 382#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 383#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 387#L372-5 [2019-11-28 20:36:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-28 20:36:28,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:28,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160652297] [2019-11-28 20:36:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:28,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-28 20:36:28,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:28,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210335991] [2019-11-28 20:36:28,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:28,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-11-28 20:36:28,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:28,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894596174] [2019-11-28 20:36:28,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894596174] [2019-11-28 20:36:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515976048] [2019-11-28 20:36:28,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:36:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:28,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 20:36:28,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:28,374 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-28 20:36:28,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-28 20:36:28,375 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:36:28,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:36:28,383 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-28 20:36:28,383 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-28 20:36:40,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:36:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:40,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:36:40,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-28 20:36:40,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163678727] [2019-11-28 20:36:40,743 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-28 20:36:40,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:36:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:36:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-11-28 20:36:40,745 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-11-28 20:36:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:36:40,969 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-28 20:36:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:36:40,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-11-28 20:36:40,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:40,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-11-28 20:36:40,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:36:40,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:36:40,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-28 20:36:40,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:40,977 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-28 20:36:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-28 20:36:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-28 20:36:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:36:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-28 20:36:40,982 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-28 20:36:40,982 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-28 20:36:40,982 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:36:40,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-28 20:36:40,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:36:40,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:40,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:40,984 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:40,984 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:36:40,985 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 535#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 536#L382 assume !(main_~length1~0 < 1); 537#L382-2 assume !(main_~length2~0 < 1); 534#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 530#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 531#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 550#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 540#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 541#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 526#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 527#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 528#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 529#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 533#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 543#L372-5 [2019-11-28 20:36:40,985 INFO L796 eck$LassoCheckResult]: Loop: 543#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 538#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 539#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 543#L372-5 [2019-11-28 20:36:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-28 20:36:40,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:40,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256694593] [2019-11-28 20:36:40,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:41,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-28 20:36:41,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:41,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190326668] [2019-11-28 20:36:41,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:41,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-28 20:36:41,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:41,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196431853] [2019-11-28 20:36:41,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:41,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:41,297 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-28 20:36:42,072 WARN L192 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 139 [2019-11-28 20:36:43,317 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-11-28 20:36:43,322 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:36:43,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:36:43,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:36:43,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:36:43,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:36:43,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:43,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:36:43,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:36:43,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration5_Lasso [2019-11-28 20:36:43,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:36:43,323 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:36:43,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:43,612 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-28 20:36:44,568 WARN L192 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2019-11-28 20:36:44,768 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-28 20:36:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:45,034 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-28 20:36:45,200 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-28 20:36:46,480 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-11-28 20:36:46,736 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-11-28 20:36:46,749 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:36:46,749 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:46,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:46,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:46,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:46,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:46,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:46,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:46,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:46,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:46,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:46,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:46,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:46,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:46,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:46,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:46,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:46,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:46,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:46,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:46,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:46,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:46,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:46,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:46,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:46,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:46,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:46,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:46,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:46,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:46,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:36:46,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:46,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:46,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:46,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:46,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:46,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:46,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:36:47,019 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2019-11-28 20:36:47,019 INFO L444 ModelExtractionUtils]: 8 out of 49 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:47,023 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:36:47,025 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:36:47,025 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:36:47,026 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 Supporting invariants [] [2019-11-28 20:36:47,166 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2019-11-28 20:36:47,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:36:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:47,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:36:47,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:47,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:36:47,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:47,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:36:47,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:36:47,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-11-28 20:36:47,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:36:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:36:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:36:47,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 20:36:47,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:47,323 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:36:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:47,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:36:47,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:47,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:36:47,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:47,402 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:36:47,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:36:47,444 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-11-28 20:36:47,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:36:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:36:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-28 20:36:47,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 20:36:47,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:47,446 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:36:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:47,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:36:47,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:47,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:36:47,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:47,537 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:36:47,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:36:47,583 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2019-11-28 20:36:47,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:36:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:36:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-28 20:36:47,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 20:36:47,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:47,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:36:47,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:47,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-28 20:36:47,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:47,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-11-28 20:36:47,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:36:47,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-11-28 20:36:47,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:36:47,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:36:47,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:36:47,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:36:47,596 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:36:47,596 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:36:47,596 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:36:47,597 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:36:47,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:36:47,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:36:47,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:36:47,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:36:47 BoogieIcfgContainer [2019-11-28 20:36:47,604 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:36:47,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:36:47,605 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:36:47,605 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:36:47,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:20" (3/4) ... [2019-11-28 20:36:47,609 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:36:47,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:36:47,611 INFO L168 Benchmark]: Toolchain (without parser) took 28399.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 960.4 MB in the beginning and 853.8 MB in the end (delta: 106.6 MB). Peak memory consumption was 411.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:47,612 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:47,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -85.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:47,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:47,613 INFO L168 Benchmark]: Boogie Preprocessor took 69.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:47,614 INFO L168 Benchmark]: RCFGBuilder took 500.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:47,615 INFO L168 Benchmark]: BuchiAutomizer took 26966.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 1.0 GB in the beginning and 853.8 MB in the end (delta: 166.3 MB). Peak memory consumption was 396.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:47,615 INFO L168 Benchmark]: Witness Printer took 4.96 ms. Allocated memory is still 1.3 GB. Free memory is still 853.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:47,618 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -85.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 500.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26966.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 1.0 GB in the beginning and 853.8 MB in the end (delta: 166.3 MB). Peak memory consumption was 396.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.96 ms. Allocated memory is still 1.3 GB. Free memory is still 853.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 * 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 length1 + -1 * sc1 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 -1 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 25.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 168 SDslu, 100 SDs, 0 SdLazy, 147 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div131 bol100 ite100 ukn100 eq167 hnf77 smp88 dnf1057 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...