./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6d213bb73df5e8110170d83073afe858aea401c0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:36:38,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:36:38,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:36:38,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:36:38,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:36:38,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:36:38,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:36:38,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:36:38,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:36:38,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:36:38,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:36:38,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:36:38,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:36:38,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:36:38,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:36:38,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:36:38,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:36:38,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:36:38,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:36:38,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:36:38,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:36:38,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:36:38,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:36:38,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:36:38,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:36:38,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:36:38,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:36:38,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:36:38,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:36:38,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:36:38,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:36:38,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:36:38,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:36:38,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:36:38,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:36:38,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:36:38,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:36:38,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:36:38,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:36:38,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:36:38,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:36:38,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:36:38,242 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:36:38,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:36:38,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:36:38,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:36:38,245 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:36:38,245 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:36:38,245 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:36:38,245 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:36:38,246 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:36:38,246 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:36:38,246 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:36:38,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:36:38,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:36:38,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:36:38,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:36:38,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:36:38,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:36:38,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:36:38,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:36:38,248 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:36:38,248 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:36:38,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:36:38,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:36:38,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:36:38,249 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:36:38,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:36:38,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:36:38,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:36:38,250 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:36:38,251 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:36:38,251 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d213bb73df5e8110170d83073afe858aea401c0 [2020-07-29 01:36:38,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:36:38,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:36:38,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:36:38,569 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:36:38,569 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:36:38,570 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2020-07-29 01:36:38,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e899d1ae1/953218c599964add81bd898e15267ff7/FLAGd1ff7c961 [2020-07-29 01:36:39,173 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:36:39,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2020-07-29 01:36:39,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e899d1ae1/953218c599964add81bd898e15267ff7/FLAGd1ff7c961 [2020-07-29 01:36:39,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e899d1ae1/953218c599964add81bd898e15267ff7 [2020-07-29 01:36:39,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:36:39,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:36:39,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:36:39,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:36:39,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:36:39,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:36:39" (1/1) ... [2020-07-29 01:36:39,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d28353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:39, skipping insertion in model container [2020-07-29 01:36:39,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:36:39" (1/1) ... [2020-07-29 01:36:39,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:36:39,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:36:40,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:36:40,069 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:36:40,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:36:40,209 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:36:40,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40 WrapperNode [2020-07-29 01:36:40,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:36:40,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:36:40,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:36:40,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:36:40,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:36:40,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:36:40,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:36:40,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:36:40,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (1/1) ... [2020-07-29 01:36:40,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:36:40,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:36:40,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:36:40,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:36:40,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (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 [2020-07-29 01:36:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:36:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:36:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:36:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:36:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:36:40,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:36:40,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:36:40,909 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:36:40,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:36:40 BoogieIcfgContainer [2020-07-29 01:36:40,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:36:40,914 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:36:40,914 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:36:40,918 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:36:40,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:36:40,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:36:39" (1/3) ... [2020-07-29 01:36:40,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@545f4734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:36:40, skipping insertion in model container [2020-07-29 01:36:40,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:36:40,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:40" (2/3) ... [2020-07-29 01:36:40,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@545f4734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:36:40, skipping insertion in model container [2020-07-29 01:36:40,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:36:40,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:36:40" (3/3) ... [2020-07-29 01:36:40,924 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-2.i [2020-07-29 01:36:40,981 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:36:40,982 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:36:40,982 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:36:40,982 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:36:40,983 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:36:40,983 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:36:40,983 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:36:40,984 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:36:41,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:36:41,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:36:41,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:41,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:41,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:36:41,046 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:36:41,046 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:36:41,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:36:41,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:36:41,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:41,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:41,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:36:41,052 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:36:41,061 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 19#L570true assume !(main_~length~0 < 1); 3#L570-2true assume !(main_~n~1 < 1); 13#L573-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);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_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 7#L553true assume 0 != cstrlcpy_~n~0 % 4294967296; 12#L554-3true [2020-07-29 01:36:41,062 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-3true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 8#L554-1true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 4#L555true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset; 12#L554-3true [2020-07-29 01:36:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2020-07-29 01:36:41,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:41,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814891651] [2020-07-29 01:36:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:41,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:41,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:41,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:41,318 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2020-07-29 01:36:41,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:41,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144502172] [2020-07-29 01:36:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:41,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:41,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:41,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2020-07-29 01:36:41,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:41,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808711468] [2020-07-29 01:36:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:41,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:41,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:41,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:41,627 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-07-29 01:36:42,267 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-07-29 01:36:42,491 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-07-29 01:36:42,506 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:36:42,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:36:42,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:36:42,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:36:42,508 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:36:42,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:42,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:36:42,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:36:42,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-2.i_Iteration1_Lasso [2020-07-29 01:36:42,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:36:42,510 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:36:42,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:42,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:42,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,101 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-07-29 01:36:43,365 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-07-29 01:36:43,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:43,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:44,062 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-07-29 01:36:44,191 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-07-29 01:36:44,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:36:44,941 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:44,951 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 [2020-07-29 01:36:44,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:44,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:44,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:44,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:44,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:44,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:44,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:44,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:45,007 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 [2020-07-29 01:36:45,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:45,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:45,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:45,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:45,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:45,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:45,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:45,012 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) [2020-07-29 01:36:45,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:45,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:45,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:45,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:45,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:45,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:45,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:45,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:36:45,269 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-07-29 01:36:45,270 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:45,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:36:45,286 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:36:45,286 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:36:45,287 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*ULTIMATE.start_main_~length~0 Supporting invariants [1*ULTIMATE.start_main_~length~0 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 >= 0] [2020-07-29 01:36:45,451 INFO L297 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2020-07-29 01:36:45,465 INFO L393 LassoCheck]: Loop: "cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1;" "assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1);" "assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;" [2020-07-29 01:36:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:45,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:45,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:36:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:45,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:45,633 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:36:45,634 INFO L384 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 [2020-07-29 01:36:45,636 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:36:45,660 INFO L624 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2020-07-29 01:36:45,662 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:36:45,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-07-29 01:36:45,667 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:36:45,667 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_34|, |ULTIMATE.start_main_#t~malloc10.base|, ULTIMATE.start_main_~n~1]. (and (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= (store (store |v_#length_34| |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~n~1) |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_main_~length~0) |#length|)) [2020-07-29 01:36:45,668 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) ULTIMATE.start_main_~length~0)) [2020-07-29 01:36:45,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2020-07-29 01:36:45,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; {28#unseeded} is VALID [2020-07-29 01:36:45,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0 < 1); {28#unseeded} is VALID [2020-07-29 01:36:45,696 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !(main_~n~1 < 1); {28#unseeded} is VALID [2020-07-29 01:36:45,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#unseeded} call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);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_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; {149#(and (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:36:45,701 INFO L280 TraceCheckUtils]: 5: Hoare triple {149#(and (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded (= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) ULTIMATE.start_main_~length~0))} assume 0 != cstrlcpy_~n~0 % 4294967296; {128#(and (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ ULTIMATE.start_main_~length~0 (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) 0) unseeded)} is VALID [2020-07-29 01:36:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:45,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:36:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:45,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrlcpy_~s~0.offset) ULTIMATE.start_main_~length~0)) (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ ULTIMATE.start_main_~length~0 (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) 0))} cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; {129#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrlcpy_~s~0.offset) ULTIMATE.start_main_~length~0)) (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ ULTIMATE.start_main_~length~0 (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) 0))} is VALID [2020-07-29 01:36:45,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrlcpy_~s~0.offset) ULTIMATE.start_main_~length~0)) (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ ULTIMATE.start_main_~length~0 (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) 0))} assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); {156#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) ULTIMATE.start_main_~length~0) (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ ULTIMATE.start_main_~length~0 1) (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) oldRank0)) (<= (+ ULTIMATE.start_main_~length~0 1) (+ ULTIMATE.start_cstrlcpy_~s~0.offset oldRank0)))} is VALID [2020-07-29 01:36:45,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {156#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) ULTIMATE.start_main_~length~0) (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (+ ULTIMATE.start_main_~length~0 1) (+ (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) oldRank0)) (<= (+ ULTIMATE.start_main_~length~0 1) (+ ULTIMATE.start_cstrlcpy_~s~0.offset oldRank0)))} assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset; {131#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrlcpy_~s~0.offset) ULTIMATE.start_main_~length~0)) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrlcpy_~s~0.base |ULTIMATE.start_main_#t~malloc11.base|) (>= (+ ULTIMATE.start_main_~length~0 (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|))) 0))} is VALID [2020-07-29 01:36:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:45,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:36:45,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:45,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:45,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:45,920 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 [2020-07-29 01:36:45,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2020-07-29 01:36:46,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 49 states and 70 transitions. Complement of second has 7 states. [2020-07-29 01:36:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:46,186 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:46,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:36:46,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:36:46,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:46,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:46,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:36:46,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:36:46,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:46,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:46,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 70 transitions. [2020-07-29 01:36:46,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:36:46,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:46,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:46,200 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 01:36:46,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:36:46,204 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:36:46,204 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:36:46,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:36:46,208 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:36:46,208 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 70 transitions. cyclomatic complexity: 25 [2020-07-29 01:36:46,209 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:36:46,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:36:46,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:36:46,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:36:46,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:36:46,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:36:46,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:36:46,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:36:46,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:36:46,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:36:46,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:46,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:46,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:46,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:36:46,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:36:46,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:36:46,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:36:46,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:36:46,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:36:46,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:36:46,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:36:46,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:36:46,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:36:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:36:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:36:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:36:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:36:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:36:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:36:46,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:36:46,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:36:46,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 70 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:36:46,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,226 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:36:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-29 01:36:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:46,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:36:46,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:36:46,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:46,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. cyclomatic complexity: 25 [2020-07-29 01:36:46,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:36:46,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 10 states and 13 transitions. [2020-07-29 01:36:46,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:36:46,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:36:46,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:36:46,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:36:46,246 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:36:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:36:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:36:46,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:36:46,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:36:46,276 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:36:46,279 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:36:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:36:46,284 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:36:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:36:46,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:46,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:46,286 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:36:46,286 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:36:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:36:46,287 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:36:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:36:46,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:46,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:46,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:36:46,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:36:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:36:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:36:46,290 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:36:46,290 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:36:46,291 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:36:46,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:36:46,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:36:46,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:46,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:46,292 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:36:46,292 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:36:46,292 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 220#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 221#L570 assume !(main_~length~0 < 1); 225#L570-2 assume !(main_~n~1 < 1); 226#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);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_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 222#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 223#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 227#L560 assume !(0 != cstrlcpy_~siz % 4294967296); 229#L562-2 [2020-07-29 01:36:46,293 INFO L796 eck$LassoCheckResult]: Loop: 229#L562-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 228#L562 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~mem7;havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset; 229#L562-2 [2020-07-29 01:36:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2020-07-29 01:36:46,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:46,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280921631] [2020-07-29 01:36:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:46,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:46,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:46,389 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2112) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:401) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:375) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:343) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:36:46,403 INFO L168 Benchmark]: Toolchain (without parser) took 6915.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -312.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:46,403 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:46,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:46,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.14 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. [2020-07-29 01:36:46,409 INFO L168 Benchmark]: Boogie Preprocessor took 37.17 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. [2020-07-29 01:36:46,412 INFO L168 Benchmark]: RCFGBuilder took 596.40 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:46,413 INFO L168 Benchmark]: BuchiAutomizer took 5483.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:46,421 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 721.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.14 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 37.17 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 596.40 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5483.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...