./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd1b17fffb471392e4e5cb414f885f337c434a14 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:19:06,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:19:06,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:19:06,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:19:06,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:19:06,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:19:06,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:19:06,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:19:06,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:19:06,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:19:06,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:19:06,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:19:06,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:19:06,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:19:06,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:19:06,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:19:06,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:19:06,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:19:06,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:19:06,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:19:06,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:19:06,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:19:06,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:19:06,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:19:06,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:19:06,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:19:06,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:19:06,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:19:06,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:19:06,104 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:19:06,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:19:06,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:19:06,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:19:06,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:19:06,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:19:06,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:19:06,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:19:06,126 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:19:06,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:19:06,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:19:06,127 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:19:06,128 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:19:06,128 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:19:06,128 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:19:06,129 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:19:06,129 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:19:06,129 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:19:06,129 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:19:06,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:19:06,130 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:19:06,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:19:06,132 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:19:06,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:19:06,132 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:19:06,132 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:19:06,132 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:19:06,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:19:06,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:19:06,134 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:19:06,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:19:06,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:19:06,135 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:19:06,136 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:19:06,136 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd1b17fffb471392e4e5cb414f885f337c434a14 [2019-01-02 00:19:06,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:19:06,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:19:06,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:19:06,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:19:06,192 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:19:06,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:06,259 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c40fa17/cf8048c1a7c845b6ac0476daed255e3e/FLAG732eaf68f [2019-01-02 00:19:06,812 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:19:06,812 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:06,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c40fa17/cf8048c1a7c845b6ac0476daed255e3e/FLAG732eaf68f [2019-01-02 00:19:07,116 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c40fa17/cf8048c1a7c845b6ac0476daed255e3e [2019-01-02 00:19:07,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:19:07,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:19:07,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:07,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:19:07,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:19:07,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7055dd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07, skipping insertion in model container [2019-01-02 00:19:07,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:19:07,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:19:07,604 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:07,615 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:19:07,663 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:07,724 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:19:07,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07 WrapperNode [2019-01-02 00:19:07,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:07,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:07,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:19:07,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:19:07,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:07,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:19:07,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:19:07,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:19:07,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... [2019-01-02 00:19:07,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:19:07,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:19:07,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:19:07,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:19:07,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:19:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:19:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:19:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:19:07,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:19:07,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:19:08,397 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:19:08,397 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-02 00:19:08,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:08 BoogieIcfgContainer [2019-01-02 00:19:08,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:19:08,399 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:19:08,399 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:19:08,405 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:19:08,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:08,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:19:07" (1/3) ... [2019-01-02 00:19:08,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e54e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:08, skipping insertion in model container [2019-01-02 00:19:08,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:08,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:07" (2/3) ... [2019-01-02 00:19:08,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e54e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:08, skipping insertion in model container [2019-01-02 00:19:08,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:08,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:08" (3/3) ... [2019-01-02 00:19:08,410 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:08,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:19:08,474 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:19:08,474 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:19:08,474 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:19:08,475 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:19:08,475 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:19:08,475 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:19:08,476 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:19:08,476 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:19:08,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-02 00:19:08,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:08,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:08,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:08,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:08,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:08,527 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:19:08,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-02 00:19:08,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:08,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:08,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:08,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:08,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:08,541 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 7#L554true assume !(main_~length1~0 < 1); 12#L554-2true assume !(main_~length2~0 < 1); 6#L557-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 17#L543-5true [2019-01-02 00:19:08,543 INFO L796 eck$LassoCheckResult]: Loop: 17#L543-5true call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 10#L543-1true assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 13#L543-3true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 17#L543-5true [2019-01-02 00:19:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:19:08,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:08,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:08,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:08,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:08,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2019-01-02 00:19:08,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:08,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2019-01-02 00:19:08,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:08,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:08,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:09,430 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-02 00:19:10,396 WARN L181 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-02 00:19:10,516 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-02 00:19:10,530 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:10,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:10,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:10,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:10,532 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:10,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:10,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:10,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:10,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:19:10,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:10,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:10,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:10,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,137 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-02 00:19:11,361 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:19:11,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:11,827 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-02 00:19:12,423 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-02 00:19:12,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:12,655 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:12,658 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 [2019-01-02 00:19:12,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:12,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,666 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 [2019-01-02 00:19:12,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:12,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,670 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 [2019-01-02 00:19:12,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:12,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,673 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 [2019-01-02 00:19:12,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:12,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:12,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,681 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 [2019-01-02 00:19:12,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:12,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,685 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 [2019-01-02 00:19:12,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:12,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,688 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 [2019-01-02 00:19:12,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:12,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:12,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,695 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 [2019-01-02 00:19:12,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:12,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,698 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 [2019-01-02 00:19:12,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:12,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:12,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,717 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 [2019-01-02 00:19:12,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:12,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:12,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,724 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 [2019-01-02 00:19:12,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,725 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:12,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,735 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:12,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:12,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,807 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 [2019-01-02 00:19:12,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:12,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,808 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:19:12,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:19:12,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:12,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:12,815 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 [2019-01-02 00:19:12,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:12,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:12,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:12,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:12,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:12,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:12,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:12,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:19:12,959 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:12,962 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:12,963 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:12,964 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:12,964 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1) = -1*ULTIMATE.start_cstrcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1 Supporting invariants [] [2019-01-02 00:19:13,220 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-01-02 00:19:13,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:13,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:13,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:13,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:13,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:13,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-01-02 00:19:13,542 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 39 states and 52 transitions. Complement of second has 7 states. [2019-01-02 00:19:13,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 [2019-01-02 00:19:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-01-02 00:19:13,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-02 00:19:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-02 00:19:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:13,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-02 00:19:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:13,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-01-02 00:19:13,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:13,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2019-01-02 00:19:13,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:19:13,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:19:13,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-01-02 00:19:13,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:13,561 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-02 00:19:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-01-02 00:19:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-02 00:19:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-02 00:19:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-01-02 00:19:13,588 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-02 00:19:13,588 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-02 00:19:13,588 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:13,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-01-02 00:19:13,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:13,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:13,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:13,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:13,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:13,590 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L554 assume !(main_~length1~0 < 1); 182#L554-2 assume !(main_~length2~0 < 1); 183#L557-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 186#L543-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 176#L543-1 [2019-01-02 00:19:13,590 INFO L796 eck$LassoCheckResult]: Loop: 176#L543-1 assume !cstrcmp_#t~short5; 177#L543-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 184#L543-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 176#L543-1 [2019-01-02 00:19:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-01-02 00:19:13,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:13,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:13,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2019-01-02 00:19:13,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:13,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:13,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:13,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:13,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:19:13,719 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:19:13,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:19:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:19:13,725 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-02 00:19:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:13,743 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-01-02 00:19:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:19:13,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-01-02 00:19:13,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:13,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-02 00:19:13,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:13,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:13,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:13,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:13,746 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:13,746 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:13,746 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:13,746 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:13,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:13,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:13,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:13,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:13 BoogieIcfgContainer [2019-01-02 00:19:13,752 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:13,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:13,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:13,753 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:13,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:08" (3/4) ... [2019-01-02 00:19:13,757 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:13,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:13,758 INFO L168 Benchmark]: Toolchain (without parser) took 6637.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:13,759 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:13,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.58 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:13,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:13,761 INFO L168 Benchmark]: Boogie Preprocessor took 32.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:13,762 INFO L168 Benchmark]: RCFGBuilder took 503.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:13,763 INFO L168 Benchmark]: BuchiAutomizer took 5353.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:13,764 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:13,769 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 602.58 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.88 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 503.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5353.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s2] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 27 SDslu, 16 SDs, 0 SdLazy, 14 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf171 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...