./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/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 32bit --witnessprinter.graph.data.programhash a2f74ce7922c40e74e42c65aab9bfb3ac8f3d0eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:53:10,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:53:10,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:53:10,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:53:10,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:53:10,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:53:10,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:53:10,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:53:10,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:53:10,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:53:10,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:53:10,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:53:10,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:53:10,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:53:10,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:53:10,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:53:10,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:53:10,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:53:10,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:53:10,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:53:10,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:53:10,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:53:10,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:53:10,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:53:10,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:53:10,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:53:10,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:53:10,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:53:10,899 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:53:10,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:53:10,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:53:10,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:53:10,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:53:10,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:53:10,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:53:10,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:53:10,901 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:53:10,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:53:10,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:53:10,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:53:10,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:53:10,913 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:53:10,913 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:53:10,913 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:53:10,913 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:53:10,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:53:10,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:53:10,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:53:10,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:53:10,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:53:10,916 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:53:10,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:53:10,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:53:10,916 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:53:10,917 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:53:10,917 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_59affd2a-11fe-44e7-8269-5f490645b0cf/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f74ce7922c40e74e42c65aab9bfb3ac8f3d0eb [2018-11-18 11:53:10,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:53:10,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:53:10,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:53:10,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:53:10,953 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:53:10,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-18 11:53:10,988 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/data/7df2fb355/10867de279af4e569f80f93910e80c48/FLAGf66649089 [2018-11-18 11:53:11,387 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:53:11,387 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-18 11:53:11,392 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/data/7df2fb355/10867de279af4e569f80f93910e80c48/FLAGf66649089 [2018-11-18 11:53:11,401 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/data/7df2fb355/10867de279af4e569f80f93910e80c48 [2018-11-18 11:53:11,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:53:11,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:53:11,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:53:11,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:53:11,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:53:11,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641f4192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11, skipping insertion in model container [2018-11-18 11:53:11,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:53:11,428 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:53:11,543 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:53:11,549 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:53:11,563 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:53:11,573 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:53:11,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11 WrapperNode [2018-11-18 11:53:11,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:53:11,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:53:11,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:53:11,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:53:11,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:53:11,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:53:11,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:53:11,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:53:11,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... [2018-11-18 11:53:11,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:53:11,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:53:11,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:53:11,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:53:11,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:53:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:53:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:53:11,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:53:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:53:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:53:11,900 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:53:11,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:53:11 BoogieIcfgContainer [2018-11-18 11:53:11,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:53:11,901 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:53:11,901 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:53:11,903 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:53:11,903 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:53:11,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:53:11" (1/3) ... [2018-11-18 11:53:11,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cdbf22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:53:11, skipping insertion in model container [2018-11-18 11:53:11,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:53:11,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:53:11" (2/3) ... [2018-11-18 11:53:11,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cdbf22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:53:11, skipping insertion in model container [2018-11-18 11:53:11,904 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:53:11,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:53:11" (3/3) ... [2018-11-18 11:53:11,906 INFO L375 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i [2018-11-18 11:53:11,936 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:53:11,937 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:53:11,937 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:53:11,937 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:53:11,937 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:53:11,937 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:53:11,937 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:53:11,937 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:53:11,937 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:53:11,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-18 11:53:11,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2018-11-18 11:53:11,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:53:11,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:53:11,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:53:11,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:53:11,964 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:53:11,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-18 11:53:11,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2018-11-18 11:53:11,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:53:11,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:53:11,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:53:11,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:53:11,971 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 31#L19-4true [2018-11-18 11:53:11,971 INFO L796 eck$LassoCheckResult]: Loop: 31#L19-4true assume true; 35#L19-1true assume !!(main_~x~0 < main_~n~0);main_~y~0 := 1 + main_~x~0; 6#L20-4true assume !true; 33#L19-3true main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 31#L19-4true [2018-11-18 11:53:11,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 11:53:11,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:11,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1113896, now seen corresponding path program 1 times [2018-11-18 11:53:12,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:12,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:53:12,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:53:12,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:53:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:53:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:53:12,074 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2018-11-18 11:53:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:53:12,079 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-18 11:53:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:53:12,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2018-11-18 11:53:12,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2018-11-18 11:53:12,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 40 states and 49 transitions. [2018-11-18 11:53:12,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 11:53:12,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 11:53:12,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-11-18 11:53:12,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:53:12,086 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-18 11:53:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-11-18 11:53:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-18 11:53:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 11:53:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-11-18 11:53:12,105 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-18 11:53:12,106 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-18 11:53:12,106 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:53:12,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2018-11-18 11:53:12,107 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2018-11-18 11:53:12,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:53:12,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:53:12,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:53:12,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:53:12,107 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 124#L19-4 [2018-11-18 11:53:12,107 INFO L796 eck$LassoCheckResult]: Loop: 124#L19-4 assume true; 132#L19-1 assume !!(main_~x~0 < main_~n~0);main_~y~0 := 1 + main_~x~0; 108#L20-4 assume true; 109#L20-1 assume !(main_~y~0 < main_~n~0); 119#L19-3 main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 124#L19-4 [2018-11-18 11:53:12,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 11:53:12,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash 34512986, now seen corresponding path program 1 times [2018-11-18 11:53:12,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:53:12,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1805952472, now seen corresponding path program 1 times [2018-11-18 11:53:12,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:12,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:53:12,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:53:12,210 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:53:12,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:53:12,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:53:12,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:53:12,211 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:53:12,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:12,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:53:12,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:53:12,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration2_Loop [2018-11-18 11:53:12,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:53:12,211 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:53:12,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:53:12,279 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:12,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:53:12,290 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:12,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:53:12,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:53:12,509 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:53:12,510 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:53:12,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:53:12,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:53:12,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:53:12,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:53:12,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:12,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:53:12,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:53:12,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration2_Loop [2018-11-18 11:53:12,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:53:12,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:53:12,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:53:12,543 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:53:12,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:12,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:12,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:12,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:12,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:12,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:12,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:12,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:12,553 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:53:12,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:53:12,562 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:53:12,563 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:53:12,563 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:53:12,564 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:53:12,564 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-18 11:53:12,565 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:53:12,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:12,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:53:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:12,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:53:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:12,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:53:12,626 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 11:53:12,676 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 73 states and 90 transitions. Complement of second has 7 states. [2018-11-18 11:53:12,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:53:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:53:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 11:53:12,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-18 11:53:12,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:12,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 11:53:12,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:12,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 11:53:12,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:12,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 90 transitions. [2018-11-18 11:53:12,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-18 11:53:12,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 74 transitions. [2018-11-18 11:53:12,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-18 11:53:12,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-18 11:53:12,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 74 transitions. [2018-11-18 11:53:12,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:53:12,683 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-18 11:53:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 74 transitions. [2018-11-18 11:53:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2018-11-18 11:53:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 11:53:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-18 11:53:12,685 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-18 11:53:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:53:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:53:12,685 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 3 states. [2018-11-18 11:53:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:53:12,709 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 11:53:12,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:53:12,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 62 transitions. [2018-11-18 11:53:12,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2018-11-18 11:53:12,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 48 states and 58 transitions. [2018-11-18 11:53:12,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-18 11:53:12,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-18 11:53:12,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2018-11-18 11:53:12,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:53:12,713 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-18 11:53:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2018-11-18 11:53:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-18 11:53:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 11:53:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-18 11:53:12,717 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 11:53:12,717 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 11:53:12,717 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:53:12,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 57 transitions. [2018-11-18 11:53:12,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2018-11-18 11:53:12,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:53:12,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:53:12,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:53:12,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:53:12,720 INFO L794 eck$LassoCheckResult]: Stem: 392#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 378#L19-4 assume true; 386#L19-1 assume !(main_~x~0 < main_~n~0); 389#L19-5 call main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc(400000);havoc main_~v~0;main_~v~0 := 0; 393#L26-4 [2018-11-18 11:53:12,720 INFO L796 eck$LassoCheckResult]: Loop: 393#L26-4 assume true; 394#L26-1 assume !!(main_~v~0 < 100000);call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set.base, elem_exists_#in~set.offset, elem_exists_#in~size, elem_exists_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem7;havoc elem_exists_#res;havoc elem_exists_#t~mem1, elem_exists_#t~post0, elem_exists_~set.base, elem_exists_~set.offset, elem_exists_~size, elem_exists_~value, elem_exists_~i~0;elem_exists_~set.base, elem_exists_~set.offset := elem_exists_#in~set.base, elem_exists_#in~set.offset;elem_exists_~size := elem_exists_#in~size;elem_exists_~value := elem_exists_#in~value;havoc elem_exists_~i~0;elem_exists_~i~0 := 0; 364#L9-4 assume true; 365#L9-1 assume !(elem_exists_~i~0 < elem_exists_~size); 373#L9-5 elem_exists_#res := 0; 379#L12 main_#t~ret8 := elem_exists_#res;assume { :end_inline_elem_exists } true; 366#L27 assume !(0 != main_#t~ret8);havoc main_#t~mem7;havoc main_#t~ret8; 367#L27-2 main_~x~0 := 0; 385#L30-4 assume true; 387#L30-1 assume !(main_~x~0 < main_~n~0); 390#L26-3 main_#t~post6 := main_~v~0;main_~v~0 := 1 + main_#t~post6;havoc main_#t~post6; 393#L26-4 [2018-11-18 11:53:12,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 28694817, now seen corresponding path program 1 times [2018-11-18 11:53:12,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash -802863100, now seen corresponding path program 1 times [2018-11-18 11:53:12,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1498252572, now seen corresponding path program 1 times [2018-11-18 11:53:12,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:12,985 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:53:12,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:53:12,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:53:12,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:53:12,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:53:12,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:12,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:53:12,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:53:12,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration3_Lasso [2018-11-18 11:53:12,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:53:12,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:53:12,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:12,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-11-18 11:53:13,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:53:13,234 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:53:13,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:53:13,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:53:13,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:53:13,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:53:13,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,260 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:53:13,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,262 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:53:13,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:53:13,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:53:13,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:53:13,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,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-11-18 11:53:13,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:53:13,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:53:13,311 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:53:13,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:53:13,325 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 11:53:13,326 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:53:13,327 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:53:13,328 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:53:13,328 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v~0) = -2*ULTIMATE.start_main_~v~0 + 199999 Supporting invariants [] [2018-11-18 11:53:13,354 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 11:53:13,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:13,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:53:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:13,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:53:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:13,398 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:53:13,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 57 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 11:53:13,422 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 57 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 88 states and 109 transitions. Complement of second has 6 states. [2018-11-18 11:53:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:53:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:53:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-18 11:53:13,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 11 letters. [2018-11-18 11:53:13,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:13,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 16 letters. Loop has 11 letters. [2018-11-18 11:53:13,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:13,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-18 11:53:13,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:13,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 109 transitions. [2018-11-18 11:53:13,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-18 11:53:13,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 74 states and 93 transitions. [2018-11-18 11:53:13,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 11:53:13,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 11:53:13,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 93 transitions. [2018-11-18 11:53:13,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:53:13,427 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 93 transitions. [2018-11-18 11:53:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 93 transitions. [2018-11-18 11:53:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-18 11:53:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 11:53:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2018-11-18 11:53:13,431 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 93 transitions. [2018-11-18 11:53:13,431 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 93 transitions. [2018-11-18 11:53:13,431 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:53:13,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 93 transitions. [2018-11-18 11:53:13,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-18 11:53:13,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:53:13,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:53:13,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:53:13,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:53:13,432 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 610#L19-4 assume true; 622#L19-1 assume !(main_~x~0 < main_~n~0); 626#L19-5 call main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc(400000);havoc main_~v~0;main_~v~0 := 0; 630#L26-4 assume true; 632#L26-1 assume !!(main_~v~0 < 100000);call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set.base, elem_exists_#in~set.offset, elem_exists_#in~size, elem_exists_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem7;havoc elem_exists_#res;havoc elem_exists_#t~mem1, elem_exists_#t~post0, elem_exists_~set.base, elem_exists_~set.offset, elem_exists_~size, elem_exists_~value, elem_exists_~i~0;elem_exists_~set.base, elem_exists_~set.offset := elem_exists_#in~set.base, elem_exists_#in~set.offset;elem_exists_~size := elem_exists_#in~size;elem_exists_~value := elem_exists_#in~value;havoc elem_exists_~i~0;elem_exists_~i~0 := 0; 584#L9-4 [2018-11-18 11:53:13,432 INFO L796 eck$LassoCheckResult]: Loop: 584#L9-4 assume true; 585#L9-1 assume !!(elem_exists_~i~0 < elem_exists_~size);call elem_exists_#t~mem1 := read~int(elem_exists_~set.base, elem_exists_~set.offset + 4 * elem_exists_~i~0, 4); 602#L10 assume !(elem_exists_#t~mem1 == elem_exists_~value);havoc elem_exists_#t~mem1; 612#L9-3 elem_exists_#t~post0 := elem_exists_~i~0;elem_exists_~i~0 := 1 + elem_exists_#t~post0;havoc elem_exists_#t~post0; 584#L9-4 [2018-11-18 11:53:13,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1805916742, now seen corresponding path program 1 times [2018-11-18 11:53:13,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:13,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:13,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2529416, now seen corresponding path program 1 times [2018-11-18 11:53:13,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:13,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:13,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1811548237, now seen corresponding path program 1 times [2018-11-18 11:53:13,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:13,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:13,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:53:13,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:53:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:53:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:53:13,524 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-18 11:53:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:53:13,550 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2018-11-18 11:53:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:53:13,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 126 transitions. [2018-11-18 11:53:13,551 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 36 [2018-11-18 11:53:13,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 126 transitions. [2018-11-18 11:53:13,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-18 11:53:13,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-18 11:53:13,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 126 transitions. [2018-11-18 11:53:13,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:53:13,553 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 126 transitions. [2018-11-18 11:53:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 126 transitions. [2018-11-18 11:53:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2018-11-18 11:53:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 11:53:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2018-11-18 11:53:13,555 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 85 transitions. [2018-11-18 11:53:13,555 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 85 transitions. [2018-11-18 11:53:13,555 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:53:13,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 85 transitions. [2018-11-18 11:53:13,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-18 11:53:13,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:53:13,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:53:13,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:53:13,556 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:53:13,556 INFO L794 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~mem4, main_#t~mem5, main_#t~post3, main_#t~post2, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~ret10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~post11, main_#t~post6, main_#t~mem17, main_#t~mem18, main_#t~post16, main_#t~post15, main_~n~0, main_~#set~0.base, main_~#set~0.offset, main_~x~0, main_~y~0, main_~#values~0.base, main_~#values~0.offset, main_~v~0;main_~n~0 := 0;call main_~#set~0.base, main_~#set~0.offset := #Ultimate.alloc(400000);havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0; 800#L19-4 assume true; 814#L19-1 assume !(main_~x~0 < main_~n~0); 818#L19-5 call main_~#values~0.base, main_~#values~0.offset := #Ultimate.alloc(400000);havoc main_~v~0;main_~v~0 := 0; 822#L26-4 assume true; 824#L26-1 assume !!(main_~v~0 < 100000);call main_#t~mem7 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);assume { :begin_inline_elem_exists } true;elem_exists_#in~set.base, elem_exists_#in~set.offset, elem_exists_#in~size, elem_exists_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem7;havoc elem_exists_#res;havoc elem_exists_#t~mem1, elem_exists_#t~post0, elem_exists_~set.base, elem_exists_~set.offset, elem_exists_~size, elem_exists_~value, elem_exists_~i~0;elem_exists_~set.base, elem_exists_~set.offset := elem_exists_#in~set.base, elem_exists_#in~set.offset;elem_exists_~size := elem_exists_#in~size;elem_exists_~value := elem_exists_#in~value;havoc elem_exists_~i~0;elem_exists_~i~0 := 0; 770#L9-4 assume true; 771#L9-1 assume !(elem_exists_~i~0 < elem_exists_~size); 793#L9-5 elem_exists_#res := 0; 808#L12 main_#t~ret8 := elem_exists_#res;assume { :end_inline_elem_exists } true; 778#L27 assume 0 != main_#t~ret8;havoc main_#t~mem7;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#values~0.base, main_~#values~0.offset + 4 * main_~v~0, 4);assume { :begin_inline_insert } true;insert_#in~set.base, insert_#in~set.offset, insert_#in~size, insert_#in~value := main_~#set~0.base, main_~#set~0.offset, main_~n~0, main_#t~mem9;havoc insert_#res;havoc insert_~set.base, insert_~set.offset, insert_~size, insert_~value;insert_~set.base, insert_~set.offset := insert_#in~set.base, insert_#in~set.offset;insert_~size := insert_#in~size;insert_~value := insert_#in~value;call write~int(insert_~value, insert_~set.base, insert_~set.offset + 4 * insert_~size, 4);insert_#res := 1 + insert_~size; 774#L5 main_#t~ret10 := insert_#res;assume { :end_inline_insert } true;main_~n~0 := main_#t~ret10;havoc main_#t~mem9;havoc main_#t~ret10; 775#L27-2 main_~x~0 := 0; 812#L30-4 [2018-11-18 11:53:13,556 INFO L796 eck$LassoCheckResult]: Loop: 812#L30-4 assume true; 815#L30-1 assume !!(main_~x~0 < main_~n~0);main_~y~0 := 1 + main_~x~0; 781#L31-4 assume true; 782#L31-1 assume !(main_~y~0 < main_~n~0); 796#L30-3 main_#t~post11 := main_~x~0;main_~x~0 := 1 + main_#t~post11;havoc main_#t~post11; 812#L30-4 [2018-11-18 11:53:13,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:13,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1517988354, now seen corresponding path program 1 times [2018-11-18 11:53:13,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:13,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:13,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:13,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:53:13,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:53:13,584 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:53:13,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash 107994471, now seen corresponding path program 1 times [2018-11-18 11:53:13,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:53:13,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:53:13,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:53:13,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:53:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:53:13,605 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:53:13,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:53:13,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:53:13,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:53:13,605 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:53:13,605 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:13,605 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:53:13,605 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:53:13,605 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration5_Loop [2018-11-18 11:53:13,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:53:13,606 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:53:13,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:53:13,631 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:13,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:53:13,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:53:13,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:53:13,639 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post11=0} Honda state: {ULTIMATE.start_main_#t~post11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:13,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:53:13,667 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59affd2a-11fe-44e7-8269-5f490645b0cf/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:13,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:53:13,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:53:13,930 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:53:13,931 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:53:13,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:53:13,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:53:13,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:53:13,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:53:13,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:53:13,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:53:13,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:53:13,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_true-unreach-call_ground_true-termination.i_Iteration5_Loop [2018-11-18 11:53:13,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:53:13,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:53:13,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:53:13,965 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:53:13,965 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:53:13,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:53:13,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:53:13,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:53:13,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:53:13,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:53:13,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:53:13,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:53:13,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:53:13,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:53:13,972 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:53:13,974 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:53:13,974 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:53:13,974 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:53:13,974 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:53:13,974 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:53:13,974 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-18 11:53:13,975 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:53:14,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:53:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:14,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:53:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:53:14,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:53:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:53:14,073 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:53:14,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 85 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-18 11:53:14,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 85 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 197 states and 235 transitions. Complement of second has 7 states. [2018-11-18 11:53:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:53:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:53:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2018-11-18 11:53:14,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-18 11:53:14,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:14,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-18 11:53:14,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:14,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 39 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 11:53:14,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:53:14,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 235 transitions. [2018-11-18 11:53:14,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-11-18 11:53:14,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 151 states and 182 transitions. [2018-11-18 11:53:14,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-18 11:53:14,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-18 11:53:14,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 182 transitions. [2018-11-18 11:53:14,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:53:14,110 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 182 transitions. [2018-11-18 11:53:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 182 transitions. [2018-11-18 11:53:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 110. [2018-11-18 11:53:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 11:53:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2018-11-18 11:53:14,115 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 131 transitions. [2018-11-18 11:53:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:53:14,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:53:14,115 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 4 states. [2018-11-18 11:53:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:53:14,139 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-18 11:53:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:53:14,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 35 transitions. [2018-11-18 11:53:14,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:53:14,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-18 11:53:14,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:53:14,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:53:14,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:53:14,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:53:14,140 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:53:14,140 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:53:14,140 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:53:14,140 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:53:14,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:53:14,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:53:14,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:53:14,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:53:14 BoogieIcfgContainer [2018-11-18 11:53:14,144 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:53:14,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:53:14,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:53:14,145 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:53:14,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:53:11" (3/4) ... [2018-11-18 11:53:14,147 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:53:14,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:53:14,148 INFO L168 Benchmark]: Toolchain (without parser) took 2743.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.8 MB in the beginning and 1.0 GB in the end (delta: -88.8 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:53:14,149 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:53:14,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.99 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:53:14,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:53:14,150 INFO L168 Benchmark]: Boogie Preprocessor took 19.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:53:14,150 INFO L168 Benchmark]: RCFGBuilder took 247.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:53:14,150 INFO L168 Benchmark]: BuchiAutomizer took 2243.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:53:14,151 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:53:14,153 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.99 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 247.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2243.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + n and consists of 4 locations. One deterministic module has affine ranking function -2 * v + 199999 and consists of 4 locations. One deterministic module has affine ranking function n + -1 * x and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 89 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 74 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 240 SDtfs, 198 SDslu, 213 SDs, 0 SdLazy, 99 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf95 lsp94 ukn93 mio100 lsp89 div100 bol100 ite100 ukn100 eq163 hnf93 smp85 dnf100 smp100 tf106 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...