./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer --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 169307d87ddc37871e07877236048b02359797e9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/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: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:52:09,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:52:09,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:52:09,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:52:09,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:52:09,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:52:09,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:52:09,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:52:09,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:52:09,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:52:09,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:52:09,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:52:09,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:52:09,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:52:09,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:52:09,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:52:09,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:52:09,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:52:09,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:52:09,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:52:09,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:52:09,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:52:09,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:52:09,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:52:09,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:52:09,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:52:09,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:52:09,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:52:09,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:52:09,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:52:09,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:52:09,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:52:09,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:52:09,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:52:09,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:52:09,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:52:09,535 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 01:52:09,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:52:09,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:52:09,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:52:09,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:52:09,546 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:52:09,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:52:09,547 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:52:09,547 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:52:09,547 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:52:09,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:52:09,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:52:09,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:52:09,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:52:09,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:52:09,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:52:09,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:52:09,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:52:09,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:52:09,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:52:09,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:52:09,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:52:09,550 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer 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 -> 169307d87ddc37871e07877236048b02359797e9 [2018-11-10 01:52:09,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:52:09,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:52:09,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:52:09,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:52:09,596 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:52:09,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i [2018-11-10 01:52:09,633 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/data/54b3e12f1/dec18690989249e4b936745294c32827/FLAGc88b0bbd3 [2018-11-10 01:52:10,002 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:52:10,002 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/sv-benchmarks/c/termination-libowfat/strcat_true-termination.c.i [2018-11-10 01:52:10,010 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/data/54b3e12f1/dec18690989249e4b936745294c32827/FLAGc88b0bbd3 [2018-11-10 01:52:10,022 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/data/54b3e12f1/dec18690989249e4b936745294c32827 [2018-11-10 01:52:10,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:52:10,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:52:10,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:52:10,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:52:10,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:52:10,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10, skipping insertion in model container [2018-11-10 01:52:10,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:52:10,071 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:52:10,280 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:52:10,285 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:52:10,314 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:52:10,342 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:52:10,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10 WrapperNode [2018-11-10 01:52:10,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:52:10,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:52:10,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:52:10,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:52:10,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:52:10,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:52:10,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:52:10,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:52:10,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... [2018-11-10 01:52:10,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:52:10,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:52:10,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:52:10,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:52:10,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91463e03-6fef-4ef5-9af5-04432b5afcf5/bin-2019/uautomizer/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 [2018-11-10 01:52:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:52:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:52:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:52:10,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:52:10,706 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:52:10,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:52:10 BoogieIcfgContainer [2018-11-10 01:52:10,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:52:10,706 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:52:10,706 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:52:10,709 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:52:10,709 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:52:10,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:52:10" (1/3) ... [2018-11-10 01:52:10,710 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20de2d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:52:10, skipping insertion in model container [2018-11-10 01:52:10,710 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:52:10,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:10" (2/3) ... [2018-11-10 01:52:10,710 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20de2d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:52:10, skipping insertion in model container [2018-11-10 01:52:10,711 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:52:10,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:52:10" (3/3) ... [2018-11-10 01:52:10,712 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_true-termination.c.i [2018-11-10 01:52:10,758 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:52:10,758 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:52:10,758 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:52:10,758 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:52:10,758 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:52:10,758 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:52:10,759 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:52:10,759 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:52:10,759 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:52:10,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-10 01:52:10,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 01:52:10,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:52:10,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:52:10,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:52:10,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:52:10,797 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:52:10,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-10 01:52:10,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 01:52:10,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:52:10,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:52:10,799 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:52:10,799 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:52:10,804 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 4#L526true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset; 16#L528true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L528 20#L528-1true main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 11#L530true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 9#L532true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 27#L534true SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0 * 1, 1); srcloc: L534 29#L534-1true assume { :begin_inline_strcat } true;strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 14#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 24#L509-5true [2018-11-10 01:52:10,805 INFO L795 eck$LassoCheckResult]: Loop: 24#L509-5true assume true; 33#L509-1true SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 36#L509-2true assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 22#L509-4true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 24#L509-5true [2018-11-10 01:52:10,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1274117199, now seen corresponding path program 1 times [2018-11-10 01:52:10,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:10,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:10,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1848196, now seen corresponding path program 1 times [2018-11-10 01:52:10,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:10,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:10,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:10,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1019553582, now seen corresponding path program 1 times [2018-11-10 01:52:10,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:11,352 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-11-10 01:52:11,461 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-10 01:52:11,469 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:52:11,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:52:11,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:52:11,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:52:11,470 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:52:11,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:52:11,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:52:11,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:52:11,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration1_Lasso [2018-11-10 01:52:11,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:52:11,471 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:52:11,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,766 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-11-10 01:52:11,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:11,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:12,235 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:52:12,238 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:52:12,239 INFO L122 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 [2018-11-10 01:52:12,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:52:12,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:52:12,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:52:12,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:52:12,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:52:12,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:52:12,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:52:12,247 INFO L122 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 [2018-11-10 01:52:12,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:52:12,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:52:12,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:52:12,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:52:12,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:52:12,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:52:12,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:52:12,254 INFO L122 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 [2018-11-10 01:52:12,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:52:12,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:52:12,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:52:12,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:52:12,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:52:12,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:52:12,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:52:12,259 INFO L122 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 [2018-11-10 01:52:12,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:52:12,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:52:12,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:52:12,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:52:12,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:52:12,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:52:12,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:52:12,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:52:12,358 INFO L444 ModelExtractionUtils]: 62 out of 67 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 01:52:12,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:52:12,365 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:52:12,365 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:52:12,366 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2018-11-10 01:52:12,405 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 01:52:12,413 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 01:52:12,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:52:12,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:52:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:52:12,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:52:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:52:12,469 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 [2018-11-10 01:52:12,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 4 states. [2018-11-10 01:52:12,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 4 states. Result 102 states and 129 transitions. Complement of second has 7 states. [2018-11-10 01:52:12,544 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 [2018-11-10 01:52:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:52:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2018-11-10 01:52:12,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-10 01:52:12,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:52:12,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-10 01:52:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:52:12,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-10 01:52:12,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:52:12,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 129 transitions. [2018-11-10 01:52:12,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-10 01:52:12,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 48 states and 51 transitions. [2018-11-10 01:52:12,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 01:52:12,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 01:52:12,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 51 transitions. [2018-11-10 01:52:12,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:52:12,559 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-10 01:52:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 51 transitions. [2018-11-10 01:52:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2018-11-10 01:52:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 01:52:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-10 01:52:12,578 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 01:52:12,578 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 01:52:12,578 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:52:12,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. [2018-11-10 01:52:12,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 01:52:12,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:52:12,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:52:12,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:52:12,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:52:12,579 INFO L793 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 247#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 244#L526 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset; 245#L528 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L528 258#L528-1 main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 252#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 248#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 249#L534 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0 * 1, 1); srcloc: L534 268#L534-1 assume { :begin_inline_strcat } true;strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 255#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 250#L510 strcat_#t~ret5 := strlen_#res;assume { :end_inline_strlen } true;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296 * 1;havoc strcat_#t~ret5; 251#L516-3 [2018-11-10 01:52:12,580 INFO L795 eck$LassoCheckResult]: Loop: 251#L516-3 assume true; 264#L516-1 assume !false; 259#L517 SUMMARY for call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L517 242#L517-1 SUMMARY for call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); srcloc: L517-1 243#L517-2 assume !(strcat_#t~mem6 == 0);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 246#L518 SUMMARY for call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L518 274#L518-1 SUMMARY for call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); srcloc: L518-1 261#L518-2 assume !(strcat_#t~mem9 == 0);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset; 253#L519 SUMMARY for call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L519 254#L519-1 SUMMARY for call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); srcloc: L519-1 257#L519-2 assume !(strcat_#t~mem12 == 0);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset; 260#L520 SUMMARY for call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L520 270#L520-1 SUMMARY for call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); srcloc: L520-1 271#L520-2 assume !(strcat_#t~mem15 == 0);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 251#L516-3 [2018-11-10 01:52:12,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash 842927487, now seen corresponding path program 1 times [2018-11-10 01:52:12,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:12,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:12,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:12,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:12,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:52:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:52:12,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:52:12,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:52:12,627 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:52:12,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1082861740, now seen corresponding path program 1 times [2018-11-10 01:52:12,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:12,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:12,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:12,999 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2018-11-10 01:52:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:52:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:52:13,069 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 01:52:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:52:13,092 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-10 01:52:13,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:52:13,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-10 01:52:13,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 01:52:13,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 35 transitions. [2018-11-10 01:52:13,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 01:52:13,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 01:52:13,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2018-11-10 01:52:13,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:52:13,098 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 01:52:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2018-11-10 01:52:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 01:52:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 01:52:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-10 01:52:13,100 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 01:52:13,100 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 01:52:13,100 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:52:13,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2018-11-10 01:52:13,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 01:52:13,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:52:13,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:52:13,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:52:13,101 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:52:13,101 INFO L793 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 319#L526 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset; 320#L528 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L528 333#L528-1 main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 327#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 323#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 324#L534 SUMMARY for call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0 * 1, 1); srcloc: L534 343#L534-1 assume { :begin_inline_strcat } true;strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 330#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 331#L509-5 assume true; 341#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 347#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 342#L509-6 strlen_#res := strlen_~i~0; 325#L510 strcat_#t~ret5 := strlen_#res;assume { :end_inline_strlen } true;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296 * 1;havoc strcat_#t~ret5; 326#L516-3 [2018-11-10 01:52:13,101 INFO L795 eck$LassoCheckResult]: Loop: 326#L516-3 assume true; 339#L516-1 assume !false; 334#L517 SUMMARY for call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L517 317#L517-1 SUMMARY for call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); srcloc: L517-1 318#L517-2 assume !(strcat_#t~mem6 == 0);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 321#L518 SUMMARY for call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L518 349#L518-1 SUMMARY for call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); srcloc: L518-1 336#L518-2 assume !(strcat_#t~mem9 == 0);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset; 328#L519 SUMMARY for call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L519 329#L519-1 SUMMARY for call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); srcloc: L519-1 332#L519-2 assume !(strcat_#t~mem12 == 0);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset; 335#L520 SUMMARY for call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1); srcloc: L520 345#L520-1 SUMMARY for call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); srcloc: L520-1 346#L520-2 assume !(strcat_#t~mem15 == 0);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, strcat_~s.offset + 1;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + 1;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, strcat_~t.offset + 1;strcat_~t.base, strcat_~t.offset := strcat_~t.base, strcat_~t.offset + 1;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 326#L516-3 [2018-11-10 01:52:13,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1541391724, now seen corresponding path program 1 times [2018-11-10 01:52:13,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:13,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:13,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1082861740, now seen corresponding path program 2 times [2018-11-10 01:52:13,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:52:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:13,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:52:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash -89811801, now seen corresponding path program 1 times [2018-11-10 01:52:13,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:52:13,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:52:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:13,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:52:13,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:52:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:52:13,525 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2018-11-10 01:52:13,890 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 138 [2018-11-10 01:52:14,002 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 01:52:14,003 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:52:14,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:52:14,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:52:14,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:52:14,004 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:52:14,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:52:14,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:52:14,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:52:14,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_true-termination.c.i_Iteration3_Lasso [2018-11-10 01:52:14,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:52:14,004 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:52:14,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:52:14,452 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 117 [2018-11-10 01:52:14,475 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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:316) 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) [2018-11-10 01:52:14,477 INFO L168 Benchmark]: Toolchain (without parser) took 4451.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 364.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:52:14,478 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:52:14,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:52:14,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -216.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:52:14,479 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:52:14,480 INFO L168 Benchmark]: RCFGBuilder took 268.46 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:52:14,480 INFO L168 Benchmark]: BuchiAutomizer took 3769.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.1 MB). Peak memory consumption was 371.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:52:14,484 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.23 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 935.0 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -216.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 268.46 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3769.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.1 MB). Peak memory consumption was 371.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...