./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/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.25-f470102 [2019-11-28 21:25:18,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:25:18,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:25:18,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:25:18,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:25:18,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:25:18,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:25:18,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:25:18,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:25:18,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:25:18,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:25:18,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:25:18,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:25:18,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:25:18,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:25:18,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:25:18,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:25:18,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:25:18,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:25:18,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:25:18,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:25:18,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:25:18,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:25:18,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:25:18,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:25:18,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:25:18,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:25:18,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:25:18,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:25:18,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:25:18,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:25:18,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:25:18,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:25:18,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:25:18,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:25:18,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:25:18,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:25:18,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:25:18,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:25:18,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:25:18,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:25:18,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:25:18,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:25:18,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:25:18,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:25:19,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:25:19,002 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:25:19,003 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:25:19,003 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:25:19,003 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:25:19,004 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:25:19,004 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:25:19,005 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:25:19,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:25:19,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:25:19,006 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:25:19,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:25:19,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:25:19,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:25:19,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:25:19,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:25:19,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:25:19,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:25:19,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:25:19,011 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:25:19,012 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:25:19,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:25:19,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:25:19,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:25:19,015 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:25:19,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:25:19,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:25:19,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:25:19,017 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:25:19,018 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:25:19,019 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 21:25:19,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:25:19,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:25:19,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:25:19,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:25:19,360 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:25:19,361 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 21:25:19,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849bc5e17/77b2aba13fa9498a822623bb9d87a7d9/FLAG36d7539d9 [2019-11-28 21:25:19,930 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:25:19,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-28 21:25:19,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849bc5e17/77b2aba13fa9498a822623bb9d87a7d9/FLAG36d7539d9 [2019-11-28 21:25:20,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849bc5e17/77b2aba13fa9498a822623bb9d87a7d9 [2019-11-28 21:25:20,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:25:20,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:25:20,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:20,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:25:20,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:25:20,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:20" (1/1) ... [2019-11-28 21:25:20,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4696e6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:20, skipping insertion in model container [2019-11-28 21:25:20,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:25:20" (1/1) ... [2019-11-28 21:25:20,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:25:20,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:25:20,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:20,879 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:25:20,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:25:21,021 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:25:21,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21 WrapperNode [2019-11-28 21:25:21,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:25:21,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:21,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:25:21,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:25:21,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:25:21,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:25:21,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:25:21,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:25:21,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... [2019-11-28 21:25:21,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:25:21,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:25:21,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:25:21,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:25:21,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 21:25:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 21:25:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:25:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:25:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:25:21,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:25:21,587 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:25:21,587 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-28 21:25:21,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:21 BoogieIcfgContainer [2019-11-28 21:25:21,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:25:21,589 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:25:21,589 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:25:21,595 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:25:21,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:21,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:25:20" (1/3) ... [2019-11-28 21:25:21,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c00c2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:21, skipping insertion in model container [2019-11-28 21:25:21,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:21,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:25:21" (2/3) ... [2019-11-28 21:25:21,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c00c2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:25:21, skipping insertion in model container [2019-11-28 21:25:21,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:25:21,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:21" (3/3) ... [2019-11-28 21:25:21,600 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2019-11-28 21:25:21,642 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:25:21,642 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:25:21,642 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:25:21,642 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:25:21,643 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:25:21,643 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:25:21,643 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:25:21,643 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:25:21,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 21:25:21,681 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 21:25:21,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:21,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:21,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:25:21,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:21,688 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:25:21,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 21:25:21,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 21:25:21,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:21,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:21,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:25:21,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:21,700 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 21:25:21,701 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 21:25:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-28 21:25:21,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:21,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764256650] [2019-11-28 21:25:21,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:21,860 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:21,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-28 21:25:21,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:21,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760610236] [2019-11-28 21:25:21,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:21,896 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-28 21:25:21,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:21,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481792821] [2019-11-28 21:25:21,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:21,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:22,279 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-28 21:25:22,382 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:22,384 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:22,384 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:22,384 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:22,384 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:22,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:22,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:22,385 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:22,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2019-11-28 21:25:22,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:22,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:22,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:23,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:23,018 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,038 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:23,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,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 [2019-11-28 21:25:23,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:23,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:23,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,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 21:25:23,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:23,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:23,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:23,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:23,352 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 21:25:23,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,373 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 21:25:23,377 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 21:25:23,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:23,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:23,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:23,397 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 21:25:23,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:23,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:23,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:23,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:23,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:23,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:23,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:23,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:23,478 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 21:25:23,478 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) [2019-11-28 21:25:23,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:23,562 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:23,563 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:23,563 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 21:25:23,593 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:25:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:23,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:25:23,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:23,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:25:23,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:23,735 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:25:23,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-28 21:25:23,845 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 21:25:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:25:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:25:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2019-11-28 21:25:23,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 21:25:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 21:25:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 21:25:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:23,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. [2019-11-28 21:25:23,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:23,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 17 states and 24 transitions. [2019-11-28 21:25:23,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:25:23,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:25:23,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-28 21:25:23,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:23,870 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:25:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-28 21:25:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 21:25:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:25:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-28 21:25:23,898 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:25:23,898 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 21:25:23,898 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:25:23,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-28 21:25:23,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:23,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:23,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:23,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:23,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:23,900 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 21:25:23,901 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 21:25:23,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:23,901 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-28 21:25:23,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:23,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692664526] [2019-11-28 21:25:23,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:23,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-28 21:25:23,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:23,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568304055] [2019-11-28 21:25:23,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:23,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-28 21:25:23,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:23,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321087291] [2019-11-28 21:25:23,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:23,996 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:24,220 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-28 21:25:24,309 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:24,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:24,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:24,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:24,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:24,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:24,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:24,309 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:24,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2019-11-28 21:25:24,310 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:24,310 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:24,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,469 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-28 21:25:24,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,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 21:25:24,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,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 21:25:24,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 21:25:24,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:24,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:24,895 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) [2019-11-28 21:25:24,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:24,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:24,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:24,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:24,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:24,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:24,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:24,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:24,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:24,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:24,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:24,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:24,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:24,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:24,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:24,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:24,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:24,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:24,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:24,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:24,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:24,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:24,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:24,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:25,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:25,042 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 21:25:25,042 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 21:25:25,056 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 21:25:25,059 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:25:25,060 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:25,060 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~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 21:25:25,087 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 21:25:25,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:25,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:25:25,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:25,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:25,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-28 21:25:25,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:25,234 INFO L614 ElimStorePlain]: treesize reduction 10, result has 61.5 percent of original size [2019-11-28 21:25:25,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:25,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:7 [2019-11-28 21:25:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:25,262 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:25:25,263 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:25,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:25:25,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 21:25:25,352 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 21:25:25,352 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 21:25:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:25:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-28 21:25:25,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 21:25:25,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:25,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 21:25:25,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:25,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-28 21:25:25,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:25,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2019-11-28 21:25:25,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:25,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 26 transitions. [2019-11-28 21:25:25,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:25:25,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:25,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-28 21:25:25,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:25,359 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:25:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-28 21:25:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 21:25:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:25:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 21:25:25,361 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:25:25,361 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 21:25:25,361 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:25:25,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 21:25:25,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:25,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:25,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:25,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:25,363 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:25,364 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 21:25:25,364 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 21:25:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-28 21:25:25,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:25,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842007515] [2019-11-28 21:25:25,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:25,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842007515] [2019-11-28 21:25:25,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:25,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:25:25,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063627273] [2019-11-28 21:25:25,460 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:25:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2019-11-28 21:25:25,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:25,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472877955] [2019-11-28 21:25:25,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:25,477 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:25,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:25:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:25:25,511 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 21:25:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:25,542 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-28 21:25:25,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:25:25,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 21:25:25,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:25,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-28 21:25:25,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 21:25:25,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 21:25:25,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-28 21:25:25,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:25,546 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-28 21:25:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-28 21:25:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 21:25:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 21:25:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-28 21:25:25,551 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 21:25:25,551 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-28 21:25:25,552 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:25:25,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-28 21:25:25,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:25,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:25,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:25,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:25,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:25,556 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 21:25:25,556 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 21:25:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-11-28 21:25:25,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:25,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366391154] [2019-11-28 21:25:25,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:25,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2019-11-28 21:25:25,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:25,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111343552] [2019-11-28 21:25:25,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:25,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2019-11-28 21:25:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:25,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896043787] [2019-11-28 21:25:25,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:25,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896043787] [2019-11-28 21:25:25,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997931526] [2019-11-28 21:25:25,942 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 21:25:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:26,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 21:25:26,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:26,123 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-28 21:25:26,123 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 21:25:26,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:26,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:26,142 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-28 21:25:26,142 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2019-11-28 21:25:26,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 21:25:26,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 21:25:26,207 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 21:25:26,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 21:25:26,238 INFO L614 ElimStorePlain]: treesize reduction 33, result has 42.1 percent of original size [2019-11-28 21:25:26,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 21:25:26,240 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:48, output treesize:3 [2019-11-28 21:25:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:26,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:25:26,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-28 21:25:26,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944149804] [2019-11-28 21:25:26,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 21:25:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-28 21:25:26,267 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-11-28 21:25:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:26,708 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-11-28 21:25:26,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 21:25:26,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-11-28 21:25:26,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:26,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2019-11-28 21:25:26,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 21:25:26,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 21:25:26,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-28 21:25:26,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:26,713 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-28 21:25:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-28 21:25:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-28 21:25:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 21:25:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-28 21:25:26,715 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 21:25:26,716 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-28 21:25:26,716 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:25:26,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-28 21:25:26,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:25:26,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:26,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:26,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:26,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:26,718 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 21:25:26,718 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 21:25:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017532, now seen corresponding path program 1 times [2019-11-28 21:25:26,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:26,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764215580] [2019-11-28 21:25:26,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:26,749 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2019-11-28 21:25:26,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:26,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211721135] [2019-11-28 21:25:26,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:26,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:26,761 INFO L82 PathProgramCache]: Analyzing trace with hash 405254793, now seen corresponding path program 1 times [2019-11-28 21:25:26,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:26,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477390815] [2019-11-28 21:25:26,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:26,897 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 21:25:26,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477390815] [2019-11-28 21:25:26,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:25:26,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 21:25:26,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353169147] [2019-11-28 21:25:26,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:25:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 21:25:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 21:25:26,970 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 21:25:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:25:27,069 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-11-28 21:25:27,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 21:25:27,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-11-28 21:25:27,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:27,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2019-11-28 21:25:27,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 21:25:27,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 21:25:27,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-11-28 21:25:27,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:27,072 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 21:25:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-11-28 21:25:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-28 21:25:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 21:25:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-28 21:25:27,075 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-28 21:25:27,075 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-28 21:25:27,075 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:25:27,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-28 21:25:27,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:25:27,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:25:27,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:25:27,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:25:27,077 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:25:27,077 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 21:25:27,078 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 21:25:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2019-11-28 21:25:27,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:27,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271165545] [2019-11-28 21:25:27,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:27,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2019-11-28 21:25:27,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:27,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899468761] [2019-11-28 21:25:27,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:27,131 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2019-11-28 21:25:27,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:25:27,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182417252] [2019-11-28 21:25:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:25:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:25:27,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:25:27,801 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2019-11-28 21:25:27,980 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 21:25:27,997 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:25:27,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:25:27,997 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:25:27,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:25:27,998 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:25:27,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:27,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:25:27,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:25:27,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2019-11-28 21:25:27,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:25:27,999 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:25:28,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,341 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-28 21:25:28,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 21:25:28,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:25:28,698 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-28 21:25:29,122 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:25:29,122 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 21:25:29,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:29,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:29,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:25:29,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:29,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:29,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:29,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:25:29,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:25:29,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:29,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:29,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:29,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:29,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:29,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:29,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:29,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:25:29,153 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 21:25:29,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:29,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:29,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:29,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:29,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:29,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:29,170 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 21:25:29,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:25:29,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:25:29,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:25:29,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:25:29,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:25:29,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:25:29,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:25:29,205 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 21:25:29,228 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:25:29,328 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 21:25:29,329 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) [2019-11-28 21:25:29,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:25:29,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:25:29,337 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:25:29,337 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 21:25:29,388 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 21:25:29,393 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 21:25:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:25:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:29,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 21:25:29,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:25:29,468 WARN L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 21:25:29,468 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:25:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:25:29,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:25:29,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 21:25:29,533 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 21:25:29,535 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 21:25:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:25:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-28 21:25:29,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 21:25:29,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:29,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-28 21:25:29,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:29,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 21:25:29,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:25:29,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-11-28 21:25:29,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:29,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-28 21:25:29,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:25:29,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:25:29,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:25:29,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:25:29,539 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:29,539 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:29,539 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:25:29,539 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:25:29,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:25:29,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:25:29,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:25:29,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:25:29 BoogieIcfgContainer [2019-11-28 21:25:29,556 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:25:29,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:25:29,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:25:29,558 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:25:29,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:25:21" (3/4) ... [2019-11-28 21:25:29,564 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:25:29,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:25:29,570 INFO L168 Benchmark]: Toolchain (without parser) took 9323.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 960.4 MB in the beginning and 923.5 MB in the end (delta: 36.8 MB). Peak memory consumption was 360.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:29,571 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:29,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:29,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.61 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:29,583 INFO L168 Benchmark]: Boogie Preprocessor took 35.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:29,584 INFO L168 Benchmark]: RCFGBuilder took 454.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:29,585 INFO L168 Benchmark]: BuchiAutomizer took 7966.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 923.5 MB in the end (delta: 176.0 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:25:29,586 INFO L168 Benchmark]: Witness Printer took 7.54 ms. Allocated memory is still 1.4 GB. Free memory is still 923.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:25:29,595 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.27 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 779.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.61 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.60 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 454.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7966.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 923.5 MB in the end (delta: 176.0 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.54 ms. Allocated memory is still 1.4 GB. Free memory is still 923.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 unknown-#length-unknown[nondetString2] + -1 * i 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 7.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. 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, 0.2s 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: 24ms 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...