./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9d8db831e66fcf4f47c300fcbd3a74f1185238a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:26:58,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:26:58,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:26:58,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:26:58,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:26:58,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:26:58,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:26:58,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:26:58,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:26:58,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:26:58,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:26:58,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:26:58,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:26:58,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:26:58,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:26:58,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:26:58,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:26:58,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:26:58,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:26:58,197 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:26:58,198 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:26:58,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:26:58,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:26:58,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:26:58,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:26:58,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:26:58,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:26:58,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:26:58,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:26:58,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:26:58,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:26:58,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:26:58,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:26:58,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:26:58,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:26:58,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:26:58,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:26:58,238 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:26:58,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:26:58,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:26:58,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:26:58,240 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:26:58,240 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:26:58,240 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:26:58,240 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:26:58,242 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:26:58,242 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:26:58,243 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:26:58,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:26:58,243 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:26:58,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:26:58,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:26:58,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:26:58,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:26:58,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:26:58,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:26:58,245 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:26:58,245 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:26:58,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:26:58,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:26:58,246 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:26:58,246 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:26:58,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:26:58,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:26:58,246 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:26:58,249 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:26:58,250 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9d8db831e66fcf4f47c300fcbd3a74f1185238a [2019-01-14 02:26:58,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:26:58,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:26:58,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:26:58,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:26:58,351 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:26:58,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2019-01-14 02:26:58,435 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a96217a5/1497ef0300e34359b5d16b64d0d7d131/FLAG042498a66 [2019-01-14 02:26:59,030 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:26:59,030 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2019-01-14 02:26:59,047 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a96217a5/1497ef0300e34359b5d16b64d0d7d131/FLAG042498a66 [2019-01-14 02:26:59,313 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a96217a5/1497ef0300e34359b5d16b64d0d7d131 [2019-01-14 02:26:59,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:26:59,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:26:59,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:59,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:26:59,324 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:26:59,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:26:59,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bda4a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59, skipping insertion in model container [2019-01-14 02:26:59,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:26:59,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:26:59,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:26:59,743 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:59,757 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:26:59,823 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:59,963 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:26:59,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59 WrapperNode [2019-01-14 02:26:59,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:59,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:59,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:26:59,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:26:59,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:27:00,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:27:00,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:27:00,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:27:00,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (1/1) ... [2019-01-14 02:27:00,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:27:00,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:27:00,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:27:00,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:27:00,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (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-14 02:27:00,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:27:00,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:27:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:27:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:27:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:27:00,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:27:00,501 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:27:00,501 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:27:00,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:00 BoogieIcfgContainer [2019-01-14 02:27:00,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:27:00,504 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:27:00,504 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:27:00,509 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:27:00,511 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:00,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:26:59" (1/3) ... [2019-01-14 02:27:00,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11f78845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:27:00, skipping insertion in model container [2019-01-14 02:27:00,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:00,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:59" (2/3) ... [2019-01-14 02:27:00,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11f78845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:27:00, skipping insertion in model container [2019-01-14 02:27:00,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:00,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:00" (3/3) ... [2019-01-14 02:27:00,522 INFO L375 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2019-01-14 02:27:00,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:27:00,599 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:27:00,599 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:27:00,600 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:27:00,600 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:27:00,600 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:27:00,600 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:27:00,600 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:27:00,600 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:27:00,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:27:00,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:00,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:00,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:00,653 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:00,653 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:00,653 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:27:00,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:27:00,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:00,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:00,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:00,656 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:00,656 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:00,664 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 10#L558-2true [2019-01-14 02:27:00,665 INFO L796 eck$LassoCheckResult]: Loop: 10#L558-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 8#L552-1true assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 9#L553-2true call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 5#L558true assume 0 != main_#t~mem10;havoc main_#t~mem10;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 10#L558-2true [2019-01-14 02:27:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:27:00,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:00,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:00,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:00,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2019-01-14 02:27:00,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:00,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2019-01-14 02:27:00,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:00,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:01,159 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-14 02:27:01,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:27:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:27:01,305 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 02:27:01,712 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-01-14 02:27:01,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:27:01,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:27:01,735 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-14 02:27:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:27:01,803 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-14 02:27:01,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:27:01,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-01-14 02:27:01,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:01,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-01-14 02:27:01,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:27:01,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:27:01,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-14 02:27:01,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:27:01,816 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:27:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-14 02:27:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:27:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:27:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-14 02:27:01,857 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:27:01,857 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:27:01,857 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:27:01,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-01-14 02:27:01,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:01,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:01,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:01,859 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:01,859 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:01,860 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 37#L558-2 [2019-01-14 02:27:01,860 INFO L796 eck$LassoCheckResult]: Loop: 37#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 42#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 38#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 39#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 40#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 37#L558-2 [2019-01-14 02:27:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:27:01,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:01,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2019-01-14 02:27:01,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:01,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:27:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2019-01-14 02:27:01,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:01,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:01,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:01,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:02,328 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-14 02:27:02,844 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-01-14 02:27:02,955 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:27:02,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:27:02,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:27:02,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:27:02,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:27:02,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:02,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:27:02,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:27:02,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:27:02,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:27:02,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:27:02,982 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-14 02:27:02,990 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-14 02:27:02,995 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-14 02:27:03,002 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-14 02:27:03,004 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-14 02:27:03,027 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-14 02:27:03,040 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-14 02:27:03,043 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-14 02:27:03,054 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-14 02:27:03,066 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-14 02:27:03,073 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-14 02:27:03,081 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-14 02:27:03,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:03,092 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-14 02:27:03,097 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-14 02:27:03,367 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-01-14 02:27:03,599 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-14 02:27:03,829 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-14 02:27:04,240 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:27:04,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:27:04,298 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:27:04,301 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-14 02:27:04,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,309 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-14 02:27:04,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,312 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-14 02:27:04,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,315 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-14 02:27:04,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,318 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-14 02:27:04,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,321 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-14 02:27:04,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,328 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-14 02:27:04,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,335 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-14 02:27:04,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,338 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-14 02:27:04,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,346 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-14 02:27:04,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,348 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-14 02:27:04,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,361 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-14 02:27:04,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,381 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-14 02:27:04,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:04,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:04,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:04,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,391 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-14 02:27:04,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,406 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-14 02:27:04,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,440 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-14 02:27:04,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,454 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-14 02:27:04,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,463 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-14 02:27:04,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,488 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-14 02:27:04,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,490 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:27:04,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,494 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:27:04,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,520 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-14 02:27:04,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:04,529 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-14 02:27:04,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:04,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:04,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:04,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:04,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:04,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:04,548 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:27:04,556 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:27:04,556 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:27:04,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:27:04,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:27:04,562 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:27:04,563 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2019-01-14 02:27:04,635 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:27:04,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:27:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:04,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:04,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:04,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2019-01-14 02:27:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:04,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:27:04,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:04,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:04,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:04,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2019-01-14 02:27:05,008 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-14 02:27:05,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:27:05,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-14 02:27:05,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 18 states and 21 transitions. Complement of second has 9 states. [2019-01-14 02:27:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:27:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-14 02:27:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-14 02:27:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:27:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-14 02:27:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:05,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-01-14 02:27:05,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:05,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-01-14 02:27:05,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:27:05,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:27:05,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-14 02:27:05,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:05,129 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 02:27:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-14 02:27:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-14 02:27:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:27:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-14 02:27:05,134 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 02:27:05,134 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 02:27:05,134 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:27:05,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-14 02:27:05,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:05,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:05,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:05,138 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:05,138 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:05,138 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 155#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 156#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 166#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 157#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 158#L553-2 [2019-01-14 02:27:05,138 INFO L796 eck$LassoCheckResult]: Loop: 158#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 168#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 171#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 170#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 169#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 158#L553-2 [2019-01-14 02:27:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-01-14 02:27:05,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:05,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:05,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2019-01-14 02:27:05,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:05,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:05,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:05,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:05,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2019-01-14 02:27:05,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:05,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:05,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:27:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:05,385 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:27:05,581 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-14 02:27:06,093 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-01-14 02:27:06,528 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-14 02:27:06,531 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:27:06,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:27:06,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:27:06,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:27:06,532 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:27:06,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:06,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:27:06,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:27:06,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:27:06,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:27:06,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:27:06,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:06,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:06,541 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-14 02:27:06,549 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-14 02:27:06,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:06,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:06,744 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-01-14 02:27:06,842 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-14 02:27:06,845 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-14 02:27:06,848 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-14 02:27:06,850 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-14 02:27:06,852 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-14 02:27:06,855 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-14 02:27:06,858 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-14 02:27:06,860 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-14 02:27:07,462 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-14 02:27:07,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:27:07,605 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:27:07,606 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-14 02:27:07,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,612 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-14 02:27:07,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,615 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-14 02:27:07,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,618 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-14 02:27:07,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,620 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-14 02:27:07,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:07,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:07,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:07,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,628 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-14 02:27:07,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,656 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-14 02:27:07,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,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-14 02:27:07,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,687 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-14 02:27:07,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,697 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-14 02:27:07,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:07,708 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-14 02:27:07,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:07,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:07,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:07,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:07,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:07,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:07,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:27:07,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:27:07,770 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:27:07,772 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:27:07,773 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:27:07,776 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:27:07,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2019-01-14 02:27:08,070 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:27:08,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:27:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:08,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:08,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:08,321 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-14 02:27:08,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:27:08,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:27:08,355 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2019-01-14 02:27:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:27:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-14 02:27:08,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 02:27:08,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:08,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 02:27:08,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:08,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:27:08,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:08,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-01-14 02:27:08,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:08,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-01-14 02:27:08,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:27:08,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:27:08,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-01-14 02:27:08,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:08,365 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:27:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-01-14 02:27:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-14 02:27:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:27:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-14 02:27:08,368 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:27:08,369 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:27:08,369 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:27:08,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-01-14 02:27:08,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:27:08,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:08,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:08,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-14 02:27:08,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:27:08,372 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 302#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 319#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 303#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 304#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 318#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 322#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 321#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 320#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 315#L553-2 [2019-01-14 02:27:08,372 INFO L796 eck$LassoCheckResult]: Loop: 315#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 307#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 308#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 312#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 313#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 315#L553-2 [2019-01-14 02:27:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2019-01-14 02:27:08,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:08,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:27:08,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:27:08,816 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:27:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2019-01-14 02:27:08,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:08,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:08,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:09,047 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:27:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:27:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:27:09,148 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-01-14 02:27:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:27:09,207 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-14 02:27:09,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:27:09,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-01-14 02:27:09,210 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:27:09,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:27:09,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:27:09,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:27:09,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:27:09,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:27:09,211 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:27:09,211 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:27:09,211 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:27:09,211 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:27:09,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:27:09,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:27:09,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:27:09,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:27:09 BoogieIcfgContainer [2019-01-14 02:27:09,219 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:27:09,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:27:09,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:27:09,220 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:27:09,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:00" (3/4) ... [2019-01-14 02:27:09,226 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:27:09,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:27:09,227 INFO L168 Benchmark]: Toolchain (without parser) took 9909.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 946.0 MB in the beginning and 906.6 MB in the end (delta: 39.4 MB). Peak memory consumption was 251.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:09,228 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:27:09,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:09,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:09,232 INFO L168 Benchmark]: Boogie Preprocessor took 29.68 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-14 02:27:09,234 INFO L168 Benchmark]: RCFGBuilder took 443.57 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.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:09,234 INFO L168 Benchmark]: BuchiAutomizer took 8715.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 906.6 MB in the end (delta: 195.0 MB). Peak memory consumption was 272.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:09,236 INFO L168 Benchmark]: Witness Printer took 6.94 ms. Allocated memory is still 1.2 GB. Free memory is still 906.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:27:09,242 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.68 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 443.57 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.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8715.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 906.6 MB in the end (delta: 195.0 MB). Peak memory consumption was 272.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.94 ms. Allocated memory is still 1.2 GB. Free memory is still 906.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 20 SDslu, 20 SDs, 0 SdLazy, 71 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax107 hnf100 lsp89 ukn58 mio100 lsp38 div162 bol100 ite100 ukn100 eq151 hnf70 smp96 dnf158 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 5 VariablesLoop: 4 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...