./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fbe99a2ebd720adb01c27af71df604a9114f73ca .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:03:03,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:03:03,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:03:03,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:03:03,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:03:03,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:03:03,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:03:03,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:03:03,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:03:03,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:03:03,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:03:03,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:03:03,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:03:03,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:03:03,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:03:03,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:03:03,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:03:03,367 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:03:03,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:03:03,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:03:03,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:03:03,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:03:03,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:03:03,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:03:03,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:03:03,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:03:03,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:03:03,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:03:03,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:03:03,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:03:03,378 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:03:03,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:03:03,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:03:03,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:03:03,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:03:03,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:03:03,380 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 14:03:03,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:03:03,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:03:03,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:03:03,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:03:03,394 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:03:03,394 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:03:03,394 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:03:03,394 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:03:03,394 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:03:03,394 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:03:03,394 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:03:03,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:03:03,395 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:03:03,396 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:03:03,396 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:03:03,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:03:03,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:03:03,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:03:03,396 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:03:03,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:03:03,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:03:03,397 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:03:03,397 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:03:03,398 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbe99a2ebd720adb01c27af71df604a9114f73ca [2018-11-23 14:03:03,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:03:03,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:03:03,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:03:03,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:03:03,435 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:03:03,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i [2018-11-23 14:03:03,477 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/data/32480709c/5cf4afd412fd420b897260087ad1cd5f/FLAG236d637ea [2018-11-23 14:03:03,868 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:03:03,869 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/sv-benchmarks/c/termination-memory-alloca/b.10-alloca_true-termination_true-no-overflow.c.i [2018-11-23 14:03:03,876 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/data/32480709c/5cf4afd412fd420b897260087ad1cd5f/FLAG236d637ea [2018-11-23 14:03:03,885 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/data/32480709c/5cf4afd412fd420b897260087ad1cd5f [2018-11-23 14:03:03,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:03:03,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:03:03,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:03:03,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:03:03,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:03:03,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:03:03" (1/1) ... [2018-11-23 14:03:03,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328baf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:03, skipping insertion in model container [2018-11-23 14:03:03,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:03:03" (1/1) ... [2018-11-23 14:03:03,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:03:03,940 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:03:04,171 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:03:04,181 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:03:04,267 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:03:04,302 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:03:04,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04 WrapperNode [2018-11-23 14:03:04,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:03:04,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:03:04,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:03:04,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:03:04,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:03:04,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:03:04,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:03:04,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:03:04,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... [2018-11-23 14:03:04,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:03:04,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:03:04,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:03:04,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:03:04,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2223aeb-ee6d-4c32-a313-1772c1d6c87d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:03:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:03:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:03:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:03:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:03:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:03:04,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:03:04,622 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:03:04,622 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 14:03:04,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:03:04 BoogieIcfgContainer [2018-11-23 14:03:04,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:03:04,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:03:04,623 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:03:04,626 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:03:04,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:03:04,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:03:03" (1/3) ... [2018-11-23 14:03:04,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@646e3524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:03:04, skipping insertion in model container [2018-11-23 14:03:04,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:03:04,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:03:04" (2/3) ... [2018-11-23 14:03:04,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@646e3524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:03:04, skipping insertion in model container [2018-11-23 14:03:04,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:03:04,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:03:04" (3/3) ... [2018-11-23 14:03:04,630 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.10-alloca_true-termination_true-no-overflow.c.i [2018-11-23 14:03:04,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:03:04,673 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:03:04,673 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:03:04,673 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:03:04,674 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:03:04,674 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:03:04,674 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:03:04,674 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:03:04,674 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:03:04,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:03:04,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 14:03:04,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:04,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:04,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:03:04,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:04,711 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:03:04,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 14:03:04,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 14:03:04,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:04,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:04,714 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:03:04,714 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:04,721 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2018-11-23 14:03:04,722 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem11;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short16;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; 5#L559-2true [2018-11-23 14:03:04,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 14:03:04,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:04,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:04,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:04,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2018-11-23 14:03:04,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:04,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:04,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:03:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:03:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:03:04,890 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:03:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:03:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:03:04,903 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2018-11-23 14:03:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:03:04,965 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-23 14:03:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:03:04,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 14:03:04,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 14:03:04,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2018-11-23 14:03:04,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 14:03:04,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 14:03:04,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-23 14:03:04,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:03:04,974 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 14:03:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-23 14:03:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 14:03:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 14:03:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-23 14:03:05,003 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 14:03:05,003 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-23 14:03:05,004 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:03:05,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-23 14:03:05,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 14:03:05,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:05,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:05,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 14:03:05,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:05,005 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2018-11-23 14:03:05,005 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem11;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short16;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; 53#L559-2 [2018-11-23 14:03:05,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 14:03:05,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:05,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:05,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2018-11-23 14:03:05,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:05,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:05,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:03:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:05,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2018-11-23 14:03:05,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:05,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:05,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:05,303 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-11-23 14:03:05,534 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-23 14:03:05,640 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:03:05,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:03:05,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:03:05,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:03:05,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:03:05,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:03:05,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:03:05,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:03:05,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.10-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-23 14:03:05,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:03:05,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:03:05,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,914 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-23 14:03:05,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:06,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:06,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:06,367 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:03:06,371 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:03:06,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,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 [2018-11-23 14:03:06,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,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 [2018-11-23 14:03:06,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:06,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:06,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:06,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:06,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:06,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:06,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:06,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:06,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:06,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:06,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:06,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:06,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:06,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:06,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:06,463 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:03:06,474 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 14:03:06,474 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 14:03:06,476 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:03:06,478 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:03:06,478 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:03:06,479 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-23 14:03:06,537 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 14:03:06,541 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:03:06,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:06,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:06,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:03:06,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:03:06,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 14:03:06,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 31 states and 45 transitions. Complement of second has 6 states. [2018-11-23 14:03:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:03:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 14:03:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-23 14:03:06,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-23 14:03:06,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:06,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 14:03:06,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:06,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-23 14:03:06,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:06,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2018-11-23 14:03:06,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 14:03:06,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2018-11-23 14:03:06,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 14:03:06,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 14:03:06,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2018-11-23 14:03:06,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:03:06,677 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-11-23 14:03:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2018-11-23 14:03:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 14:03:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 14:03:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-11-23 14:03:06,680 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-23 14:03:06,680 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-11-23 14:03:06,680 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:03:06,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2018-11-23 14:03:06,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 14:03:06,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:06,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:06,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 14:03:06,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:06,682 INFO L794 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 251#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 252#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 235#L555-1 [2018-11-23 14:03:06,682 INFO L796 eck$LassoCheckResult]: Loop: 235#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 249#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 254#L555-4 assume test_fun_#t~short13; 238#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 239#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 246#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem11;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short16;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 241#L556 assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 242#L559 assume !(test_fun_#t~mem19 > 0);havoc test_fun_#t~mem19; 234#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 235#L555-1 [2018-11-23 14:03:06,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 14:03:06,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:06,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:06,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:06,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2018-11-23 14:03:06,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:06,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:03:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:03:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:03:06,768 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 14:03:06,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:03:06,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:03:06,768 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-23 14:03:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:03:06,811 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-23 14:03:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:03:06,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2018-11-23 14:03:06,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 14:03:06,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2018-11-23 14:03:06,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 14:03:06,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 14:03:06,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-11-23 14:03:06,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 14:03:06,813 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-23 14:03:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-11-23 14:03:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 14:03:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 14:03:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-11-23 14:03:06,815 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-23 14:03:06,815 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-23 14:03:06,815 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:03:06,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2018-11-23 14:03:06,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 14:03:06,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:06,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:06,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 14:03:06,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:06,816 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 323#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem21, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 324#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 307#L555-1 [2018-11-23 14:03:06,816 INFO L796 eck$LassoCheckResult]: Loop: 307#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 321#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 326#L555-4 assume test_fun_#t~short13; 310#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 311#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 319#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem11;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem14;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short16;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 314#L556 assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 315#L559 assume test_fun_#t~mem19 > 0;havoc test_fun_#t~mem19;call test_fun_#t~mem20 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem20 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem20; 306#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 307#L555-1 [2018-11-23 14:03:06,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-23 14:03:06,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:06,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:06,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:06,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash 572463628, now seen corresponding path program 1 times [2018-11-23 14:03:06,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:03:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash -198955831, now seen corresponding path program 1 times [2018-11-23 14:03:06,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:06,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:07,015 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-23 14:03:07,135 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-23 14:03:07,331 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-23 14:03:07,544 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-23 14:03:07,547 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:03:07,547 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:03:07,547 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:03:07,547 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:03:07,547 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:03:07,547 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:03:07,547 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:03:07,547 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:03:07,548 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.10-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-23 14:03:07,548 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:03:07,548 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:03:07,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:07,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:07,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:07,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:07,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:07,934 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-23 14:03:08,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:08,395 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-11-23 14:03:08,539 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:03:08,539 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:03:08,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:08,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:08,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:08,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:08,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:08,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:08,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:08,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:08,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:08,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:08,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:08,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:08,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:08,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:08,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:08,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:08,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:08,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:08,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:08,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:08,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:08,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:08,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:08,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:08,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:08,567 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:03:08,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 14:03:08,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:08,576 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 14:03:08,576 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 14:03:08,663 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:03:08,701 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 14:03:08,701 INFO L444 ModelExtractionUtils]: 48 out of 56 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 14:03:08,702 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:03:08,703 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 14:03:08,703 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:03:08,703 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-23 14:03:08,766 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 14:03:08,767 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 14:03:08,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:08,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:08,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:08,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:03:08,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-11-23 14:03:08,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:03:08,907 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 50 treesize of output 39 [2018-11-23 14:03:08,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:03:08,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:03:08,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:03:08,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:03:08,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-11-23 14:03:08,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:03:08,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:03:08,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 14:03:08,974 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:69 [2018-11-23 14:03:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:03:09,003 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 14:03:09,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-11-23 14:03:09,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 60 states and 89 transitions. Complement of second has 10 states. [2018-11-23 14:03:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 14:03:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 14:03:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 14:03:09,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 3 letters. Loop has 9 letters. [2018-11-23 14:03:09,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:09,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 9 letters. [2018-11-23 14:03:09,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:09,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 3 letters. Loop has 18 letters. [2018-11-23 14:03:09,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:09,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 89 transitions. [2018-11-23 14:03:09,107 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:03:09,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2018-11-23 14:03:09,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:03:09,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:03:09,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:03:09,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:03:09,108 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:03:09,108 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:03:09,108 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:03:09,108 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:03:09,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:03:09,108 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:03:09,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:03:09,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:03:09 BoogieIcfgContainer [2018-11-23 14:03:09,114 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:03:09,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:03:09,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:03:09,115 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:03:09,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:03:04" (3/4) ... [2018-11-23 14:03:09,118 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:03:09,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:03:09,119 INFO L168 Benchmark]: Toolchain (without parser) took 5231.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -126.4 MB). Peak memory consumption was 202.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:09,120 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:03:09,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:09,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.79 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. [2018-11-23 14:03:09,121 INFO L168 Benchmark]: Boogie Preprocessor took 18.43 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. [2018-11-23 14:03:09,121 INFO L168 Benchmark]: RCFGBuilder took 268.12 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:09,122 INFO L168 Benchmark]: BuchiAutomizer took 4491.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:03:09,122 INFO L168 Benchmark]: Witness Printer took 3.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:03:09,125 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.79 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. * Boogie Preprocessor took 18.43 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 268.12 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4491.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 27 SDslu, 103 SDs, 0 SdLazy, 101 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital423 mio100 ax105 hnf99 lsp72 ukn76 mio100 lsp30 div100 bol106 ite100 ukn100 eq163 hnf89 smp95 dnf221 smp73 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 136ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...