./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 987435cc8130e848f1b087d0b65ab8d71c3dfa3c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:51:53,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:51:53,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:51:53,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:51:53,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:51:53,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:51:53,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:51:53,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:51:53,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:51:53,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:51:53,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:51:53,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:51:53,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:51:53,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:51:53,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:51:53,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:51:53,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:51:53,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:51:53,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:51:53,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:51:53,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:51:53,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:51:53,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:51:53,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:51:53,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:51:53,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:51:53,936 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:51:53,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:51:53,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:51:53,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:51:53,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:51:53,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:51:53,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:51:53,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:51:53,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:51:53,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:51:53,940 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:51:53,951 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:51:53,951 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:51:53,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:51:53,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:51:53,953 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:51:53,953 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:51:53,953 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:51:53,953 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:51:53,953 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:51:53,954 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:51:53,954 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:51:53,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:51:53,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:51:53,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:51:53,954 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:51:53,954 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:51:53,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:51:53,955 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:51:53,955 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:51:53,955 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:51:53,955 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:51:53,955 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:51:53,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:51:53,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:51:53,956 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:51:53,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:51:53,956 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:51:53,956 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:51:53,957 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:51:53,957 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_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 987435cc8130e848f1b087d0b65ab8d71c3dfa3c [2018-11-18 08:51:53,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:51:53,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:51:53,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:51:53,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:51:53,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:51:53,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-11-18 08:51:54,037 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/data/2adfd648b/a01e010070c64896b8b2d37e5c0531fd/FLAGe67f2e102 [2018-11-18 08:51:54,402 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:51:54,403 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/sv-benchmarks/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-11-18 08:51:54,411 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/data/2adfd648b/a01e010070c64896b8b2d37e5c0531fd/FLAGe67f2e102 [2018-11-18 08:51:54,795 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/data/2adfd648b/a01e010070c64896b8b2d37e5c0531fd [2018-11-18 08:51:54,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:51:54,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:51:54,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:51:54,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:51:54,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:51:54,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:54" (1/1) ... [2018-11-18 08:51:54,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f589629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:54, skipping insertion in model container [2018-11-18 08:51:54,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:54" (1/1) ... [2018-11-18 08:51:54,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:51:54,839 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:51:55,025 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:51:55,033 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:51:55,062 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:51:55,133 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:51:55,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55 WrapperNode [2018-11-18 08:51:55,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:51:55,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:51:55,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:51:55,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:51:55,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:51:55,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:51:55,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:51:55,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:51:55,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... [2018-11-18 08:51:55,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:51:55,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:51:55,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:51:55,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:51:55,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:51:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:51:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:51:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:51:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:51:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:51:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:51:55,345 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:51:55,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:55 BoogieIcfgContainer [2018-11-18 08:51:55,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:51:55,346 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:51:55,346 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:51:55,348 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:51:55,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:51:55,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:51:54" (1/3) ... [2018-11-18 08:51:55,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dd086eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:51:55, skipping insertion in model container [2018-11-18 08:51:55,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:51:55,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:55" (2/3) ... [2018-11-18 08:51:55,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dd086eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:51:55, skipping insertion in model container [2018-11-18 08:51:55,350 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:51:55,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:55" (3/3) ... [2018-11-18 08:51:55,351 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-termination.c.i [2018-11-18 08:51:55,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:51:55,389 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:51:55,389 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:51:55,390 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:51:55,390 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:51:55,390 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:51:55,390 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:51:55,390 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:51:55,390 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:51:55,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 08:51:55,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:51:55,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:55,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:55,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:51:55,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:51:55,423 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:51:55,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-18 08:51:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:51:55,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:55,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:55,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:51:55,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:51:55,432 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 8#L567true assume !(main_~array_size~0 < 1); 11#L567-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 5#L551-4true [2018-11-18 08:51:55,432 INFO L796 eck$LassoCheckResult]: Loop: 5#L551-4true assume true; 18#L551-1true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 15#L553true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 9#L558-3true assume !true; 13#L558-4true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 3#L551-3true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 5#L551-4true [2018-11-18 08:51:55,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 08:51:55,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1276972412, now seen corresponding path program 1 times [2018-11-18 08:51:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:55,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:51:55,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:51:55,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:51:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:51:55,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:51:55,552 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-18 08:51:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:51:55,556 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-18 08:51:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:51:55,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-18 08:51:55,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:51:55,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2018-11-18 08:51:55,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 08:51:55,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 08:51:55,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-18 08:51:55,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:51:55,561 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 08:51:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-18 08:51:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 08:51:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 08:51:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-18 08:51:55,581 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 08:51:55,582 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-18 08:51:55,582 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:51:55,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-18 08:51:55,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:51:55,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:55,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:55,583 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:51:55,583 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:51:55,583 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 49#L567 assume !(main_~array_size~0 < 1); 50#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 43#L551-4 [2018-11-18 08:51:55,583 INFO L796 eck$LassoCheckResult]: Loop: 43#L551-4 assume true; 46#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 53#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 48#L558-3 assume true; 44#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 45#L558-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 47#L558-4 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 42#L551-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 43#L551-4 [2018-11-18 08:51:55,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 08:51:55,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:55,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:55,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:55,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1198744842, now seen corresponding path program 1 times [2018-11-18 08:51:55,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:51:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash 553555674, now seen corresponding path program 1 times [2018-11-18 08:51:55,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:55,835 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:51:55,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:51:55,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:51:55,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:51:55,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:51:55,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:51:55,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:51:55,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:51:55,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 08:51:55,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:51:55,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:51:55,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:56,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:51:56,206 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:51:56,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:56,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:56,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:56,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:56,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:56,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:56,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,261 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:51:56,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:51:56,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:56,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:56,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:56,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:56,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:56,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:56,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:56,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:56,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:56,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:56,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:51:56,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:51:56,346 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:51:56,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:51:56,350 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:51:56,350 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:51:56,351 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-18 08:51:56,359 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 08:51:56,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:56,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:56,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:56,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:51:56,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 08:51:56,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 30 transitions. Complement of second has 6 states. [2018-11-18 08:51:56,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:51:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:51:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-18 08:51:56,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-18 08:51:56,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:56,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-18 08:51:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:56,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-18 08:51:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:56,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2018-11-18 08:51:56,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:56,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 28 transitions. [2018-11-18 08:51:56,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:51:56,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:51:56,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2018-11-18 08:51:56,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:51:56,457 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 08:51:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2018-11-18 08:51:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 08:51:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 08:51:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-11-18 08:51:56,458 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 08:51:56,458 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-11-18 08:51:56,459 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:51:56,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2018-11-18 08:51:56,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:56,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:56,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:56,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:51:56,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:51:56,460 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 160#L567 assume !(main_~array_size~0 < 1); 161#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 154#L551-4 assume true; 156#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 165#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 157#L558-3 [2018-11-18 08:51:56,460 INFO L796 eck$LassoCheckResult]: Loop: 157#L558-3 assume true; 150#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 151#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 157#L558-3 [2018-11-18 08:51:56,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814475, now seen corresponding path program 1 times [2018-11-18 08:51:56,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:56,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-18 08:51:56,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:56,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:56,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,478 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:56,479 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:56,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:56,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2015064198, now seen corresponding path program 1 times [2018-11-18 08:51:56,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:56,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,534 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:56,534 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:56,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:56,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:56,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 08:51:56,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-18 08:51:56,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:51:56,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:51:56,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:51:56,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-18 08:51:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:51:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:51:56,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:51:56,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:51:56,717 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 08:51:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:51:56,748 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-18 08:51:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:51:56,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-18 08:51:56,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:56,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 31 transitions. [2018-11-18 08:51:56,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 08:51:56,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:51:56,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-18 08:51:56,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:51:56,751 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-18 08:51:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-18 08:51:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-18 08:51:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 08:51:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-18 08:51:56,753 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 08:51:56,753 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-18 08:51:56,753 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:51:56,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-18 08:51:56,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:56,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:56,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:56,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:51:56,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:51:56,754 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 246#L567 assume !(main_~array_size~0 < 1); 247#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 240#L551-4 assume true; 242#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 252#L553 assume !(0 == test_fun_#t~mem3);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); 249#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 243#L558-3 [2018-11-18 08:51:56,755 INFO L796 eck$LassoCheckResult]: Loop: 243#L558-3 assume true; 236#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 237#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 243#L558-3 [2018-11-18 08:51:56,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 176673967, now seen corresponding path program 1 times [2018-11-18 08:51:56,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 2 times [2018-11-18 08:51:56,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:56,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,771 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:56,771 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:56,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:56,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:51:56,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 08:51:56,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 08:51:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1959245142, now seen corresponding path program 1 times [2018-11-18 08:51:56,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:56,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:56,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:51:56,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:56,830 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:56,830 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:56,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:56,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,078 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:51:57,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:51:57,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:51:57,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:51:57,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:51:57,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:51:57,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:51:57,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:51:57,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 08:51:57,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:51:57,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:51:57,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:57,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:51:57,410 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:51:57,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:57,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:57,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:57,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:57,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:57,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:57,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:57,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:57,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:57,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:57,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:57,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:57,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:57,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:57,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:57,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:57,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:57,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:57,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:57,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:57,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:57,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:57,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:57,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:57,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:57,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:57,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:57,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:57,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:57,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:51:57,445 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:51:57,445 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:51:57,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:51:57,446 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:51:57,446 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:51:57,447 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-18 08:51:57,454 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 08:51:57,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:51:57,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:57,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:57,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:57,486 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:51:57,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 08:51:57,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 54 states and 68 transitions. Complement of second has 7 states. [2018-11-18 08:51:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:51:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:51:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-18 08:51:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 08:51:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 08:51:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 08:51:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:57,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2018-11-18 08:51:57,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 08:51:57,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 47 states and 59 transitions. [2018-11-18 08:51:57,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 08:51:57,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 08:51:57,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2018-11-18 08:51:57,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:51:57,506 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-18 08:51:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2018-11-18 08:51:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-18 08:51:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 08:51:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-18 08:51:57,509 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-18 08:51:57,509 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-18 08:51:57,509 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:51:57,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2018-11-18 08:51:57,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:57,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:57,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:57,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:51:57,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:51:57,511 INFO L794 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 394#L567 assume !(main_~array_size~0 < 1); 395#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 386#L551-4 assume true; 388#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 407#L553 assume !(0 == test_fun_#t~mem3);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); 397#L555 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 391#L558-3 [2018-11-18 08:51:57,511 INFO L796 eck$LassoCheckResult]: Loop: 391#L558-3 assume true; 382#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 383#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 391#L558-3 [2018-11-18 08:51:57,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,511 INFO L82 PathProgramCache]: Analyzing trace with hash 176673965, now seen corresponding path program 1 times [2018-11-18 08:51:57,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 3 times [2018-11-18 08:51:57,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,525 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:57,525 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:57,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:57,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:51:57,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-18 08:51:57,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 08:51:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1959185560, now seen corresponding path program 1 times [2018-11-18 08:51:57,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:51:57,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,581 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:57,581 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:57,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:57,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:57,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:57,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-18 08:51:57,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-18 08:51:57,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:51:57,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:51:57,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:51:57,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-18 08:51:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:57,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:51:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:51:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:51:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:51:57,703 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-18 08:51:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:51:57,733 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-18 08:51:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:51:57,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-18 08:51:57,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:57,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 43 states and 51 transitions. [2018-11-18 08:51:57,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 08:51:57,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:51:57,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 51 transitions. [2018-11-18 08:51:57,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:51:57,736 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-18 08:51:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 51 transitions. [2018-11-18 08:51:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-11-18 08:51:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 08:51:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-18 08:51:57,739 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 08:51:57,739 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 08:51:57,739 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:51:57,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-18 08:51:57,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:57,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:57,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:57,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:51:57,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:51:57,740 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 523#L567 assume !(main_~array_size~0 < 1); 524#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 518#L551-4 assume true; 519#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 532#L553 assume !(0 == test_fun_#t~mem3);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); 534#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 522#L558-3 assume true; 516#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L558-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 540#L558-4 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 539#L551-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 537#L551-4 assume true; 536#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 531#L553 assume !(0 == test_fun_#t~mem3);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); 526#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 520#L558-3 [2018-11-18 08:51:57,741 INFO L796 eck$LassoCheckResult]: Loop: 520#L558-3 assume true; 514#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 515#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 520#L558-3 [2018-11-18 08:51:57,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -220718592, now seen corresponding path program 1 times [2018-11-18 08:51:57,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:57,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:51:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:51:57,789 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:51:57,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 4 times [2018-11-18 08:51:57,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,792 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:57,792 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:57,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:57,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 08:51:57,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 08:51:57,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 08:51:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:51:57,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:51:57,844 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 08:51:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:51:57,881 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-18 08:51:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:51:57,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2018-11-18 08:51:57,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:57,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 52 transitions. [2018-11-18 08:51:57,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 08:51:57,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 08:51:57,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2018-11-18 08:51:57,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:51:57,884 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-18 08:51:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2018-11-18 08:51:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-11-18 08:51:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 08:51:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-18 08:51:57,888 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-18 08:51:57,888 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-18 08:51:57,888 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:51:57,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2018-11-18 08:51:57,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:51:57,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:51:57,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:51:57,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:51:57,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:51:57,892 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 614#L567 assume !(main_~array_size~0 < 1); 615#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;assume { :begin_inline_test_fun } true;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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 610#L551-4 assume true; 611#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 635#L553 assume !(0 == test_fun_#t~mem3);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); 636#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 616#L558-3 assume true; 608#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 609#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 613#L558-3 assume true; 639#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 631#L558-1 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 621#L558-4 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 622#L551-3 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 629#L551-4 assume true; 627#L551-1 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 624#L553 assume !(0 == test_fun_#t~mem3);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); 617#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 612#L558-3 [2018-11-18 08:51:57,892 INFO L796 eck$LassoCheckResult]: Loop: 612#L558-3 assume true; 606#L558 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 607#L558-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post8;havoc test_fun_#t~mem7; 612#L558-3 [2018-11-18 08:51:57,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1046283577, now seen corresponding path program 1 times [2018-11-18 08:51:57,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:51:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,895 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:57,896 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:57,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 5 times [2018-11-18 08:51:57,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:51:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,951 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:57,951 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:57,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:57,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 08:51:57,963 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 08:51:57,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 08:51:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:57,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1256407180, now seen corresponding path program 2 times [2018-11-18 08:51:57,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:51:57,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:51:57,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:51:57,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:51:57,987 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 08:51:57,987 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 08:51:57,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a33120a-f7d4-4ba2-af8e-3dffdf62fe43/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 08:51:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:51:58,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:51:58,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-18 08:51:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:51:58,274 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-11-18 08:51:58,313 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:51:58,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:51:58,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:51:58,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:51:58,314 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:51:58,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:51:58,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:51:58,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:51:58,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 08:51:58,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:51:58,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:51:58,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-18 08:51:58,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:51:58,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:51:58,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:51:58,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:58,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:58,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:58,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:58,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:58,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:58,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:58,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:58,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:58,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:58,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:58,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:58,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:58,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:58,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:58,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:58,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:58,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:58,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:58,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:58,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:58,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:51:58,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:51:58,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:51:58,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:58,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:58,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:51:58,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:51:58,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:51:58,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:51:58,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:51:58,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:51:58,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:51:58,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:51:58,631 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:51:58,634 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:51:58,634 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:51:58,635 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:51:58,635 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:51:58,636 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:51:58,636 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-18 08:51:58,661 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 08:51:58,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:51:58,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:58,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:58,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:58,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:51:58,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 08:51:58,722 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 7 states. [2018-11-18 08:51:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:51:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:51:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 08:51:58,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 08:51:58,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:58,723 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:51:58,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:58,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:58,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:58,755 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-18 08:51:58,755 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 08:51:58,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 7 states. [2018-11-18 08:51:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:51:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:51:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 08:51:58,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 08:51:58,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:58,766 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:51:58,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:51:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:58,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:51:58,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:51:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:51:58,799 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-18 08:51:58,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 08:51:58,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 54 states and 65 transitions. Complement of second has 6 states. [2018-11-18 08:51:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:51:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:51:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 08:51:58,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 08:51:58,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:58,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-18 08:51:58,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:58,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-18 08:51:58,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:51:58,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-18 08:51:58,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:51:58,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2018-11-18 08:51:58,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:51:58,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:51:58,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:51:58,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:51:58,816 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:51:58,816 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:51:58,816 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:51:58,816 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:51:58,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:51:58,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:51:58,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:51:58,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:51:58 BoogieIcfgContainer [2018-11-18 08:51:58,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:51:58,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:51:58,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:51:58,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:51:58,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:55" (3/4) ... [2018-11-18 08:51:58,825 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:51:58,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:51:58,826 INFO L168 Benchmark]: Toolchain (without parser) took 4028.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -322.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:51:58,827 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:51:58,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -225.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:58,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:58,827 INFO L168 Benchmark]: Boogie Preprocessor took 15.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:58,828 INFO L168 Benchmark]: RCFGBuilder took 167.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:58,828 INFO L168 Benchmark]: BuchiAutomizer took 3476.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -119.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:58,829 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:51:58,831 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -225.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 167.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3476.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -119.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] 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. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 143 SDtfs, 95 SDslu, 103 SDs, 0 SdLazy, 150 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax111 hnf99 lsp86 ukn69 mio100 lsp53 div100 bol100 ite100 ukn100 eq178 hnf90 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms 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...