./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/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 f42aa215a16d5e0efb670a585ba0238849a32fc4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:17:54,052 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:17:54,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:17:54,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:17:54,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:17:54,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:17:54,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:17:54,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:17:54,064 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:17:54,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:17:54,065 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:17:54,065 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:17:54,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:17:54,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:17:54,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:17:54,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:17:54,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:17:54,070 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:17:54,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:17:54,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:17:54,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:17:54,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:17:54,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:17:54,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:17:54,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:17:54,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:17:54,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:17:54,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:17:54,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:17:54,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:17:54,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:17:54,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:17:54,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:17:54,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:17:54,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:17:54,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:17:54,081 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:17:54,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:17:54,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:17:54,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:17:54,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:17:54,093 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:17:54,093 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:17:54,093 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:17:54,093 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:17:54,094 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:17:54,094 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:17:54,094 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:17:54,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:17:54,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:17:54,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:17:54,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:17:54,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:17:54,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:17:54,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:17:54,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:17:54,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:17:54,095 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:17:54,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:17:54,096 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:17:54,096 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:17:54,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:17:54,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:17:54,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:17:54,096 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:17:54,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:17:54,097 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:17:54,097 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:17:54,097 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:17:54,098 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_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/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 -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2018-11-28 13:17:54,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:17:54,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:17:54,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:17:54,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:17:54,130 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:17:54,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:17:54,167 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/data/047ef9694/2fce871823cb4b49b8d4a159001adab5/FLAG5f2fcac4e [2018-11-28 13:17:54,589 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:17:54,589 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:17:54,596 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/data/047ef9694/2fce871823cb4b49b8d4a159001adab5/FLAG5f2fcac4e [2018-11-28 13:17:54,606 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/bin-2019/uautomizer/data/047ef9694/2fce871823cb4b49b8d4a159001adab5 [2018-11-28 13:17:54,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:17:54,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:17:54,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:54,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:17:54,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:17:54,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6c94b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54, skipping insertion in model container [2018-11-28 13:17:54,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:17:54,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:17:54,814 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:54,865 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:17:54,889 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:54,921 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:17:54,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54 WrapperNode [2018-11-28 13:17:54,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:54,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:54,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:17:54,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:17:54,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:54,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:17:54,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:17:54,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:17:54,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... [2018-11-28 13:17:54,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:17:54,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:17:54,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:17:54,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:17:54,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a4caa7f-dacf-45d1-94ac-5ef40e60837d/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-28 13:17:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:17:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:17:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:17:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:17:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:17:55,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:17:55,194 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:17:55,195 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 13:17:55,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:55 BoogieIcfgContainer [2018-11-28 13:17:55,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:17:55,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:17:55,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:17:55,199 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:17:55,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:17:55,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:17:54" (1/3) ... [2018-11-28 13:17:55,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a603963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:17:55, skipping insertion in model container [2018-11-28 13:17:55,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:17:55,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:54" (2/3) ... [2018-11-28 13:17:55,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a603963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:17:55, skipping insertion in model container [2018-11-28 13:17:55,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:17:55,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:55" (3/3) ... [2018-11-28 13:17:55,204 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:17:55,241 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:17:55,241 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:17:55,241 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:17:55,242 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:17:55,242 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:17:55,242 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:17:55,242 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:17:55,242 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:17:55,242 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:17:55,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 13:17:55,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:17:55,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:55,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:55,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:17:55,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:17:55,272 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:17:55,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 13:17:55,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:17:55,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:55,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:55,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:17:55,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:17:55,278 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L558-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 11#L545-3true [2018-11-28 13:17:55,279 INFO L796 eck$LassoCheckResult]: Loop: 11#L545-3true assume !!(test_fun_~i~0 < test_fun_~N); 8#L546-3true assume !true; 3#L550-2true assume !true; 9#L545-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L545-3true [2018-11-28 13:17:55,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 13:17:55,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:55,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:55,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:55,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-11-28 13:17:55,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:55,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:55,389 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-28 13:17:55,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:55,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:17:55,393 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:17:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:17:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:17:55,405 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-28 13:17:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:55,410 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-28 13:17:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:17:55,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 13:17:55,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:17:55,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-28 13:17:55,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:17:55,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:17:55,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 13:17:55,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:17:55,417 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 13:17:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 13:17:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 13:17:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 13:17:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 13:17:55,435 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 13:17:55,435 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 13:17:55,435 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:17:55,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 13:17:55,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 13:17:55,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:55,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:55,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:17:55,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:17:55,436 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 41#L545-3 [2018-11-28 13:17:55,436 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 42#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 38#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 41#L545-3 [2018-11-28 13:17:55,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 13:17:55,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-11-28 13:17:55,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:55,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:17:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-11-28 13:17:55,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:55,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:55,702 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:55,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:55,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:55,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:55,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:55,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:55,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:55,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:55,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-28 13:17:55,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:55,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:55,723 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-28 13:17:55,733 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-28 13:17:55,735 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-28 13:17:55,737 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-28 13:17:55,747 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-28 13:17:55,749 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-28 13:17:55,751 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-28 13:17:55,753 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-28 13:17:55,756 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-28 13:17:55,759 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-28 13:17:55,761 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-28 13:17:55,764 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-28 13:17:55,766 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-28 13:17:55,768 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-28 13:17:55,769 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-28 13:17:55,899 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-28 13:17:56,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:56,136 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:56,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:17:56,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,143 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-28 13:17:56,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,145 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-28 13:17:56,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,148 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-28 13:17:56,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,154 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-28 13:17:56,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,157 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-28 13:17:56,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,160 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-28 13:17:56,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,166 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-28 13:17:56,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,168 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-28 13:17:56,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,171 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-28 13:17:56,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,177 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-28 13:17:56,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,181 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-28 13:17:56,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,183 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-28 13:17:56,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,188 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-28 13:17:56,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,193 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-28 13:17:56,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,196 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-28 13:17:56,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,208 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-28 13:17:56,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,254 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:56,280 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:17:56,280 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:17:56,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:56,284 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:17:56,284 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:56,285 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-28 13:17:56,292 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 13:17:56,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:56,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:56,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:56,341 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-28 13:17:56,344 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-28 13:17:56,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 13:17:56,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2018-11-28 13:17:56,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:17:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-28 13:17:56,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 13:17:56,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:56,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 13:17:56,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:56,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 13:17:56,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:56,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-11-28 13:17:56,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:17:56,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2018-11-28 13:17:56,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:17:56,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:17:56,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 13:17:56,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:56,378 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 13:17:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 13:17:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 13:17:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 13:17:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-28 13:17:56,379 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 13:17:56,379 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 13:17:56,380 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:17:56,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-28 13:17:56,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:17:56,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:56,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:56,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:17:56,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:17:56,381 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 126#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 132#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 133#L546-3 [2018-11-28 13:17:56,381 INFO L796 eck$LassoCheckResult]: Loop: 133#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 137#L546-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 133#L546-3 [2018-11-28 13:17:56,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 13:17:56,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:56,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:56,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:56,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-28 13:17:56,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:56,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:56,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 13:17:56,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:56,577 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:56,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:56,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:56,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:56,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:56,577 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:56,577 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:56,577 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:56,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-28 13:17:56,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:56,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:56,580 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-28 13:17:56,581 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-28 13:17:56,582 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-28 13:17:56,583 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-28 13:17:56,584 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-28 13:17:56,586 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-28 13:17:56,587 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-28 13:17:56,589 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-28 13:17:56,590 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-28 13:17:56,591 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-28 13:17:56,593 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-28 13:17:56,595 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-28 13:17:56,596 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-28 13:17:56,597 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-28 13:17:56,599 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-28 13:17:56,661 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-28 13:17:56,819 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:56,819 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:56,820 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-28 13:17:56,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,822 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-28 13:17:56,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,824 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-28 13:17:56,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,826 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-28 13:17:56,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,828 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-28 13:17:56,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,832 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-28 13:17:56,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,834 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-28 13:17:56,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,836 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-28 13:17:56,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,839 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-28 13:17:56,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,841 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-28 13:17:56,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,844 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-28 13:17:56,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,848 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-28 13:17:56,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,850 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-28 13:17:56,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,852 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-28 13:17:56,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,854 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-28 13:17:56,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,877 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-28 13:17:56,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,882 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-28 13:17:56,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:56,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,896 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-28 13:17:56,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,896 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:17:56,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,898 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:17:56,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:56,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:56,904 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-28 13:17:56,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:56,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:56,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:56,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:56,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:56,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:56,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:56,906 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:56,907 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:17:56,907 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:17:56,908 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:56,908 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:17:56,908 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:56,908 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-28 13:17:56,925 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 13:17:56,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:17:56,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:56,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:56,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:56,969 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-28 13:17:56,969 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-28 13:17:56,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 13:17:57,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2018-11-28 13:17:57,005 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-28 13:17:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 13:17:57,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 13:17:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 13:17:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 13:17:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:57,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-28 13:17:57,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:17:57,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-11-28 13:17:57,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 13:17:57,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 13:17:57,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-11-28 13:17:57,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:57,008 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-11-28 13:17:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-11-28 13:17:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-28 13:17:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 13:17:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-28 13:17:57,010 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 13:17:57,010 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 13:17:57,010 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:17:57,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-28 13:17:57,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:17:57,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:57,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:57,011 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:57,011 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:17:57,011 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 234#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 241#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 235#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 236#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 243#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 229#L550-2 [2018-11-28 13:17:57,012 INFO L796 eck$LassoCheckResult]: Loop: 229#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 230#L550 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 229#L550-2 [2018-11-28 13:17:57,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-28 13:17:57,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-11-28 13:17:57,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-11-28 13:17:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,203 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:57,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:57,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:57,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:57,204 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:57,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:57,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:57,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:57,204 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-28 13:17:57,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:57,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:57,206 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-28 13:17:57,208 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-28 13:17:57,211 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-28 13:17:57,212 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-28 13:17:57,213 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-28 13:17:57,215 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-28 13:17:57,299 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-28 13:17:57,302 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-28 13:17:57,307 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-28 13:17:57,309 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-28 13:17:57,311 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-28 13:17:57,312 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-28 13:17:57,314 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-28 13:17:57,315 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-28 13:17:57,316 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-28 13:17:57,317 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-28 13:17:57,475 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:57,475 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:57,475 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-28 13:17:57,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,477 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-28 13:17:57,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,480 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-28 13:17:57,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,482 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-28 13:17:57,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,484 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-28 13:17:57,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,485 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-28 13:17:57,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:57,496 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:17:57,496 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:17:57,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:57,497 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:17:57,498 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:57,498 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-28 13:17:57,520 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 13:17:57,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:17:57,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:57,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:57,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:57,548 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-28 13:17:57,548 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-28 13:17:57,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-28 13:17:57,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-11-28 13:17:57,564 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-28 13:17:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 13:17:57,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 13:17:57,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:57,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 13:17:57,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:57,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 13:17:57,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:57,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-11-28 13:17:57,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:17:57,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-11-28 13:17:57,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:17:57,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 13:17:57,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-28 13:17:57,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:57,567 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-28 13:17:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-28 13:17:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 13:17:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 13:17:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-28 13:17:57,569 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 13:17:57,569 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 13:17:57,569 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:17:57,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-28 13:17:57,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:17:57,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:57,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:57,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:57,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:17:57,570 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 354#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 360#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 355#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 365#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 366#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 357#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 359#L546-3 [2018-11-28 13:17:57,570 INFO L796 eck$LassoCheckResult]: Loop: 359#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 362#L546-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 359#L546-3 [2018-11-28 13:17:57,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-11-28 13:17:57,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:57,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-28 13:17:57,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:17:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-11-28 13:17:57,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:57,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:17:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:57,729 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:57,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:57,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:57,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:57,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:57,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:57,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:57,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:57,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-28 13:17:57,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:57,730 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:57,732 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-28 13:17:57,734 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-28 13:17:57,735 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-28 13:17:57,757 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-28 13:17:57,759 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-28 13:17:57,760 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-28 13:17:57,762 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-28 13:17:57,765 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-28 13:17:57,766 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-28 13:17:57,767 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-28 13:17:57,843 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-28 13:17:57,845 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-28 13:17:57,846 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-28 13:17:57,847 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-28 13:17:57,848 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-28 13:17:57,850 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-28 13:17:57,981 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:57,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:57,981 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-28 13:17:57,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,983 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-28 13:17:57,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,984 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-28 13:17:57,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,986 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-28 13:17:57,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,987 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-28 13:17:57,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,987 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-28 13:17:57,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,988 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-28 13:17:57,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,990 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-28 13:17:57,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,992 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-28 13:17:57,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:57,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:57,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:57,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,993 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-28 13:17:57,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:57,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:57,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:57,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:57,998 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-28 13:17:57,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:57,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:57,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:57,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:58,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:58,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:58,003 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-28 13:17:58,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:58,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:58,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:58,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:58,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:58,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:58,004 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:58,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:17:58,005 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:17:58,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:58,006 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 13:17:58,006 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:58,006 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-11-28 13:17:58,029 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 13:17:58,030 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:17:58,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,074 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-28 13:17:58,074 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-28 13:17:58,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 13:17:58,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-28 13:17:58,093 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-28 13:17:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 13:17:58,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 13:17:58,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,094 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:17:58,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,127 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-28 13:17:58,127 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:17:58,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 13:17:58,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-28 13:17:58,145 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-28 13:17:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 13:17:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 13:17:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,146 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:17:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,184 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-28 13:17:58,184 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:17:58,184 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 13:17:58,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2018-11-28 13:17:58,234 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-28 13:17:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 13:17:58,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 13:17:58,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 13:17:58,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 13:17:58,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-11-28 13:17:58,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:17:58,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-11-28 13:17:58,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:17:58,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 13:17:58,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-11-28 13:17:58,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:17:58,238 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-28 13:17:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-11-28 13:17:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-28 13:17:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 13:17:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-28 13:17:58,240 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 13:17:58,241 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 13:17:58,241 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:17:58,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-28 13:17:58,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:17:58,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:17:58,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:17:58,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:58,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:17:58,242 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 653#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 655#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 656#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 664#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 668#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 657#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 659#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 648#L550-2 [2018-11-28 13:17:58,242 INFO L796 eck$LassoCheckResult]: Loop: 648#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 649#L550 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 648#L550-2 [2018-11-28 13:17:58,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-11-28 13:17:58,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:58,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:58,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:58,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-11-28 13:17:58,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:58,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:58,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:17:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-11-28 13:17:58,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:58,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:17:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:58,459 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-11-28 13:17:58,495 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:17:58,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:17:58,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:17:58,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:17:58,495 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:17:58,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:17:58,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:17:58,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:17:58,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-28 13:17:58,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:17:58,496 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:17:58,498 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-28 13:17:58,499 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-28 13:17:58,500 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-28 13:17:58,501 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-28 13:17:58,645 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-28 13:17:58,646 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-28 13:17:58,647 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-28 13:17:58,649 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-28 13:17:58,651 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-28 13:17:58,652 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-28 13:17:58,653 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-28 13:17:58,654 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-28 13:17:58,656 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-28 13:17:58,657 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-28 13:17:58,659 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-28 13:17:58,661 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-28 13:17:58,823 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:17:58,823 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:17:58,823 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-28 13:17:58,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:58,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:58,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:58,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:58,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:58,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:58,826 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-28 13:17:58,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:58,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:58,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:58,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:58,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:58,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:58,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:58,827 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-28 13:17:58,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:58,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:17:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:58,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:58,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:17:58,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:17:58,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:58,828 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-28 13:17:58,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:58,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:58,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:58,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:58,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:58,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:17:58,844 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-28 13:17:58,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:17:58,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:17:58,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:17:58,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:17:58,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:17:58,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:17:58,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:17:58,859 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:17:58,859 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:17:58,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:17:58,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:17:58,860 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:17:58,860 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 Supporting invariants [] [2018-11-28 13:17:58,871 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 13:17:58,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:17:58,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,902 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-28 13:17:58,902 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-28 13:17:58,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 13:17:58,915 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-28 13:17:58,916 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-28 13:17:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 13:17:58,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 13:17:58,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,916 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:17:58,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,944 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-28 13:17:58,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:17:58,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 13:17:58,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-28 13:17:58,953 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-28 13:17:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 13:17:58,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 13:17:58,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,954 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:17:58,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:58,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:58,982 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-28 13:17:58,982 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 13:17:58,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 13:17:58,993 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2018-11-28 13:17:58,993 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-28 13:17:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:17:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 13:17:58,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 13:17:58,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 13:17:58,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-28 13:17:58,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:17:58,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-28 13:17:58,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:17:58,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-28 13:17:58,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:17:58,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:17:58,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:17:58,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:17:58,996 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:17:58,996 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:17:58,996 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:17:58,996 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:17:58,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:17:58,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:17:58,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:17:59,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:17:59 BoogieIcfgContainer [2018-11-28 13:17:59,001 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:17:59,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:17:59,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:17:59,002 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:17:59,002 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:55" (3/4) ... [2018-11-28 13:17:59,005 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:17:59,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:17:59,005 INFO L168 Benchmark]: Toolchain (without parser) took 4397.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 955.3 MB in the beginning and 1.2 GB in the end (delta: -222.0 MB). Peak memory consumption was 121.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:59,006 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:17:59,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:59,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.22 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-28 13:17:59,007 INFO L168 Benchmark]: Boogie Preprocessor took 16.36 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-28 13:17:59,007 INFO L168 Benchmark]: RCFGBuilder took 227.37 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:59,008 INFO L168 Benchmark]: BuchiAutomizer took 3805.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.2 MB). Peak memory consumption was 131.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:59,008 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:17:59,011 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.36 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 227.37 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3805.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.2 MB). Peak memory consumption was 131.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf99 lsp89 ukn78 mio100 lsp55 div100 bol100 ite100 ukn100 eq175 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...