./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab 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/cstrcat-alloca-2.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 c15bd857267d499e7ecc6e455c2b5fbe7515d7da .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:52:52,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:52,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:52,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:52,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:52,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:52,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:52,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:52,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:52,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:52,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:53,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:53,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:53,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:53,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:53,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:53,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:53,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:53,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:53,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:53,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:53,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:53,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:53,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:53,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:53,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:53,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:53,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:53,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:53,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:53,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:53,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:53,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:53,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:53,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:53,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:53,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:53,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:53,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:53,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:53,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:53,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:53,078 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:53,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:53,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:53,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:53,082 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:53,082 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:53,082 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:53,083 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:53,083 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:53,083 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:53,083 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:53,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:53,084 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:53,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:53,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:53,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:53,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:53,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:53,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:53,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:53,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:53,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:53,088 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:53,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:53,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:53,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:53,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:53,090 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:53,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:53,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:53,091 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:53,093 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:53,093 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 -> c15bd857267d499e7ecc6e455c2b5fbe7515d7da [2019-11-28 03:52:53,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:53,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:53,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:53,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:53,458 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:53,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-28 03:52:53,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8587fd71f/e3c9b5ed8d694c969b87b19bd0b302f3/FLAGd3efe7f2f [2019-11-28 03:52:54,032 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:54,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-28 03:52:54,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8587fd71f/e3c9b5ed8d694c969b87b19bd0b302f3/FLAGd3efe7f2f [2019-11-28 03:52:54,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8587fd71f/e3c9b5ed8d694c969b87b19bd0b302f3 [2019-11-28 03:52:54,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:54,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:54,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:54,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:54,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:54,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e958aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54, skipping insertion in model container [2019-11-28 03:52:54,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:54,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:54,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:54,810 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:54,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:54,933 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:54,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54 WrapperNode [2019-11-28 03:52:54,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:54,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:54,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:54,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:54,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:54,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:54,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:54,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:54,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:55,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:55,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:55,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:55,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:55,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:55,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:55,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:55,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (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 03:52:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:55,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:55,443 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:55,444 INFO L297 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 03:52:55,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:55 BoogieIcfgContainer [2019-11-28 03:52:55,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:55,447 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:55,447 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:55,450 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:55,452 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:55,452 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:54" (1/3) ... [2019-11-28 03:52:55,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75aec76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:55, skipping insertion in model container [2019-11-28 03:52:55,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:55,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (2/3) ... [2019-11-28 03:52:55,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75aec76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:55, skipping insertion in model container [2019-11-28 03:52:55,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:55,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:55" (3/3) ... [2019-11-28 03:52:55,461 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2019-11-28 03:52:55,504 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:55,505 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:55,505 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:55,505 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:55,505 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:55,505 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:55,506 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:55,506 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:55,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:52:55,539 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:55,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:55,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:55,545 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:52:55,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:55,545 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:55,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:52:55,548 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:55,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:55,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:55,549 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:52:55,549 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:55,556 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 23#L527true assume !(main_~length1~0 < 1); 7#L527-2true assume !(main_~length2~0 < 2); 19#L530-1true assume !(main_~length3~0 < 1); 11#L533-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5#L540-3true [2019-11-28 03:52:55,556 INFO L796 eck$LassoCheckResult]: Loop: 5#L540-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 22#L540-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5#L540-3true [2019-11-28 03:52:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-28 03:52:55,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:55,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112595818] [2019-11-28 03:52:55,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-28 03:52:55,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:55,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279710671] [2019-11-28 03:52:55,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-28 03:52:55,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:55,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944104205] [2019-11-28 03:52:55,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:56,117 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-28 03:52:56,222 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:56,223 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:56,224 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:56,224 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:56,224 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:56,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:56,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:56,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2019-11-28 03:52:56,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:56,226 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:56,265 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 03:52:56,273 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 03:52:56,276 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 03:52:56,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:56,286 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 03:52:56,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:56,294 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 03:52:56,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:56,308 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 03:52:56,313 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 03:52:56,486 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-28 03:52:56,515 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 03:52:56,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:56,521 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 03:52:56,523 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 03:52:56,528 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 03:52:56,530 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 03:52:56,535 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 03:52:56,890 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:56,895 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:56,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:56,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:56,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:56,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,922 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 03:52:56,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:56,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:56,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:56,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:56,947 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 03:52:56,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:56,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:56,952 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 03:52:56,955 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 03:52:56,974 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:56,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:56,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,999 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 03:52:57,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,006 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 03:52:57,020 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 03:52:57,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:57,036 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 03:52:57,052 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 03:52:57,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:57,065 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:57,104 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 03:52:57,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,120 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 03:52:57,129 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 03:52:57,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:57,144 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 03:52:57,158 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,164 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 03:52:57,173 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 03:52:57,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:57,183 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 03:52:57,197 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 03:52:57,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:57,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:57,237 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 03:52:57,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,267 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 03:52:57,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,281 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 03:52:57,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:57,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:57,428 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:52:57,428 INFO L444 ModelExtractionUtils]: 18 out of 31 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 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 03:52:57,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:57,487 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:57,488 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:57,488 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 03:52:57,511 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:52:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:57,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:57,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:57,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:57,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:57,637 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 03:52:57,655 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 03:52:57,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-28 03:52:57,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 52 states and 74 transitions. Complement of second has 7 states. [2019-11-28 03:52:57,715 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 03:52:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2019-11-28 03:52:57,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 03:52:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:57,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 03:52:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:57,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 03:52:57,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:57,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. [2019-11-28 03:52:57,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:57,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 17 states and 24 transitions. [2019-11-28 03:52:57,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:52:57,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:52:57,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-28 03:52:57,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:57,747 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:52:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-28 03:52:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:52:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:52:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-28 03:52:57,783 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:52:57,784 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:52:57,784 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:57,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-28 03:52:57,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:57,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:57,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:57,791 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:57,791 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:57,792 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 159#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 160#L527 assume !(main_~length1~0 < 1); 156#L527-2 assume !(main_~length2~0 < 2); 157#L530-1 assume !(main_~length3~0 < 1); 161#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 151#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 153#L540-4 main_~i~1 := 0; 155#L545-3 [2019-11-28 03:52:57,792 INFO L796 eck$LassoCheckResult]: Loop: 155#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 158#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 155#L545-3 [2019-11-28 03:52:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-28 03:52:57,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:57,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249727109] [2019-11-28 03:52:57,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:57,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-28 03:52:57,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:57,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469435279] [2019-11-28 03:52:57,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,884 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-28 03:52:57,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:57,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121426964] [2019-11-28 03:52:57,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:58,129 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-28 03:52:58,211 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:58,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:58,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:58,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:58,211 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:58,212 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:58,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:58,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2019-11-28 03:52:58,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:58,213 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:58,217 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 03:52:58,220 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 03:52:58,358 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-28 03:52:58,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,382 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 03:52:58,386 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 03:52:58,388 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 03:52:58,390 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 03:52:58,394 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 03:52:58,397 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 03:52:58,403 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 03:52:58,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,408 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 03:52:58,410 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 03:52:58,412 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 03:52:58,415 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 03:52:58,417 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 03:52:58,755 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:58,756 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,768 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 03:52:58,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:58,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:58,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:58,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:58,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:58,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:58,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:58,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:58,794 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 03:52:58,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:58,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:58,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:58,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:58,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:58,800 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 03:52:58,806 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) [2019-11-28 03:52:58,829 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 03:52:58,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:58,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:58,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:58,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:58,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:58,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,857 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:58,899 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:52:58,899 INFO L444 ModelExtractionUtils]: 18 out of 34 variables were initially zero. Simplification set additionally 11 variables to zero. 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) [2019-11-28 03:52:58,913 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,916 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:52:58,917 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:58,917 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~length2~0 >= 0] [2019-11-28 03:52:58,958 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 03:52:58,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:59,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:59,098 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:59,099 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 03:52:59,100 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:59,120 INFO L588 ElimStorePlain]: treesize reduction 10, result has 61.5 percent of original size [2019-11-28 03:52:59,121 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:59,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:7 [2019-11-28 03:52:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:59,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:59,167 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 03:52:59,167 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 03:52:59,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 03:52:59,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 24 states and 36 transitions. Complement of second has 7 states. [2019-11-28 03:52:59,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:52:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-28 03:52:59,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 03:52:59,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:59,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:52:59,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:59,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-28 03:52:59,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:59,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2019-11-28 03:52:59,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:59,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 26 transitions. [2019-11-28 03:52:59,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:52:59,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:52:59,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-28 03:52:59,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:59,315 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 03:52:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-28 03:52:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 03:52:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:52:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 03:52:59,321 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 03:52:59,321 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 03:52:59,321 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:59,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 03:52:59,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:59,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:59,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:59,326 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:59,326 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:59,326 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 290#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 291#L527 assume !(main_~length1~0 < 1); 286#L527-2 assume !(main_~length2~0 < 2); 287#L530-1 assume !(main_~length3~0 < 1); 292#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 281#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 283#L540-4 main_~i~1 := 0; 285#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 293#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 280#L517-3 [2019-11-28 03:52:59,327 INFO L796 eck$LassoCheckResult]: Loop: 280#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 278#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 280#L517-3 [2019-11-28 03:52:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-28 03:52:59,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081087603] [2019-11-28 03:52:59,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,471 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 03:52:59,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081087603] [2019-11-28 03:52:59,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:59,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:52:59,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416302171] [2019-11-28 03:52:59,477 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2019-11-28 03:52:59,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923244436] [2019-11-28 03:52:59,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:59,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:59,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:59,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:59,528 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 03:52:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:59,557 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-28 03:52:59,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:59,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 03:52:59,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:59,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 03:52:59,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:52:59,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:52:59,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-28 03:52:59,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:59,562 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 03:52:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-28 03:52:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 03:52:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:52:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 03:52:59,568 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 03:52:59,568 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 03:52:59,568 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:59,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-28 03:52:59,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:59,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:59,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:59,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:59,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:59,570 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 334#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 335#L527 assume !(main_~length1~0 < 1); 330#L527-2 assume !(main_~length2~0 < 2); 331#L530-1 assume !(main_~length3~0 < 1); 336#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 325#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 327#L540-4 main_~i~1 := 0; 329#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 332#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 333#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 337#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 324#L517-3 [2019-11-28 03:52:59,570 INFO L796 eck$LassoCheckResult]: Loop: 324#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 322#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 324#L517-3 [2019-11-28 03:52:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-11-28 03:52:59,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134326734] [2019-11-28 03:52:59,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2019-11-28 03:52:59,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354892013] [2019-11-28 03:52:59,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,662 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2019-11-28 03:52:59,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503408753] [2019-11-28 03:52:59,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,918 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 03:52:59,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503408753] [2019-11-28 03:52:59,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146932342] [2019-11-28 03:52:59,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 03:52:59,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:00,133 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-28 03:53:00,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-28 03:53:00,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:00,153 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:00,154 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-28 03:53:00,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2019-11-28 03:53:00,206 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:53:00,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:53:00,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2019-11-28 03:53:00,227 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:53:00,257 INFO L588 ElimStorePlain]: treesize reduction 33, result has 42.1 percent of original size [2019-11-28 03:53:00,260 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:53:00,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:48, output treesize:3 [2019-11-28 03:53:00,262 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 03:53:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:53:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-28 03:53:00,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552980975] [2019-11-28 03:53:00,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 03:53:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-28 03:53:00,292 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-11-28 03:53:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:01,805 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-11-28 03:53:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:53:01,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-11-28 03:53:01,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:53:01,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2019-11-28 03:53:01,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:53:01,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:53:01,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-28 03:53:01,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:01,809 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-28 03:53:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-28 03:53:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-28 03:53:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:53:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 03:53:01,813 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 03:53:01,813 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 03:53:01,813 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:53:01,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-28 03:53:01,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:53:01,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:01,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:01,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:01,814 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:01,815 INFO L794 eck$LassoCheckResult]: Stem: 456#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 451#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 452#L527 assume !(main_~length1~0 < 1); 445#L527-2 assume !(main_~length2~0 < 2); 446#L530-1 assume !(main_~length3~0 < 1); 453#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 440#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 442#L540-4 main_~i~1 := 0; 444#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 449#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 450#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 454#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 459#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 438#L517-1 assume !(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2; 439#L519-2 [2019-11-28 03:53:01,815 INFO L796 eck$LassoCheckResult]: Loop: 439#L519-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 458#L519 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~mem6;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset; 439#L519-2 [2019-11-28 03:53:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017532, now seen corresponding path program 1 times [2019-11-28 03:53:01,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:01,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285758956] [2019-11-28 03:53:01,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:01,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:01,852 INFO L82 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2019-11-28 03:53:01,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:01,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942766135] [2019-11-28 03:53:01,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:01,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 405254793, now seen corresponding path program 1 times [2019-11-28 03:53:01,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:01,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088685053] [2019-11-28 03:53:01,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:53:02,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088685053] [2019-11-28 03:53:02,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:53:02,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:53:02,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868326360] [2019-11-28 03:53:02,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:53:02,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:53:02,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:53:02,101 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 03:53:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:02,193 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-11-28 03:53:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:53:02,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-11-28 03:53:02,195 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:53:02,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2019-11-28 03:53:02,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:53:02,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:53:02,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-11-28 03:53:02,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:02,196 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 03:53:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-11-28 03:53:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-28 03:53:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 03:53:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-28 03:53:02,199 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-28 03:53:02,199 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-28 03:53:02,200 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:53:02,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-28 03:53:02,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:53:02,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:02,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:02,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:02,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:02,201 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 529#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 530#L527 assume !(main_~length1~0 < 1); 523#L527-2 assume !(main_~length2~0 < 2); 524#L530-1 assume !(main_~length3~0 < 1); 531#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 517#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 519#L540-4 main_~i~1 := 0; 522#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 543#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 542#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 541#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 540#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 539#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 516#L517-3 [2019-11-28 03:53:02,202 INFO L796 eck$LassoCheckResult]: Loop: 516#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 515#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 516#L517-3 [2019-11-28 03:53:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2019-11-28 03:53:02,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:02,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934672220] [2019-11-28 03:53:02,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:02,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2019-11-28 03:53:02,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:02,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203965885] [2019-11-28 03:53:02,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:02,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2019-11-28 03:53:02,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:02,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103974455] [2019-11-28 03:53:02,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:02,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:02,884 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2019-11-28 03:53:03,079 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 03:53:03,081 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:03,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:03,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:03,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:03,082 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:03,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:03,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:03,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:03,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2019-11-28 03:53:03,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:03,083 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:03,086 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 03:53:03,088 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 03:53:03,466 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-28 03:53:03,537 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 03:53:03,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,548 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 03:53:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,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 03:53:03,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 03:53:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,564 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 03:53:03,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,569 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 03:53:03,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,574 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 03:53:03,576 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 03:53:03,578 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 03:53:03,580 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 03:53:03,589 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 03:53:03,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,597 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 03:53:03,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:03,600 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 03:53:03,601 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 03:53:03,836 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-28 03:53:04,245 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:04,245 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:04,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:04,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:04,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:04,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:04,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:04,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:04,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:04,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:04,259 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 03:53:04,266 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 03:53:04,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:04,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:04,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:04,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:04,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:04,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:04,273 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) [2019-11-28 03:53:04,285 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 03:53:04,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:04,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:04,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:04,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:04,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:04,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:04,298 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) [2019-11-28 03:53:04,306 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 03:53:04,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:04,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:04,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:04,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:04,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:04,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:04,344 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:04,439 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 03:53:04,440 INFO L444 ModelExtractionUtils]: 37 out of 55 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:53:04,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:04,455 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:53:04,455 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:04,455 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2019-11-28 03:53:04,498 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 03:53:04,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:53:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:04,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:53:04,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:04,585 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:53:04,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:04,607 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 03:53:04,607 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 03:53:04,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 03:53:04,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 40 states and 52 transitions. Complement of second has 7 states. [2019-11-28 03:53:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:53:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-28 03:53:04,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 03:53:04,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:04,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-28 03:53:04,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:04,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 03:53:04,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:04,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-11-28 03:53:04,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:53:04,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-28 03:53:04,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:53:04,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:53:04,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:53:04,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:04,668 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:04,668 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:04,668 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:04,668 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:53:04,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:53:04,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:53:04,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:53:04,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:53:04 BoogieIcfgContainer [2019-11-28 03:53:04,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:53:04,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:53:04,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:53:04,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:53:04,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:55" (3/4) ... [2019-11-28 03:53:04,693 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:53:04,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:53:04,695 INFO L168 Benchmark]: Toolchain (without parser) took 10366.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 961.7 MB in the beginning and 883.5 MB in the end (delta: 78.2 MB). Peak memory consumption was 379.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:04,695 INFO L168 Benchmark]: CDTParser took 0.24 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 03:53:04,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:04,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:04,698 INFO L168 Benchmark]: Boogie Preprocessor took 30.37 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 03:53:04,698 INFO L168 Benchmark]: RCFGBuilder took 432.25 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:04,699 INFO L168 Benchmark]: BuchiAutomizer took 9238.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 209.8 MB). Peak memory consumption was 368.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:04,700 INFO L168 Benchmark]: Witness Printer took 5.34 ms. Allocated memory is still 1.3 GB. Free memory is still 883.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:04,703 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.24 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 603.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.37 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 432.25 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9238.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 209.8 MB). Peak memory consumption was 368.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.34 ms. Allocated memory is still 1.3 GB. Free memory is still 883.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString2] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 1.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 173 SDslu, 187 SDs, 0 SdLazy, 202 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax111 hnf98 lsp83 ukn74 mio100 lsp60 div100 bol100 ite100 ukn100 eq165 hnf91 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...