./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/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 a398041f87cd84898ae142142fdf4872d746c3b1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:02:45,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:02:45,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:02:46,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:02:46,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:02:46,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:02:46,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:02:46,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:02:46,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:02:46,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:02:46,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:02:46,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:02:46,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:02:46,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:02:46,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:02:46,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:02:46,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:02:46,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:02:46,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:02:46,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:02:46,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:02:46,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:02:46,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:02:46,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:02:46,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:02:46,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:02:46,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:02:46,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:02:46,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:02:46,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:02:46,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:02:46,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:02:46,015 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:02:46,015 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:02:46,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:02:46,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:02:46,016 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 07:02:46,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:02:46,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:02:46,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:02:46,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:02:46,025 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:02:46,025 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 07:02:46,025 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 07:02:46,025 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 07:02:46,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:02:46,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 07:02:46,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 07:02:46,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 07:02:46,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:02:46,027 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 07:02:46,027 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:02:46,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 07:02:46,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:02:46,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:02:46,028 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 07:02:46,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:02:46,028 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:02:46,028 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 07:02:46,029 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 07:02:46,029 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_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/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 -> a398041f87cd84898ae142142fdf4872d746c3b1 [2018-12-02 07:02:46,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:02:46,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:02:46,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:02:46,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:02:46,056 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:02:46,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-12-02 07:02:46,090 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/data/4aa874285/0c123e630e4d43b9babfd78edf68b27f/FLAGe550c61be [2018-12-02 07:02:46,542 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:02:46,543 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/sv-benchmarks/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-12-02 07:02:46,548 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/data/4aa874285/0c123e630e4d43b9babfd78edf68b27f/FLAGe550c61be [2018-12-02 07:02:46,558 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/data/4aa874285/0c123e630e4d43b9babfd78edf68b27f [2018-12-02 07:02:46,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:02:46,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:02:46,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:02:46,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:02:46,565 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:02:46,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c26117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46, skipping insertion in model container [2018-12-02 07:02:46,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:02:46,593 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:02:46,741 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:02:46,748 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:02:46,805 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:02:46,824 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:02:46,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46 WrapperNode [2018-12-02 07:02:46,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:02:46,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:02:46,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:02:46,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:02:46,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:02:46,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:02:46,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:02:46,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:02:46,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... [2018-12-02 07:02:46,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:02:46,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:02:46,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:02:46,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:02:46,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/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-12-02 07:02:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:02:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:02:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:02:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:02:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:02:46,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:02:47,017 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:02:47,017 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 07:02:47,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:02:47 BoogieIcfgContainer [2018-12-02 07:02:47,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:02:47,018 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 07:02:47,018 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 07:02:47,021 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 07:02:47,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:02:47,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 07:02:46" (1/3) ... [2018-12-02 07:02:47,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b3d2570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:02:47, skipping insertion in model container [2018-12-02 07:02:47,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:02:47,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:02:46" (2/3) ... [2018-12-02 07:02:47,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b3d2570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 07:02:47, skipping insertion in model container [2018-12-02 07:02:47,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 07:02:47,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:02:47" (3/3) ... [2018-12-02 07:02:47,024 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2018-12-02 07:02:47,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:02:47,060 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 07:02:47,060 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 07:02:47,061 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 07:02:47,061 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:02:47,061 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:02:47,061 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 07:02:47,061 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:02:47,061 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 07:02:47,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 07:02:47,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:47,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:47,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:47,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:02:47,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:02:47,089 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 07:02:47,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 07:02:47,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:47,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:47,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:47,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:02:47,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 07:02:47,097 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L557-3true [2018-12-02 07:02:47,098 INFO L796 eck$LassoCheckResult]: Loop: 13#L557-3true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 11#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 13#L557-3true [2018-12-02 07:02:47,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 07:02:47,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:47,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:47,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-12-02 07:02:47,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:47,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:47,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:02:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 07:02:47,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 07:02:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 07:02:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 07:02:47,234 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-02 07:02:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:02:47,238 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-02 07:02:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 07:02:47,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-02 07:02:47,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:47,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-12-02 07:02:47,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 07:02:47,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 07:02:47,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-12-02 07:02:47,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:02:47,243 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 07:02:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-12-02 07:02:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-02 07:02:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 07:02:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-02 07:02:47,259 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 07:02:47,259 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 07:02:47,259 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 07:02:47,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-02 07:02:47,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:47,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:47,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:47,260 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 07:02:47,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 07:02:47,260 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L557-3 [2018-12-02 07:02:47,260 INFO L796 eck$LassoCheckResult]: Loop: 33#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 37#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 36#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 33#L557-3 [2018-12-02 07:02:47,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 07:02:47,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:47,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:47,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:47,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-12-02 07:02:47,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:47,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:47,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:47,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-12-02 07:02:47,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:47,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:47,730 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-02 07:02:47,861 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-02 07:02:47,868 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:47,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:47,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:47,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:47,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:47,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:47,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:47,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:47,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-02 07:02:47,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:47,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:47,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:47,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:47,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:47,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,171 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-02 07:02:48,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:48,619 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:48,622 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:48,624 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-12-02 07:02:48,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:48,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:48,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:48,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:48,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:48,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:48,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:48,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,629 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-12-02 07:02:48,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,633 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-12-02 07:02:48,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,639 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-12-02 07:02:48,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,643 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-12-02 07:02:48,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:48,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,646 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:48,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,655 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-12-02 07:02:48,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,665 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-12-02 07:02:48,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,683 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-12-02 07:02:48,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,683 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:48,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,685 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:48,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:48,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,692 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-12-02 07:02:48,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,692 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:48,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:48,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:48,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,698 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:48,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,699 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:48,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,701 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-12-02 07:02:48,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,705 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-12-02 07:02:48,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 07:02:48,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,713 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-12-02 07:02:48,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:48,718 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-12-02 07:02:48,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:48,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:48,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:48,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:48,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:48,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:48,730 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:48,739 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 07:02:48,739 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 07:02:48,741 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:48,742 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:02:48,742 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:48,742 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-12-02 07:02:48,832 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-02 07:02:48,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:48,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:48,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:48,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:48,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:48,939 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-12-02 07:02:48,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-12-02 07:02:49,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 17 states and 20 transitions. Complement of second has 11 states. [2018-12-02 07:02:49,019 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-12-02 07:02:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 07:02:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-02 07:02:49,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-02 07:02:49,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:49,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-02 07:02:49,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:49,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-02 07:02:49,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:49,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-12-02 07:02:49,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:49,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2018-12-02 07:02:49,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 07:02:49,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 07:02:49,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-02 07:02:49,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:49,023 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-02 07:02:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-02 07:02:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-02 07:02:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 07:02:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-02 07:02:49,025 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-02 07:02:49,025 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-02 07:02:49,025 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 07:02:49,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-02 07:02:49,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:49,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:49,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:49,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 07:02:49,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 07:02:49,026 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 261#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 274#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 275#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 263#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 264#L558-3 [2018-12-02 07:02:49,026 INFO L796 eck$LassoCheckResult]: Loop: 264#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 270#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 264#L558-3 [2018-12-02 07:02:49,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-12-02 07:02:49,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:49,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:49,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:49,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2018-12-02 07:02:49,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:49,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2018-12-02 07:02:49,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:49,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:49,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:49,534 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2018-12-02 07:02:49,675 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-02 07:02:49,677 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:49,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:49,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:49,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:49,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:49,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:49,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:49,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:49,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-02 07:02:49,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:49,677 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:49,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-12-02 07:02:49,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,926 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-12-02 07:02:49,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,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-12-02 07:02:49,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-12-02 07:02:49,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,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-12-02 07:02:49,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,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-12-02 07:02:49,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:49,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:50,262 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:50,262 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:50,262 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-12-02 07:02:50,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:50,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:50,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:50,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,264 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-12-02 07:02:50,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:50,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:50,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:50,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,266 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-12-02 07:02:50,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,268 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-12-02 07:02:50,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,270 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-12-02 07:02:50,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,270 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:50,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,271 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:50,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,274 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-12-02 07:02:50,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,277 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-12-02 07:02:50,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,282 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-12-02 07:02:50,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,282 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:50,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,283 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:50,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,285 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-12-02 07:02:50,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,287 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-12-02 07:02:50,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,290 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-12-02 07:02:50,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,293 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-12-02 07:02:50,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,295 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-12-02 07:02:50,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:50,297 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-12-02 07:02:50,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:50,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:50,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:50,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:50,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:50,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:50,308 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:50,317 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 07:02:50,317 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 07:02:50,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:50,318 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:02:50,318 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:50,318 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2018-12-02 07:02:50,403 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-12-02 07:02:50,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:50,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:50,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:50,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:50,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:50,439 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-12-02 07:02:50,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 07:02:50,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-12-02 07:02:50,456 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-12-02 07:02:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 07:02:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 07:02:50,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-02 07:02:50,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:50,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 07:02:50,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:50,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 07:02:50,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:50,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-12-02 07:02:50,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:50,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2018-12-02 07:02:50,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 07:02:50,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 07:02:50,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-12-02 07:02:50,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:50,459 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-12-02 07:02:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-12-02 07:02:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-02 07:02:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 07:02:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-02 07:02:50,460 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 07:02:50,460 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 07:02:50,460 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 07:02:50,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-02 07:02:50,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:50,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:50,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:50,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-02 07:02:50,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 07:02:50,461 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 474#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 475#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 489#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 493#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 492#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 491#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 477#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 478#L558-4 [2018-12-02 07:02:50,461 INFO L796 eck$LassoCheckResult]: Loop: 478#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 486#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 481#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 482#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 485#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 478#L558-4 [2018-12-02 07:02:50,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2018-12-02 07:02:50,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:50,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:50,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:50,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2018-12-02 07:02:50,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:50,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:50,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:50,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:50,491 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2018-12-02 07:02:50,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:50,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:50,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:51,093 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-12-02 07:02:51,334 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-02 07:02:51,336 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 07:02:51,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 07:02:51,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 07:02:51,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 07:02:51,337 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 07:02:51,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 07:02:51,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 07:02:51,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 07:02:51,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-12-02 07:02:51,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 07:02:51,337 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 07:02:51,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:51,702 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-12-02 07:02:51,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 07:02:52,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 07:02:52,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 07:02:52,123 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-12-02 07:02:52,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,125 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-12-02 07:02:52,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,127 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-12-02 07:02:52,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,128 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-12-02 07:02:52,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,129 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-12-02 07:02:52,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,130 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-12-02 07:02:52,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,131 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-12-02 07:02:52,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,132 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-12-02 07:02:52,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,133 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-12-02 07:02:52,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,135 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-12-02 07:02:52,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,136 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-12-02 07:02:52,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,137 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-12-02 07:02:52,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,139 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-12-02 07:02:52,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,140 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-12-02 07:02:52,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 07:02:52,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 07:02:52,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 07:02:52,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,141 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-12-02 07:02:52,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,141 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:52,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,142 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:52,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,144 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-12-02 07:02:52,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,147 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-12-02 07:02:52,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,149 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-12-02 07:02:52,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,149 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 07:02:52,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,149 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 07:02:52,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 07:02:52,151 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-12-02 07:02:52,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 07:02:52,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 07:02:52,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 07:02:52,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 07:02:52,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 07:02:52,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 07:02:52,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 07:02:52,170 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 07:02:52,171 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 07:02:52,171 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 07:02:52,171 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 07:02:52,171 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 07:02:52,172 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-02 07:02:52,265 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-02 07:02:52,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:52,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:02:52,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:52,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:52,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:52,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,313 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 31 treesize of output 49 [2018-12-02 07:02:52,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 43 [2018-12-02 07:02:52,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-02 07:02:52,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,358 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 24 treesize of output 25 [2018-12-02 07:02:52,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:02:52,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:02:52,370 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2018-12-02 07:02:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:52,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 07:02:52,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-02 07:02:52,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 58 transitions. Complement of second has 9 states. [2018-12-02 07:02:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 07:02:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 07:02:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-02 07:02:52,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2018-12-02 07:02:52,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:52,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2018-12-02 07:02:52,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:52,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-02 07:02:52,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 07:02:52,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-12-02 07:02:52,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:52,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2018-12-02 07:02:52,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 07:02:52,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 07:02:52,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-12-02 07:02:52,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 07:02:52,426 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-12-02 07:02:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-12-02 07:02:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-02 07:02:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 07:02:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-12-02 07:02:52,428 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-02 07:02:52,428 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-12-02 07:02:52,428 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 07:02:52,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-12-02 07:02:52,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 07:02:52,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 07:02:52,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 07:02:52,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-12-02 07:02:52,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 07:02:52,429 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 774#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 775#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 783#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 784#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 779#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 780#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 790#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 781#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 782#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 777#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 778#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 791#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 792#L558-4 [2018-12-02 07:02:52,429 INFO L796 eck$LassoCheckResult]: Loop: 792#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 785#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 786#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 800#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 801#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 792#L558-4 [2018-12-02 07:02:52,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -652525668, now seen corresponding path program 2 times [2018-12-02 07:02:52,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:52,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:52,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:02:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:02:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:52,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:02:52,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02ed25b9-60f8-47bd-b022-a0fb5ad8eff7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:02:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:02:52,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:02:52,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:02:52,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:02:52,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-02 07:02:52,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 07:02:52,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-02 07:02:52,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-12-02 07:02:52,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:02:52,738 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 23 treesize of output 16 [2018-12-02 07:02:52,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-12-02 07:02:52,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-02 07:02:52,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-02 07:02:52,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 07:02:52,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:02:52,772 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-12-02 07:02:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:02:52,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:02:52,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-12-02 07:02:52,797 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 07:02:52,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:02:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 3 times [2018-12-02 07:02:52,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:02:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:02:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:52,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:02:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:02:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:02:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 07:02:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:02:52,845 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 14 states. [2018-12-02 07:02:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:02:52,987 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-02 07:02:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:02:52,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-12-02 07:02:52,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:02:52,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-12-02 07:02:52,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 07:02:52,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 07:02:52,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 07:02:52,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 07:02:52,988 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:02:52,988 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:02:52,988 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:02:52,988 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 07:02:52,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:02:52,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 07:02:52,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 07:02:52,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 07:02:52 BoogieIcfgContainer [2018-12-02 07:02:52,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 07:02:52,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:02:52,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:02:52,993 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:02:52,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:02:47" (3/4) ... [2018-12-02 07:02:52,996 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 07:02:52,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:02:52,996 INFO L168 Benchmark]: Toolchain (without parser) took 6435.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 951.7 MB in the beginning and 885.5 MB in the end (delta: 66.2 MB). Peak memory consumption was 266.4 MB. Max. memory is 11.5 GB. [2018-12-02 07:02:52,997 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:02:52,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:02:52,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 07:02:52,998 INFO L168 Benchmark]: Boogie Preprocessor took 13.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:02:52,998 INFO L168 Benchmark]: RCFGBuilder took 155.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:02:52,999 INFO L168 Benchmark]: BuchiAutomizer took 5974.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 885.5 MB in the end (delta: 189.9 MB). Peak memory consumption was 279.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:02:52,999 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 885.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:02:53,001 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 155.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5974.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 885.5 MB in the end (delta: 189.9 MB). Peak memory consumption was 279.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 885.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 25 SDslu, 10 SDs, 0 SdLazy, 127 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital876 mio100 ax102 hnf100 lsp96 ukn31 mio100 lsp33 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...