./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.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 97f817c294f65682bc18734ad52a0295ea6b342c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:25:41,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:25:41,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:25:41,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:25:41,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:25:41,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:25:41,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:25:41,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:25:41,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:25:41,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:25:41,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:25:41,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:25:41,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:25:41,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:25:41,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:25:41,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:25:41,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:25:41,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:25:41,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:25:41,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:25:41,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:25:41,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:25:41,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:25:41,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:25:42,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:25:42,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:25:42,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:25:42,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:25:42,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:25:42,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:25:42,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:25:42,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:25:42,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:25:42,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:25:42,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:25:42,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:25:42,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:25:42,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:25:42,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:25:42,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:25:42,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:25:42,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:25:42,052 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:25:42,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:25:42,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:25:42,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:25:42,058 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:25:42,058 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:25:42,059 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:25:42,059 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:25:42,059 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:25:42,059 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:25:42,060 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:25:42,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:25:42,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:25:42,061 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:25:42,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:25:42,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:25:42,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:25:42,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:25:42,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:25:42,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:25:42,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:25:42,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:25:42,064 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:25:42,065 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:25:42,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:25:42,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:25:42,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:25:42,066 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:25:42,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:25:42,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:25:42,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:25:42,068 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:25:42,069 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:25:42,070 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 -> 97f817c294f65682bc18734ad52a0295ea6b342c [2019-11-28 21:25:42,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:25:42,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:25:42,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:25:42,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:25:42,383 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:25:42,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2019-11-28 21:25:42,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a03c7943/6353a370236644b99fbc3be1511c71d1/FLAGba963d0c5 [2019-11-28 21:25:42,938 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:25:42,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2019-11-28 21:25:42,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a03c7943/6353a370236644b99fbc3be1511c71d1/FLAGba963d0c5 [2019-11-28 21:25:43,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a03c7943/6353a370236644b99fbc3be1511c71d1 [2019-11-28 21:25:43,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:25:43,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:25:43,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:43,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:25:43,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:25:43,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4809889e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43, skipping insertion in model container [2019-11-28 21:25:43,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:25:43,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:25:43,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:43,713 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:25:43,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:43,816 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:25:43,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43 WrapperNode [2019-11-28 21:25:43,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:43,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:43,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:25:43,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:25:43,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:43,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:25:43,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:25:43,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:25:43,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... [2019-11-28 21:25:43,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:25:43,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:25:43,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:25:43,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:25:43,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:25:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:25:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:25:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:25:43,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:25:43,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:25:44,279 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:25:44,280 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 21:25:44,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:44 BoogieIcfgContainer [2019-11-28 21:25:44,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:25:44,282 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:25:44,282 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:25:44,285 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:25:44,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:44,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:25:43" (1/3) ... [2019-11-28 21:25:44,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58b0ad83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:44, skipping insertion in model container [2019-11-28 21:25:44,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:44,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:43" (2/3) ... [2019-11-28 21:25:44,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58b0ad83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:44, skipping insertion in model container [2019-11-28 21:25:44,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:44,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:44" (3/3) ... [2019-11-28 21:25:44,290 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-1.i [2019-11-28 21:25:44,327 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:25:44,327 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:25:44,327 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:25:44,327 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:25:44,327 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:25:44,327 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:25:44,327 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:25:44,328 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:25:44,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 21:25:44,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 21:25:44,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:44,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:44,365 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:44,365 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:44,365 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:25:44,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-28 21:25:44,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 21:25:44,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:44,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:44,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:25:44,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:44,374 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 10#L521true assume !(main_~length1~0 < 1); 13#L521-2true assume !(main_~length2~0 < 1); 6#L524-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 16#L531-3true [2019-11-28 21:25:44,374 INFO L796 eck$LassoCheckResult]: Loop: 16#L531-3true assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 15#L531-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 16#L531-3true [2019-11-28 21:25:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-11-28 21:25:44,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:44,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587923254] [2019-11-28 21:25:44,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:44,515 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:44,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:44,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-11-28 21:25:44,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230009777] [2019-11-28 21:25:44,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:44,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2019-11-28 21:25:44,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:44,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011166242] [2019-11-28 21:25:44,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:44,582 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:44,836 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-28 21:25:44,931 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:44,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:44,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:44,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:44,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:44,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:44,934 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:44,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:44,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration1_Lasso [2019-11-28 21:25:44,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:44,935 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:44,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:44,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:45,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:45,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:45,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:45,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:45,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:45,533 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:45,538 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,567 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) [2019-11-28 21:25:45,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,593 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-28 21:25:45,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,640 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-28 21:25:45,642 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) [2019-11-28 21:25:45,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,677 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-28 21:25:45,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,726 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-28 21:25:45,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,757 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-28 21:25:45,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:45,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:45,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:45,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:45,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:45,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,856 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:45,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-28 21:25:45,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:45,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:45,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:45,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:45,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:45,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:45,902 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:46,036 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 21:25:46,036 INFO L444 ModelExtractionUtils]: 12 out of 28 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:46,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:46,076 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:46,076 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:46,077 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-28 21:25:46,102 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:25:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:46,211 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:25:46,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-28 21:25:46,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-11-28 21:25:46,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-11-28 21:25:46,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 21:25:46,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:46,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 21:25:46,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:46,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 21:25:46,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:46,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-28 21:25:46,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:46,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 12 states and 16 transitions. [2019-11-28 21:25:46,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 21:25:46,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 21:25:46,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-28 21:25:46,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:46,294 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 21:25:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-28 21:25:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 21:25:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 21:25:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 21:25:46,323 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 21:25:46,324 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 21:25:46,324 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:25:46,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 21:25:46,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:46,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:46,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:46,325 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:46,326 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:46,326 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 127#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 128#L521 assume !(main_~length1~0 < 1); 129#L521-2 assume !(main_~length2~0 < 1); 133#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 136#L531-3 assume !(main_~i~0 < main_~length2~0); 138#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 137#L515-4 [2019-11-28 21:25:46,326 INFO L796 eck$LassoCheckResult]: Loop: 137#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 131#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 132#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 137#L515-4 [2019-11-28 21:25:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2019-11-28 21:25:46,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676287221] [2019-11-28 21:25:46,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:46,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676287221] [2019-11-28 21:25:46,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:46,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:46,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617143239] [2019-11-28 21:25:46,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 1 times [2019-11-28 21:25:46,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119094530] [2019-11-28 21:25:46,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:46,504 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 21:25:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:46,533 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-28 21:25:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:46,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-28 21:25:46,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:46,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2019-11-28 21:25:46,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 21:25:46,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 21:25:46,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-28 21:25:46,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:46,536 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 21:25:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-28 21:25:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-28 21:25:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 21:25:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-28 21:25:46,539 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-28 21:25:46,539 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-28 21:25:46,539 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:25:46,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-28 21:25:46,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:46,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:46,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:46,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:46,541 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:46,541 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 159#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 160#L521 assume !(main_~length1~0 < 1); 161#L521-2 assume !(main_~length2~0 < 1); 165#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 168#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 166#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 167#L531-3 assume !(main_~i~0 < main_~length2~0); 169#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 170#L515-4 [2019-11-28 21:25:46,541 INFO L796 eck$LassoCheckResult]: Loop: 170#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 163#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 164#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 170#L515-4 [2019-11-28 21:25:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2019-11-28 21:25:46,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144996559] [2019-11-28 21:25:46,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 2 times [2019-11-28 21:25:46,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164465876] [2019-11-28 21:25:46,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:46,620 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:46,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:46,621 INFO L82 PathProgramCache]: Analyzing trace with hash -894230189, now seen corresponding path program 1 times [2019-11-28 21:25:46,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:46,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883322854] [2019-11-28 21:25:46,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:46,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883322854] [2019-11-28 21:25:46,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065210355] [2019-11-28 21:25:46,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:25:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:46,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 21:25:46,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:47,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-28 21:25:47,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:47,041 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:47,042 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 21:25:47,043 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2019-11-28 21:25:47,079 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 21:25:47,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:47,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2019-11-28 21:25:47,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:47,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:47,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:47,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:3 [2019-11-28 21:25:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:47,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:47,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 21:25:47,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533731846] [2019-11-28 21:25:47,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 21:25:47,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 21:25:47,160 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 12 states. [2019-11-28 21:25:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:47,380 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-28 21:25:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 21:25:47,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-28 21:25:47,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:47,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 18 transitions. [2019-11-28 21:25:47,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 21:25:47,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 21:25:47,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-11-28 21:25:47,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:47,384 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 21:25:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-11-28 21:25:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-28 21:25:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 21:25:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-28 21:25:47,386 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 21:25:47,386 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 21:25:47,386 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:25:47,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-28 21:25:47,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:47,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:47,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:47,388 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:47,388 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:47,389 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 247#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 248#L521 assume !(main_~length1~0 < 1); 249#L521-2 assume !(main_~length2~0 < 1); 253#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 256#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 254#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 255#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 257#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 260#L531-3 assume !(main_~i~0 < main_~length2~0); 259#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 258#L515-4 [2019-11-28 21:25:47,389 INFO L796 eck$LassoCheckResult]: Loop: 258#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 251#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 252#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 258#L515-4 [2019-11-28 21:25:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1633777206, now seen corresponding path program 2 times [2019-11-28 21:25:47,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:47,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470635294] [2019-11-28 21:25:47,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:47,417 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 3 times [2019-11-28 21:25:47,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:47,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459605976] [2019-11-28 21:25:47,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1287382577, now seen corresponding path program 2 times [2019-11-28 21:25:47,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:47,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393164025] [2019-11-28 21:25:47,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:47,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:47,923 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2019-11-28 21:25:48,037 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 21:25:48,041 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:48,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:48,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:48,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:48,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:48,042 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:48,042 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:48,042 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:48,042 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration4_Lasso [2019-11-28 21:25:48,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:48,042 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:48,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,301 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-28 21:25:48,415 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-28 21:25:48,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:48,985 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:48,985 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:48,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-28 21:25:48,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:48,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:48,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:48,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:48,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:48,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:48,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:48,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:49,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:49,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:49,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:49,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:49,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:49,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:49,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:49,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:49,035 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:49,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:49,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:49,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:49,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:49,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:49,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:49,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:49,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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:49,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:49,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:49,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:49,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:49,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:49,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:49,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:49,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:49,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:49,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:49,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:49,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:49,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:49,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:49,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:49,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:49,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:49,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:49,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:49,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:49,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:49,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:49,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:49,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:49,298 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-28 21:25:49,299 INFO L444 ModelExtractionUtils]: 10 out of 43 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:49,304 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:49,307 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:25:49,308 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:49,308 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpcpy_~to.offset) = -2*ULTIMATE.start_cstpcpy_~to.offset + 3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_cstpcpy_~from.base)_1 + 2 >= 0] [2019-11-28 21:25:49,355 INFO L297 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2019-11-28 21:25:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:49,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 21:25:49,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:49,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:49,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 21:25:49,464 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:49,493 INFO L614 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2019-11-28 21:25:49,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:49,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2019-11-28 21:25:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:49,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 21:25:49,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:49,586 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-28 21:25:49,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-28 21:25:49,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 26 states and 31 transitions. Complement of second has 10 states. [2019-11-28 21:25:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 21:25:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 21:25:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-11-28 21:25:49,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-28 21:25:49,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:49,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 21:25:49,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:49,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 21:25:49,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:49,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2019-11-28 21:25:49,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:49,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 22 transitions. [2019-11-28 21:25:49,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 21:25:49,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:25:49,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-11-28 21:25:49,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:49,718 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 21:25:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-11-28 21:25:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-11-28 21:25:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 21:25:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 21:25:49,720 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 21:25:49,721 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 21:25:49,721 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:25:49,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-28 21:25:49,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 21:25:49,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:49,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:49,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:49,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 21:25:49,722 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 421#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 422#L521 assume !(main_~length1~0 < 1); 423#L521-2 assume !(main_~length2~0 < 1); 427#L524-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 430#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 432#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 433#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 428#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 429#L531-3 assume !!(main_~i~0 < main_~length2~0);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 436#L531-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 435#L531-3 assume !(main_~i~0 < main_~length2~0); 434#L531-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 431#L515-4 [2019-11-28 21:25:49,723 INFO L796 eck$LassoCheckResult]: Loop: 431#L515-4 call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 425#L515-1 assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 426#L515-3 cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 431#L515-4 [2019-11-28 21:25:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1898078824, now seen corresponding path program 3 times [2019-11-28 21:25:49,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:49,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192316146] [2019-11-28 21:25:49,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:49,761 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 4 times [2019-11-28 21:25:49,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:49,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894751315] [2019-11-28 21:25:49,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:49,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1873210255, now seen corresponding path program 3 times [2019-11-28 21:25:49,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:49,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095027023] [2019-11-28 21:25:49,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:49,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:50,393 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 111 [2019-11-28 21:25:50,518 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 21:25:50,521 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:50,521 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:50,521 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:50,521 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:50,522 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:50,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:50,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:50,522 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:50,522 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration5_Lasso [2019-11-28 21:25:50,522 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:50,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:50,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,830 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-28 21:25:50,977 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-28 21:25:50,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:50,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:51,239 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-11-28 21:25:51,575 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:51,575 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 21:25:51,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:51,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:51,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:51,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:51,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:51,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:51,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:51,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:51,608 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-28 21:25:51,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:51,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:51,625 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:51,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:51,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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:51,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:51,673 INFO L402 nArgumentSynthesizer]: A total of 2 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-28 21:25:51,686 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-28 21:25:51,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:51,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,694 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:25:51,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,695 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:25:51,695 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-28 21:25:51,697 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) [2019-11-28 21:25:51,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:51,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:51,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,718 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) [2019-11-28 21:25:51,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:51,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:51,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:51,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:51,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:51,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:51,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,770 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:51,791 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 21:25:51,791 INFO L444 ModelExtractionUtils]: 36 out of 49 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:51,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:25:51,797 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:51,797 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:51,798 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_3, ULTIMATE.start_cstpcpy_~to.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_3 - 1*ULTIMATE.start_cstpcpy_~to.offset Supporting invariants [] [2019-11-28 21:25:51,850 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-11-28 21:25:51,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:51,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 21:25:51,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:51,928 WARN L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 21:25:51,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:51,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:25:51,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 21:25:51,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 19 states and 23 transitions. Complement of second has 5 states. [2019-11-28 21:25:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:25:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 21:25:51,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-28 21:25:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:51,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 16 letters. Loop has 3 letters. [2019-11-28 21:25:51,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:51,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 21:25:51,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:51,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-28 21:25:51,991 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:51,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-28 21:25:51,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:25:51,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:25:51,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:25:51,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:51,992 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:51,992 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:51,992 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:51,992 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:25:51,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:25:51,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:51,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:25:51,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:25:51 BoogieIcfgContainer [2019-11-28 21:25:51,999 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:25:51,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:25:51,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:25:51,999 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:25:52,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:44" (3/4) ... [2019-11-28 21:25:52,003 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:25:52,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:25:52,005 INFO L168 Benchmark]: Toolchain (without parser) took 8753.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 961.7 MB in the beginning and 881.9 MB in the end (delta: 79.8 MB). Peak memory consumption was 404.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:52,005 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-28 21:25:52,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:52,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:52,007 INFO L168 Benchmark]: Boogie Preprocessor took 26.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:52,007 INFO L168 Benchmark]: RCFGBuilder took 384.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:52,008 INFO L168 Benchmark]: BuchiAutomizer took 7716.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 881.9 MB in the end (delta: 204.7 MB). Peak memory consumption was 398.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:52,009 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.4 GB. Free memory is still 881.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:52,012 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 564.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7716.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 881.9 MB in the end (delta: 204.7 MB). Peak memory consumption was 398.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.4 GB. Free memory is still 881.9 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length2 and consists of 5 locations. One deterministic module has affine ranking function -2 * to + 3 and consists of 8 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * to and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 6.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 81 SDslu, 75 SDs, 0 SdLazy, 113 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax110 hnf98 lsp85 ukn80 mio100 lsp53 div100 bol100 ite100 ukn100 eq185 hnf89 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...