./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f6fb2bb1 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f5357e64289d6bac41f74df7b40a85eebbaa806 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 20:00:21,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:00:21,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:00:21,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:00:21,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:00:21,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:00:21,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:00:21,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:00:21,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:00:21,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:00:21,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:00:21,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:00:21,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:00:21,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:00:21,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:00:21,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:00:21,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:00:21,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:00:21,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:00:21,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:00:21,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:00:21,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:00:21,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:00:21,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:00:21,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:00:21,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:00:21,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:00:21,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:00:21,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:00:21,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:00:21,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:00:21,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:00:21,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:00:21,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:00:21,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:00:21,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:00:21,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:00:21,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:00:21,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:00:21,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:00:21,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:00:21,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 20:00:21,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:00:21,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:00:21,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:00:21,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:00:21,152 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:00:21,152 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 20:00:21,153 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 20:00:21,153 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 20:00:21,153 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 20:00:21,153 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 20:00:21,154 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 20:00:21,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:00:21,155 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:00:21,155 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 20:00:21,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:00:21,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:00:21,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:00:21,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 20:00:21,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 20:00:21,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 20:00:21,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:00:21,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:00:21,157 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 20:00:21,157 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:00:21,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 20:00:21,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:00:21,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:00:21,158 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 20:00:21,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:00:21,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:00:21,159 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 20:00:21,160 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 20:00:21,161 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2019-11-19 20:00:21,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:00:21,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:00:21,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:00:21,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:00:21,476 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:00:21,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-19 20:00:21,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c5bc415/6270d9d875fb4f49883736257caa636d/FLAG2586a9769 [2019-11-19 20:00:22,014 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:00:22,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-19 20:00:22,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c5bc415/6270d9d875fb4f49883736257caa636d/FLAG2586a9769 [2019-11-19 20:00:22,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c5bc415/6270d9d875fb4f49883736257caa636d [2019-11-19 20:00:22,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:00:22,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:00:22,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:00:22,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:00:22,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:00:22,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364d974b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22, skipping insertion in model container [2019-11-19 20:00:22,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:00:22,412 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:00:22,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:00:22,623 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:00:22,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:00:22,740 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:00:22,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22 WrapperNode [2019-11-19 20:00:22,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:00:22,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:00:22,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:00:22,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:00:22,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:00:22,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:00:22,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:00:22,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:00:22,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (1/1) ... [2019-11-19 20:00:22,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:00:22,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:00:22,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:00:22,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:00:22,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (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-19 20:00:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 20:00:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 20:00:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 20:00:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-19 20:00:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:00:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:00:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 20:00:23,206 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:00:23,207 INFO L285 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-19 20:00:23,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:23 BoogieIcfgContainer [2019-11-19 20:00:23,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:00:23,209 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 20:00:23,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 20:00:23,213 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 20:00:23,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:00:23,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:00:22" (1/3) ... [2019-11-19 20:00:23,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7966921e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:00:23, skipping insertion in model container [2019-11-19 20:00:23,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:00:23,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:22" (2/3) ... [2019-11-19 20:00:23,217 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7966921e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:00:23, skipping insertion in model container [2019-11-19 20:00:23,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:00:23,217 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:23" (3/3) ... [2019-11-19 20:00:23,219 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-11-19 20:00:23,278 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 20:00:23,279 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 20:00:23,279 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 20:00:23,279 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:00:23,280 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:00:23,280 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 20:00:23,280 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:00:23,280 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 20:00:23,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-19 20:00:23,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-19 20:00:23,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:23,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:23,332 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 20:00:23,332 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 20:00:23,333 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 20:00:23,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-19 20:00:23,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-19 20:00:23,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:23,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:23,337 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 20:00:23,337 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 20:00:23,345 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 25#L50true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L51-4true [2019-11-19 20:00:23,346 INFO L796 eck$LassoCheckResult]: Loop: 3#L51-4true parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 11#L54true assume !parse_expression_list_#t~switch4; 29#L53true havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 8#L51-1true call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L51-2true assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3#L51-4true [2019-11-19 20:00:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-19 20:00:23,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:23,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103628132] [2019-11-19 20:00:23,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:23,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2019-11-19 20:00:23,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:23,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136337363] [2019-11-19 20:00:23,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:23,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2019-11-19 20:00:23,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:23,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181931473] [2019-11-19 20:00:23,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:23,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:23,703 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-19 20:00:23,922 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-11-19 20:00:24,008 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:00:24,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:00:24,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:00:24,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:00:24,010 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:00:24,010 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:24,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:00:24,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:00:24,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-11-19 20:00:24,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:00:24,011 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:00:24,034 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-19 20:00:24,041 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-19 20:00:24,044 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-19 20:00:24,049 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-19 20:00:24,052 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-19 20:00:24,055 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-19 20:00:24,060 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-19 20:00:24,063 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-19 20:00:24,066 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-19 20:00:24,071 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-19 20:00:24,074 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-19 20:00:24,079 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-19 20:00:24,082 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-19 20:00:24,085 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-19 20:00:24,089 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-19 20:00:24,245 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-19 20:00:24,269 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-19 20:00:24,272 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-19 20:00:24,275 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-19 20:00:24,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:00:24,280 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-19 20:00:24,282 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-19 20:00:24,284 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-19 20:00:24,288 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-19 20:00:24,292 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-19 20:00:24,298 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-19 20:00:24,302 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-19 20:00:24,304 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-19 20:00:24,307 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-19 20:00:24,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:00:24,718 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-19 20:00:24,810 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:00:24,815 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:24,838 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-19 20:00:24,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:24,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:24,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:24,851 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-19 20:00:24,865 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-19 20:00:24,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:24,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:24,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:24,872 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) [2019-11-19 20:00:24,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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:24,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:24,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:24,901 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-19 20:00:24,911 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-19 20:00:24,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:24,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:24,915 INFO L402 nArgumentSynthesizer]: A total of 0 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-19 20:00:24,917 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-19 20:00:24,928 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-19 20:00:24,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:24,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:24,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:24,934 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:24,948 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-19 20:00:24,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:24,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:24,959 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-19 20:00:24,978 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-19 20:00:24,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:24,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:24,983 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-19 20:00:24,985 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:24,993 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-19 20:00:24,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:24,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:24,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:24,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:24,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:24,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:24,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:25,000 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,021 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-19 20:00:25,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,031 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-19 20:00:25,040 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-19 20:00:25,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:25,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:25,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:25,047 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-19 20:00:25,061 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-19 20:00:25,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,074 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) [2019-11-19 20:00:25,090 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:25,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:25,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:25,101 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-19 20:00:25,113 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-19 20:00:25,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:25,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:25,116 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-19 20:00:25,118 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-19 20:00:25,130 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-19 20:00:25,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:25,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:25,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,136 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,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-19 20:00:25,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,152 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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,157 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-19 20:00:25,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,166 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-19 20:00:25,172 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-19 20:00:25,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:25,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,174 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-19 20:00:25,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,175 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-19 20:00:25,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:25,190 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-19 20:00:25,210 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-19 20:00:25,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,219 INFO L402 nArgumentSynthesizer]: A total of 2 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-19 20:00:25,227 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,235 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-19 20:00:25,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,237 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-19 20:00:25,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,259 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-19 20:00:25,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,274 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-19 20:00:25,309 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-19 20:00:25,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,319 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-19 20:00:25,325 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-19 20:00:25,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:25,333 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-19 20:00:25,346 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-19 20:00:25,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:25,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:25,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:25,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:25,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:25,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:25,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:00:25,478 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-19 20:00:25,478 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. 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-19 20:00:25,533 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 20:00:25,539 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:00:25,539 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:00:25,540 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~i~0) = -1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2019-11-19 20:00:25,568 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-19 20:00:25,576 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 20:00:25,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:25,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:00:25,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:25,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:00:25,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:25,650 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-19 20:00:25,667 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-19 20:00:25,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-11-19 20:00:25,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 99 states and 138 transitions. Complement of second has 5 states. [2019-11-19 20:00:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 20:00:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 20:00:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2019-11-19 20:00:25,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2019-11-19 20:00:25,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:25,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-19 20:00:25,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:25,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-19 20:00:25,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:25,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2019-11-19 20:00:25,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:25,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2019-11-19 20:00:25,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-19 20:00:25,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-19 20:00:25,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2019-11-19 20:00:25,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:25,793 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-11-19 20:00:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2019-11-19 20:00:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-19 20:00:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 20:00:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-19 20:00:25,832 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-19 20:00:25,832 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-19 20:00:25,832 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 20:00:25,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-11-19 20:00:25,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:25,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:25,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:25,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 20:00:25,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:25,837 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 222#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 204#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 205#L54 assume parse_expression_list_#t~switch4; 214#L55-5 [2019-11-19 20:00:25,838 INFO L796 eck$LassoCheckResult]: Loop: 214#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 215#L55-1 assume parse_expression_list_#t~short7; 219#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 214#L55-5 [2019-11-19 20:00:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2019-11-19 20:00:25,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:25,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689301143] [2019-11-19 20:00:25,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:25,912 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-11-19 20:00:25,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:25,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468489222] [2019-11-19 20:00:25,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:25,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:25,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2019-11-19 20:00:25,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:25,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116214504] [2019-11-19 20:00:25,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:26,155 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-19 20:00:26,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116214504] [2019-11-19 20:00:26,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:00:26,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:00:26,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621463310] [2019-11-19 20:00:26,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:26,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 20:00:26,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:00:26,220 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-11-19 20:00:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:26,354 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-19 20:00:26,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 20:00:26,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2019-11-19 20:00:26,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-19 20:00:26,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2019-11-19 20:00:26,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-19 20:00:26,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-19 20:00:26,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2019-11-19 20:00:26,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:26,359 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-11-19 20:00:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2019-11-19 20:00:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-11-19 20:00:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 20:00:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-11-19 20:00:26,364 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-19 20:00:26,364 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-19 20:00:26,364 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 20:00:26,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2019-11-19 20:00:26,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:26,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:26,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:26,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:26,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:26,366 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 345#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 346#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 327#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 328#L54 assume !parse_expression_list_#t~switch4; 337#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 342#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 331#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 329#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 330#L54 assume parse_expression_list_#t~switch4; 338#L55-5 [2019-11-19 20:00:26,366 INFO L796 eck$LassoCheckResult]: Loop: 338#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 339#L55-1 assume parse_expression_list_#t~short7; 372#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 338#L55-5 [2019-11-19 20:00:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2019-11-19 20:00:26,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:26,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450216539] [2019-11-19 20:00:26,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:26,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-11-19 20:00:26,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:26,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357494257] [2019-11-19 20:00:26,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:26,440 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:26,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2019-11-19 20:00:26,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:26,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713719338] [2019-11-19 20:00:26,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:26,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:26,795 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-11-19 20:00:26,878 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:00:26,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:00:26,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:00:26,879 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:00:26,879 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:00:26,879 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:26,879 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:00:26,879 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:00:26,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2019-11-19 20:00:26,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:00:26,879 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:00:26,884 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-19 20:00:26,890 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-19 20:00:26,892 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-19 20:00:26,895 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-19 20:00:26,897 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-19 20:00:26,898 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-19 20:00:26,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:00:26,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:00:26,904 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-19 20:00:26,906 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-19 20:00:26,910 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-19 20:00:26,914 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-19 20:00:26,917 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-19 20:00:27,089 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-19 20:00:27,116 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-19 20:00:27,120 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-19 20:00:27,121 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-19 20:00:27,123 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-19 20:00:27,125 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-19 20:00:27,128 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-19 20:00:27,137 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-19 20:00:27,138 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-19 20:00:27,141 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-19 20:00:27,143 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-19 20:00:27,146 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-19 20:00:27,148 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-19 20:00:27,149 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-19 20:00:27,151 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-19 20:00:27,597 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-19 20:00:27,623 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:00:27,623 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 20:00:27,633 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-19 20:00:27,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:27,636 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-19 20:00:27,642 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-19 20:00:27,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:27,646 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 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-19 20:00:27,651 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-19 20:00:27,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:27,658 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:27,671 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-19 20:00:27,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,676 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:27,683 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-19 20:00:27,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,691 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) [2019-11-19 20:00:27,698 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-19 20:00:27,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,702 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-19 20:00:27,708 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-19 20:00:27,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:27,711 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-19 20:00:27,718 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-19 20:00:27,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:27,729 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) [2019-11-19 20:00:27,738 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-19 20:00:27,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,742 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) [2019-11-19 20:00:27,748 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-19 20:00:27,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,752 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) [2019-11-19 20:00:27,758 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-19 20:00:27,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:27,774 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) [2019-11-19 20:00:27,779 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-19 20:00:27,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:27,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:27,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,784 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) [2019-11-19 20:00:27,790 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-19 20:00:27,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:27,804 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-19 20:00:27,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,808 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-19 20:00:27,813 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-19 20:00:27,819 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-19 20:00:27,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,824 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-19 20:00:27,847 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-19 20:00:27,855 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:27,861 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 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-19 20:00:27,867 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-19 20:00:27,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:27,873 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,881 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-19 20:00:27,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:27,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:27,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:27,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:27,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:27,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:27,902 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:00:27,940 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-19 20:00:27,940 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:27,944 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 20:00:27,946 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:00:27,946 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:00:27,946 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2, ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset Supporting invariants [] [2019-11-19 20:00:27,977 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-19 20:00:27,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 20:00:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:28,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 20:00:28,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:28,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 20:00:28,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:28,081 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-19 20:00:28,081 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-19 20:00:28,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-19 20:00:28,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 153 states and 213 transitions. Complement of second has 8 states. [2019-11-19 20:00:28,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 20:00:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 20:00:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-11-19 20:00:28,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-19 20:00:28,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:28,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-19 20:00:28,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:28,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-19 20:00:28,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:28,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2019-11-19 20:00:28,187 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-11-19 20:00:28,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2019-11-19 20:00:28,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-19 20:00:28,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-19 20:00:28,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2019-11-19 20:00:28,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:28,191 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2019-11-19 20:00:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2019-11-19 20:00:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-19 20:00:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 20:00:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-11-19 20:00:28,198 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-11-19 20:00:28,198 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-11-19 20:00:28,198 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 20:00:28,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2019-11-19 20:00:28,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:28,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:28,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:28,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:28,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:28,200 INFO L794 eck$LassoCheckResult]: Stem: 677#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 653#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 654#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 632#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 633#L54 assume parse_expression_list_#t~switch4; 661#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 678#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 650#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 638#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 639#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 662#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 663#L58-8 [2019-11-19 20:00:28,200 INFO L796 eck$LassoCheckResult]: Loop: 663#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 670#L58-1 assume !parse_expression_list_#t~short14; 656#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 663#L58-8 [2019-11-19 20:00:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2019-11-19 20:00:28,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486686999] [2019-11-19 20:00:28,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2019-11-19 20:00:28,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255127624] [2019-11-19 20:00:28,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:28,233 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-19 20:00:28,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255127624] [2019-11-19 20:00:28,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:00:28,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:00:28,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880409428] [2019-11-19 20:00:28,235 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 20:00:28,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:00:28,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:00:28,236 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-19 20:00:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:28,250 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-19 20:00:28,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:00:28,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-19 20:00:28,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:28,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2019-11-19 20:00:28,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-19 20:00:28,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-19 20:00:28,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2019-11-19 20:00:28,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:28,257 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-19 20:00:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2019-11-19 20:00:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-19 20:00:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 20:00:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-11-19 20:00:28,268 INFO L711 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-19 20:00:28,268 INFO L591 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-11-19 20:00:28,268 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 20:00:28,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2019-11-19 20:00:28,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:28,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:28,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:28,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:28,270 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 20:00:28,270 INFO L794 eck$LassoCheckResult]: Stem: 827#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 804#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 805#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 784#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 785#L54 assume parse_expression_list_#t~switch4; 796#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 797#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 835#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 832#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 816#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 807#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 808#L58-8 [2019-11-19 20:00:28,271 INFO L796 eck$LassoCheckResult]: Loop: 808#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 820#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 817#L58-2 assume parse_expression_list_#t~short13; 811#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 812#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 808#L58-8 [2019-11-19 20:00:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2019-11-19 20:00:28,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389722621] [2019-11-19 20:00:28,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,313 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2019-11-19 20:00:28,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218913017] [2019-11-19 20:00:28,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2019-11-19 20:00:28,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314884150] [2019-11-19 20:00:28,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:28,357 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-19 20:00:28,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314884150] [2019-11-19 20:00:28,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:00:28,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:00:28,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026074791] [2019-11-19 20:00:28,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 20:00:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:00:28,421 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-11-19 20:00:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:28,528 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2019-11-19 20:00:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 20:00:28,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 161 transitions. [2019-11-19 20:00:28,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-19 20:00:28,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 111 states and 148 transitions. [2019-11-19 20:00:28,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-19 20:00:28,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-19 20:00:28,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 148 transitions. [2019-11-19 20:00:28,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:28,534 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 148 transitions. [2019-11-19 20:00:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 148 transitions. [2019-11-19 20:00:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2019-11-19 20:00:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 20:00:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2019-11-19 20:00:28,539 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-11-19 20:00:28,539 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-11-19 20:00:28,539 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 20:00:28,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2019-11-19 20:00:28,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:28,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:28,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:28,541 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:28,541 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 20:00:28,541 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1017#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1018#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 997#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 998#L54 assume !parse_expression_list_#t~switch4; 1020#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1073#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1072#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1066#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1019#L54 assume parse_expression_list_#t~switch4; 1021#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1011#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1071#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 1002#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1003#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1023#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1024#L58-8 [2019-11-19 20:00:28,541 INFO L796 eck$LassoCheckResult]: Loop: 1024#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1036#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1033#L58-2 assume parse_expression_list_#t~short13; 1027#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1028#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1024#L58-8 [2019-11-19 20:00:28,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash -960269922, now seen corresponding path program 1 times [2019-11-19 20:00:28,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059328208] [2019-11-19 20:00:28,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2019-11-19 20:00:28,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072852126] [2019-11-19 20:00:28,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:28,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -554161477, now seen corresponding path program 1 times [2019-11-19 20:00:28,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208340431] [2019-11-19 20:00:28,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:00:28,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208340431] [2019-11-19 20:00:28,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729384675] [2019-11-19 20:00:28,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:00:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:28,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 20:00:28,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:28,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:00:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:00:28,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:00:28,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-19 20:00:28,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252654393] [2019-11-19 20:00:28,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:00:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:00:28,787 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. cyclomatic complexity: 33 Second operand 7 states. [2019-11-19 20:00:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:28,931 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2019-11-19 20:00:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 20:00:28,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 222 transitions. [2019-11-19 20:00:28,934 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:00:28,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 150 states and 200 transitions. [2019-11-19 20:00:28,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-19 20:00:28,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-19 20:00:28,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2019-11-19 20:00:28,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:28,938 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2019-11-19 20:00:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2019-11-19 20:00:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2019-11-19 20:00:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-19 20:00:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2019-11-19 20:00:28,954 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-19 20:00:28,954 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-11-19 20:00:28,954 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 20:00:28,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 156 transitions. [2019-11-19 20:00:28,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-19 20:00:28,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:28,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:28,959 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:28,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 20:00:28,961 INFO L794 eck$LassoCheckResult]: Stem: 1365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1342#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1343#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1321#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1322#L54 assume !parse_expression_list_#t~switch4; 1420#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1419#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1418#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1417#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1416#L54 assume !parse_expression_list_#t~switch4; 1380#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1429#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1384#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1383#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1379#L54 assume parse_expression_list_#t~switch4; 1332#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1333#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1366#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 1325#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1326#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1345#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1346#L58-8 [2019-11-19 20:00:28,961 INFO L796 eck$LassoCheckResult]: Loop: 1346#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1358#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1355#L58-2 assume parse_expression_list_#t~short13; 1349#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1350#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1346#L58-8 [2019-11-19 20:00:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 2 times [2019-11-19 20:00:28,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:28,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515262451] [2019-11-19 20:00:28,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:29,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2019-11-19 20:00:29,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:29,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474438933] [2019-11-19 20:00:29,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:29,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:29,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 2 times [2019-11-19 20:00:29,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:29,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327975100] [2019-11-19 20:00:29,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:29,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:29,617 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 121 [2019-11-19 20:00:29,729 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:00:29,729 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:00:29,729 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:00:29,729 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:00:29,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:00:29,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:29,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:00:29,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:00:29,730 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2019-11-19 20:00:29,730 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:00:29,731 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:00:29,736 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-19 20:00:29,739 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-19 20:00:29,740 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-19 20:00:29,742 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-19 20:00:29,743 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-19 20:00:29,746 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-19 20:00:29,748 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-19 20:00:29,749 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-19 20:00:29,755 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-19 20:00:29,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:00:29,758 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-19 20:00:29,759 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-19 20:00:29,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:00:29,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-19 20:00:29,781 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-19 20:00:29,782 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-19 20:00:29,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-19 20:00:29,787 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-19 20:00:30,043 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-19 20:00:30,087 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-19 20:00:30,090 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-19 20:00:30,092 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-19 20:00:30,093 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-19 20:00:30,095 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-19 20:00:30,097 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-19 20:00:30,099 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-19 20:00:30,101 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-19 20:00:30,506 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-11-19 20:00:30,695 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-19 20:00:30,815 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:00:30,815 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,824 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-19 20:00:30,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,828 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:30,833 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,839 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,844 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-19 20:00:30,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:30,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:30,850 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,855 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-19 20:00:30,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,860 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,865 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-19 20:00:30,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:30,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:00:30,870 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:30,882 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-19 20:00:30,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,886 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,892 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-19 20:00:30,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,895 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,901 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-19 20:00:30,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,905 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:30,910 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,913 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,918 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-19 20:00:30,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,921 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,927 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-19 20:00:30,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,932 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,936 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-19 20:00:30,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,940 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,945 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-19 20:00:30,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,948 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:30,954 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-19 20:00:30,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,962 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,968 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-19 20:00:30,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,971 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:30,977 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:30,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:00:30,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:00:30,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:00:30,987 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:30,993 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-19 20:00:30,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:30,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:30,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:30,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:30,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:30,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,000 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:31,006 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-19 20:00:31,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:31,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:31,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:31,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:31,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:31,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,013 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:31,024 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-19 20:00:31,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:31,025 INFO L203 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-19 20:00:31,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:31,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:31,030 INFO L401 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-19 20:00:31,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,041 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:31,048 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-19 20:00:31,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:31,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:31,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:31,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:31,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:31,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,056 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:31,077 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-19 20:00:31,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:31,078 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 20:00:31,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:31,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:31,081 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 20:00:31,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,088 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:31,094 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-19 20:00:31,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:31,098 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-19 20:00:31,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:31,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:31,106 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-19 20:00:31,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,118 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:00:31,125 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-19 20:00:31,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:00:31,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:00:31,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:00:31,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:00:31,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:00:31,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:00:31,178 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-11-19 20:00:31,178 INFO L444 ModelExtractionUtils]: 11 out of 28 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:00:31,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 20:00:31,185 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:00:31,185 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:00:31,185 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2019-11-19 20:00:31,226 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-19 20:00:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:31,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:00:31,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:31,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 20:00:31,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:31,293 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-19 20:00:31,294 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-19 20:00:31,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49 Second operand 4 states. [2019-11-19 20:00:31,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 271 states and 365 transitions. Complement of second has 11 states. [2019-11-19 20:00:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-19 20:00:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 20:00:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-11-19 20:00:31,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-19 20:00:31,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:31,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2019-11-19 20:00:31,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:31,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-19 20:00:31,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:00:31,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 365 transitions. [2019-11-19 20:00:31,416 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-11-19 20:00:31,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 174 states and 233 transitions. [2019-11-19 20:00:31,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-19 20:00:31,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-19 20:00:31,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 233 transitions. [2019-11-19 20:00:31,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:31,418 INFO L688 BuchiCegarLoop]: Abstraction has 174 states and 233 transitions. [2019-11-19 20:00:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 233 transitions. [2019-11-19 20:00:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2019-11-19 20:00:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-19 20:00:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2019-11-19 20:00:31,425 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-19 20:00:31,425 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-19 20:00:31,426 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 20:00:31,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 163 transitions. [2019-11-19 20:00:31,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-19 20:00:31,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:31,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:31,428 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:31,428 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:31,429 INFO L794 eck$LassoCheckResult]: Stem: 1926#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1902#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1903#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1882#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1883#L54 assume parse_expression_list_#t~switch4; 1984#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1989#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1987#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 1985#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1982#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1980#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1978#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1976#L58-1 assume !parse_expression_list_#t~short14; 1974#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 1971#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1970#L59 assume !parse_expression_list_#t~short17; 1968#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 1966#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 1964#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1961#L3 assume !(0 == __VERIFIER_assert_~cond); 1960#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 1957#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 1953#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1950#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1947#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1946#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1945#L54 assume parse_expression_list_#t~switch4; 1899#L55-5 [2019-11-19 20:00:31,429 INFO L796 eck$LassoCheckResult]: Loop: 1899#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1942#L55-1 assume parse_expression_list_#t~short7; 1898#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1899#L55-5 [2019-11-19 20:00:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1008934689, now seen corresponding path program 1 times [2019-11-19 20:00:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:31,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704328823] [2019-11-19 20:00:31,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:00:31,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704328823] [2019-11-19 20:00:31,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:00:31,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 20:00:31,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913082065] [2019-11-19 20:00:31,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:00:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:31,483 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-11-19 20:00:31,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:31,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927078901] [2019-11-19 20:00:31,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:31,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:31,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:00:31,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:00:31,534 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. cyclomatic complexity: 50 Second operand 7 states. [2019-11-19 20:00:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:31,740 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2019-11-19 20:00:31,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 20:00:31,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 282 transitions. [2019-11-19 20:00:31,743 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2019-11-19 20:00:31,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 175 states and 230 transitions. [2019-11-19 20:00:31,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-19 20:00:31,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-19 20:00:31,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 230 transitions. [2019-11-19 20:00:31,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:31,745 INFO L688 BuchiCegarLoop]: Abstraction has 175 states and 230 transitions. [2019-11-19 20:00:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 230 transitions. [2019-11-19 20:00:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2019-11-19 20:00:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 20:00:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2019-11-19 20:00:31,750 INFO L711 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-11-19 20:00:31,750 INFO L591 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2019-11-19 20:00:31,750 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 20:00:31,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 164 transitions. [2019-11-19 20:00:31,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-19 20:00:31,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:31,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:31,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:31,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:31,753 INFO L794 eck$LassoCheckResult]: Stem: 2282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2254#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2255#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2235#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2236#L54 assume parse_expression_list_#t~switch4; 2317#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2316#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2315#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 2314#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2313#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2312#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2311#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2310#L58-1 assume !parse_expression_list_#t~short14; 2309#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 2308#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2296#L59 assume !parse_expression_list_#t~short17; 2297#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 2307#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2305#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2303#L3 assume !(0 == __VERIFIER_assert_~cond); 2301#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2244#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2245#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2306#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2304#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2302#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2300#L54 assume parse_expression_list_#t~switch4; 2246#L55-5 [2019-11-19 20:00:31,753 INFO L796 eck$LassoCheckResult]: Loop: 2246#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2247#L55-1 assume parse_expression_list_#t~short7; 2252#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2246#L55-5 [2019-11-19 20:00:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2019-11-19 20:00:31,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:31,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466342611] [2019-11-19 20:00:31,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:00:31,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466342611] [2019-11-19 20:00:31,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:00:31,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:00:31,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625114525] [2019-11-19 20:00:31,807 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:00:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:31,808 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-11-19 20:00:31,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:31,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584442209] [2019-11-19 20:00:31,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:31,813 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:31,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 20:00:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:00:31,870 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. cyclomatic complexity: 48 Second operand 6 states. [2019-11-19 20:00:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:31,993 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2019-11-19 20:00:31,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 20:00:31,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 147 transitions. [2019-11-19 20:00:31,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:31,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 98 states and 132 transitions. [2019-11-19 20:00:31,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-19 20:00:31,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-19 20:00:31,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 132 transitions. [2019-11-19 20:00:31,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:31,997 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-19 20:00:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 132 transitions. [2019-11-19 20:00:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-19 20:00:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-19 20:00:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2019-11-19 20:00:32,000 INFO L711 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-19 20:00:32,000 INFO L591 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-19 20:00:32,000 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 20:00:32,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 132 transitions. [2019-11-19 20:00:32,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:32,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:32,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:32,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:32,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:32,002 INFO L794 eck$LassoCheckResult]: Stem: 2528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2504#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2505#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2485#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2486#L54 assume !parse_expression_list_#t~switch4; 2506#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2569#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2567#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2564#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2562#L54 assume parse_expression_list_#t~switch4; 2499#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2500#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2580#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 2581#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2582#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 2509#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2510#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2520#L58-1 assume !parse_expression_list_#t~short14; 2521#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 2534#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2533#L59 assume !parse_expression_list_#t~short17; 2531#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 2529#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2525#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2518#L3 assume !(0 == __VERIFIER_assert_~cond); 2515#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2494#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2495#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2579#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2578#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2576#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2574#L54 assume parse_expression_list_#t~switch4; 2497#L55-5 [2019-11-19 20:00:32,002 INFO L796 eck$LassoCheckResult]: Loop: 2497#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2498#L55-1 assume parse_expression_list_#t~short7; 2502#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2497#L55-5 [2019-11-19 20:00:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1171373033, now seen corresponding path program 1 times [2019-11-19 20:00:32,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:32,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884553081] [2019-11-19 20:00:32,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 20:00:32,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884553081] [2019-11-19 20:00:32,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:00:32,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 20:00:32,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564859497] [2019-11-19 20:00:32,075 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:00:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-11-19 20:00:32,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:32,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724707510] [2019-11-19 20:00:32,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:32,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:32,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 20:00:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:00:32,123 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. cyclomatic complexity: 41 Second operand 8 states. [2019-11-19 20:00:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:32,319 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2019-11-19 20:00:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 20:00:32,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 232 transitions. [2019-11-19 20:00:32,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-19 20:00:32,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 149 states and 201 transitions. [2019-11-19 20:00:32,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-19 20:00:32,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-19 20:00:32,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 201 transitions. [2019-11-19 20:00:32,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 20:00:32,323 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 201 transitions. [2019-11-19 20:00:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 201 transitions. [2019-11-19 20:00:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2019-11-19 20:00:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-19 20:00:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2019-11-19 20:00:32,327 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2019-11-19 20:00:32,327 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2019-11-19 20:00:32,327 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 20:00:32,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 158 transitions. [2019-11-19 20:00:32,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-19 20:00:32,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:00:32,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:00:32,329 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:00:32,329 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 20:00:32,329 INFO L794 eck$LassoCheckResult]: Stem: 2823#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2796#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2797#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2776#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2777#L54 assume !parse_expression_list_#t~switch4; 2798#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2788#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2789#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2778#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2779#L54 assume parse_expression_list_#t~switch4; 2867#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2889#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2887#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; 2885#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2808#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2801#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2802#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2819#L58-1 assume !parse_expression_list_#t~short14; 2838#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; 2836#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2834#L59 assume !parse_expression_list_#t~short17; 2833#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 2826#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2820#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2812#L3 assume !(0 == __VERIFIER_assert_~cond); 2807#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2786#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2787#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2831#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2830#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2829#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2827#L54 assume parse_expression_list_#t~switch4; 2790#L55-5 [2019-11-19 20:00:32,329 INFO L796 eck$LassoCheckResult]: Loop: 2790#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2791#L55-1 assume parse_expression_list_#t~short7; 2794#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2790#L55-5 [2019-11-19 20:00:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2019-11-19 20:00:32,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:32,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523979419] [2019-11-19 20:00:32,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 20:00:32,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523979419] [2019-11-19 20:00:32,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923993764] [2019-11-19 20:00:32,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:00:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:00:32,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 20:00:32,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:00:32,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 20:00:32,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 20:00:32,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 20:00:32,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 20:00:32,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-19 20:00:32,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-19 20:00:32,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 20:00:32,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 20:00:32,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-19 20:00:32,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2019-11-19 20:00:32,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2019-11-19 20:00:32,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 20:00:32,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 20:00:32,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 20:00:32,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2019-11-19 20:00:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 20:00:32,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:00:32,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-11-19 20:00:32,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029541116] [2019-11-19 20:00:32,767 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:00:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:00:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-11-19 20:00:32,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:00:32,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071068514] [2019-11-19 20:00:32,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:00:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:00:32,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:00:32,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:00:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 20:00:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-19 20:00:32,827 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. cyclomatic complexity: 48 Second operand 15 states. [2019-11-19 20:00:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:00:45,372 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-11-19 20:00:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 20:00:45,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 99 transitions. [2019-11-19 20:00:45,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 20:00:45,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2019-11-19 20:00:45,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 20:00:45,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 20:00:45,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 20:00:45,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:00:45,375 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:00:45,375 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:00:45,375 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:00:45,375 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 20:00:45,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:00:45,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 20:00:45,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 20:00:45,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 08:00:45 BoogieIcfgContainer [2019-11-19 20:00:45,382 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 20:00:45,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:00:45,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:00:45,383 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:00:45,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:23" (3/4) ... [2019-11-19 20:00:45,386 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 20:00:45,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:00:45,388 INFO L168 Benchmark]: Toolchain (without parser) took 23013.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 956.3 MB in the beginning and 829.2 MB in the end (delta: 127.1 MB). Peak memory consumption was 423.3 MB. Max. memory is 11.5 GB. [2019-11-19 20:00:45,388 INFO L168 Benchmark]: CDTParser took 0.25 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-19 20:00:45,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-19 20:00:45,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:00:45,389 INFO L168 Benchmark]: Boogie Preprocessor took 34.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:00:45,390 INFO L168 Benchmark]: RCFGBuilder took 377.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:00:45,390 INFO L168 Benchmark]: BuchiAutomizer took 22173.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 829.2 MB in the end (delta: 243.1 MB). Peak memory consumption was 429.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:00:45,391 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.3 GB. Free memory is still 829.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:00:45,393 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.25 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 365.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22173.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 829.2 MB in the end (delta: 243.1 MB). Peak memory consumption was 429.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.3 GB. Free memory is still 829.2 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 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * str + unknown-#length-unknown[str] + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * start + -1 * str and consists of 5 locations. One deterministic module has affine ranking function j and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.1s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 7.7s. Construction of modules took 12.8s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 272 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 124 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 344 SDtfs, 845 SDslu, 819 SDs, 0 SdLazy, 857 SolverSat, 138 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf101 lsp91 ukn74 mio100 lsp41 div100 bol100 ite100 ukn100 eq183 hnf86 smp96 dnf260 smp72 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 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...