./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc8491de7bb3fbae410adb8e5711b9887b8c9c8f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:56:44,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:56:44,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:56:44,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:56:44,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:56:44,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:56:44,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:56:44,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:56:44,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:56:44,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:56:44,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:56:44,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:56:44,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:56:44,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:56:44,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:56:44,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:56:44,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:56:44,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:56:44,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:56:44,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:56:44,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:56:44,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:56:44,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:56:44,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:56:44,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:56:44,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:56:44,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:56:44,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:56:44,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:56:44,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:56:44,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:56:44,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:56:44,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:56:44,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:56:44,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:56:44,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:56:44,698 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:56:44,715 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:56:44,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:56:44,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:56:44,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:56:44,717 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:56:44,717 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:56:44,717 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:56:44,718 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:56:44,718 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:56:44,718 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:56:44,718 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:56:44,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:56:44,718 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:56:44,719 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:56:44,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:56:44,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:56:44,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:56:44,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:56:44,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:56:44,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:56:44,721 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:56:44,722 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:56:44,722 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:56:44,722 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:56:44,722 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:56:44,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:56:44,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:56:44,723 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:56:44,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:56:44,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:56:44,723 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:56:44,724 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:56:44,725 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc8491de7bb3fbae410adb8e5711b9887b8c9c8f [2019-01-14 04:56:44,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:56:44,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:56:44,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:56:44,789 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:56:44,790 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:56:44,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:44,852 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e480f1802/e724e64185cd4717848b5593b526d630/FLAGea7667576 [2019-01-14 04:56:45,361 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:56:45,361 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:45,374 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e480f1802/e724e64185cd4717848b5593b526d630/FLAGea7667576 [2019-01-14 04:56:45,663 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e480f1802/e724e64185cd4717848b5593b526d630 [2019-01-14 04:56:45,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:56:45,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:56:45,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:45,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:56:45,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:56:45,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:45" (1/1) ... [2019-01-14 04:56:45,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d01de11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:45, skipping insertion in model container [2019-01-14 04:56:45,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:56:45" (1/1) ... [2019-01-14 04:56:45,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:56:45,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:56:46,084 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:46,103 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:56:46,242 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:56:46,296 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:56:46,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46 WrapperNode [2019-01-14 04:56:46,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:56:46,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:46,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:56:46,298 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:56:46,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:56:46,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:56:46,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:56:46,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:56:46,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... [2019-01-14 04:56:46,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:56:46,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:56:46,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:56:46,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:56:46,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:46,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:56:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:56:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:56:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:56:46,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:56:46,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:56:46,849 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:56:46,849 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:56:46,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:46 BoogieIcfgContainer [2019-01-14 04:56:46,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:56:46,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:56:46,851 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:56:46,855 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:56:46,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:46,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:56:45" (1/3) ... [2019-01-14 04:56:46,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bbce34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:46, skipping insertion in model container [2019-01-14 04:56:46,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:46,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:56:46" (2/3) ... [2019-01-14 04:56:46,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bbce34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:56:46, skipping insertion in model container [2019-01-14 04:56:46,859 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:56:46,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:46" (3/3) ... [2019-01-14 04:56:46,860 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:56:46,925 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:56:46,926 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:56:46,926 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:56:46,926 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:56:46,927 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:56:46,927 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:56:46,927 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:56:46,927 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:56:46,927 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:56:46,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 04:56:46,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:56:46,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:46,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:46,974 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:46,975 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:56:46,975 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:56:46,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 04:56:46,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:56:46,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:46,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:46,977 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:46,977 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:56:46,986 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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; 15#L560true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L560-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 11#L544-3true [2019-01-14 04:56:46,986 INFO L796 eck$LassoCheckResult]: Loop: 11#L544-3true 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); 7#L546true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 17#L551-2true assume !true; 4#L551-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 9#L544-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L544-3true [2019-01-14 04:56:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 04:56:46,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:46,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2019-01-14 04:56:47,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:47,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:47,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:47,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:56:47,169 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:56:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:56:47,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:56:47,190 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-01-14 04:56:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:47,198 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-01-14 04:56:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:56:47,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-14 04:56:47,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:56:47,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2019-01-14 04:56:47,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:56:47,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:56:47,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-01-14 04:56:47,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:47,210 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:56:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-01-14 04:56:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 04:56:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 04:56:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-14 04:56:47,242 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:56:47,242 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-14 04:56:47,242 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:56:47,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-14 04:56:47,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 04:56:47,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:47,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:47,244 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:47,244 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:56:47,244 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 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; 41#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 45#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 44#L544-3 [2019-01-14 04:56:47,244 INFO L796 eck$LassoCheckResult]: Loop: 44#L544-3 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); 47#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 43#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 38#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 44#L544-3 [2019-01-14 04:56:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 04:56:47,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2019-01-14 04:56:47,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:47,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2019-01-14 04:56:47,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:47,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:47,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:47,711 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-14 04:56:47,844 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:56:47,966 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 04:56:48,181 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 04:56:48,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:48,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:48,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:48,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:48,203 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:48,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:48,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:48,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:48,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:56:48,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:48,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:48,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,700 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 04:56:48,832 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:56:48,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:48,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:49,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:49,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:49,371 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 [2019-01-14 04:56:49,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,386 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 [2019-01-14 04:56:49,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,390 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 [2019-01-14 04:56:49,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:49,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:49,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:49,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,400 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 [2019-01-14 04:56:49,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:49,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:49,440 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 [2019-01-14 04:56:49,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:49,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:49,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:49,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:49,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:49,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:49,539 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:49,597 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:56:49,597 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:56:49,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:49,603 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:49,608 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:49,609 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 [] [2019-01-14 04:56:49,650 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:49,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:49,818 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 [2019-01-14 04:56:49,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 04:56:49,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2019-01-14 04:56:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 04:56:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 04:56:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 04:56:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-14 04:56:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:49,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2019-01-14 04:56:49,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:49,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2019-01-14 04:56:49,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:56:49,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:56:49,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2019-01-14 04:56:49,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:49,883 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-01-14 04:56:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2019-01-14 04:56:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 04:56:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 04:56:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-01-14 04:56:49,885 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-01-14 04:56:49,885 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-01-14 04:56:49,886 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:56:49,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2019-01-14 04:56:49,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:49,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:49,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:49,887 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:56:49,887 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:49,888 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 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; 130#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 138#L544-3 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); 142#L546 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 132#L551-2 [2019-01-14 04:56:49,888 INFO L796 eck$LassoCheckResult]: Loop: 132#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 143#L551 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~mem7;havoc test_fun_#t~post8; 132#L551-2 [2019-01-14 04:56:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2019-01-14 04:56:49,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-14 04:56:49,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:49,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:49,918 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:49,918 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:49,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:49,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2019-01-14 04:56:49,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:49,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,010 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:50,010 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:50,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:50,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:50,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:50,310 INFO L478 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 [2019-01-14 04:56:50,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-01-14 04:56:50,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:56:50,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:56:50,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:56:50,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-01-14 04:56:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:50,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:50,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:56:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:56:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:56:50,450 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 04:56:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:50,807 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-01-14 04:56:50,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:56:50,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 04:56:50,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:50,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2019-01-14 04:56:50,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:56:50,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:56:50,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-01-14 04:56:50,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:50,813 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 04:56:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-01-14 04:56:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 04:56:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 04:56:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 04:56:50,816 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:56:50,816 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:56:50,816 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:56:50,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 04:56:50,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:50,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:50,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:50,818 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:50,818 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:50,819 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 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; 202#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 208#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 209#L544-3 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); 212#L546 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); 203#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 204#L551-2 [2019-01-14 04:56:50,819 INFO L796 eck$LassoCheckResult]: Loop: 204#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 214#L551 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~mem7;havoc test_fun_#t~post8; 204#L551-2 [2019-01-14 04:56:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-14 04:56:50,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:50,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2019-01-14 04:56:50,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:50,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,848 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:50,848 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:50,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:50,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:56:50,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 04:56:50,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:56:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:50,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2019-01-14 04:56:50,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:50,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:50,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:50,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:50,920 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:50,920 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:50,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:50,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:51,111 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:56:51,780 WARN L181 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-01-14 04:56:52,004 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-14 04:56:52,008 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:52,008 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:52,008 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:52,008 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:52,008 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:52,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:52,009 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:52,009 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:52,009 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-14 04:56:52,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:52,009 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:52,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,259 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-14 04:56:52,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:52,696 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:52,696 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:52,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:52,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:52,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:52,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:52,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,700 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 [2019-01-14 04:56:52,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:52,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:52,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:52,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,702 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 [2019-01-14 04:56:52,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:52,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:52,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:52,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:52,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:52,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:52,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,710 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 [2019-01-14 04:56:52,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:52,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:52,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:52,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,712 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 [2019-01-14 04:56:52,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:52,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:52,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:52,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,714 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 [2019-01-14 04:56:52,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:52,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:52,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:52,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,717 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 [2019-01-14 04:56:52,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:52,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:52,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:52,773 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 [2019-01-14 04:56:52,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:52,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:52,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:52,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:52,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:52,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:52,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:52,808 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:52,810 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:52,811 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:52,812 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:52,812 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:52,813 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 [] [2019-01-14 04:56:52,898 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:52,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:52,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:52,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:53,010 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 [2019-01-14 04:56:53,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 04:56:53,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2019-01-14 04:56:53,041 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 [2019-01-14 04:56:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:56:53,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:56:53,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:53,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:56:53,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:53,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 04:56:53,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:53,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2019-01-14 04:56:53,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:56:53,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2019-01-14 04:56:53,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 04:56:53,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 04:56:53,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-01-14 04:56:53,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:53,048 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-01-14 04:56:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-01-14 04:56:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-01-14 04:56:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 04:56:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-01-14 04:56:53,053 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-01-14 04:56:53,053 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-01-14 04:56:53,054 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:56:53,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2019-01-14 04:56:53,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:53,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:53,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:53,056 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:53,057 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:53,057 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 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; 321#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 328#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 329#L544-3 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); 333#L546 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); 322#L548 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 323#L551-2 [2019-01-14 04:56:53,057 INFO L796 eck$LassoCheckResult]: Loop: 323#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 337#L551 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~mem7;havoc test_fun_#t~post8; 323#L551-2 [2019-01-14 04:56:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-01-14 04:56:53,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2019-01-14 04:56:53,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,077 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:53,077 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:53,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:53,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:56:53,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-01-14 04:56:53,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:56:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2019-01-14 04:56:53,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,127 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:53,127 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:53,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:53,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:53,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:53,310 INFO L478 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 [2019-01-14 04:56:53,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-01-14 04:56:53,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:56:53,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:56:53,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:56:53,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-01-14 04:56:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:53,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:53,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:56:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:56:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:56:53,433 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-14 04:56:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:53,564 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-14 04:56:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:56:53,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-01-14 04:56:53,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:53,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2019-01-14 04:56:53,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:56:53,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:56:53,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-01-14 04:56:53,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:53,568 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 04:56:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-01-14 04:56:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-01-14 04:56:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 04:56:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-14 04:56:53,571 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 04:56:53,571 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 04:56:53,571 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:56:53,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-01-14 04:56:53,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:53,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:53,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:53,573 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:53,573 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:53,573 INFO L794 eck$LassoCheckResult]: Stem: 436#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 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; 425#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 433#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 434#L544-3 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); 437#L546 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); 440#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 443#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 444#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L544-3 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); 438#L546 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); 426#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 427#L551-2 [2019-01-14 04:56:53,573 INFO L796 eck$LassoCheckResult]: Loop: 427#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 441#L551 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~mem7;havoc test_fun_#t~post8; 427#L551-2 [2019-01-14 04:56:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2019-01-14 04:56:53,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:53,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 04:56:53,749 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2019-01-14 04:56:53,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,753 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:53,753 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:53,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:53,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 04:56:53,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 04:56:53,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:56:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:56:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:56:53,882 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-01-14 04:56:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:53,949 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-01-14 04:56:53,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:56:53,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-01-14 04:56:53,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:53,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2019-01-14 04:56:53,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:56:53,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:56:53,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-01-14 04:56:53,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:56:53,954 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 04:56:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-01-14 04:56:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-01-14 04:56:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 04:56:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-14 04:56:53,957 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 04:56:53,957 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 04:56:53,958 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:56:53,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-01-14 04:56:53,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:53,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:53,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:53,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:53,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:53,959 INFO L794 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 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; 497#L560 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 505#L560-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~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; 506#L544-3 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); 509#L546 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); 522#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 515#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 513#L551 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~mem7;havoc test_fun_#t~post8; 514#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L551 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L551-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L544-3 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); 510#L546 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); 498#L548 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 499#L551-2 [2019-01-14 04:56:53,960 INFO L796 eck$LassoCheckResult]: Loop: 499#L551-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 512#L551 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~mem7;havoc test_fun_#t~post8; 499#L551-2 [2019-01-14 04:56:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2019-01-14 04:56:53,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:53,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:53,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:53,966 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:53,966 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:53,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:53,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2019-01-14 04:56:54,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,087 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:54,087 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:54,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:54,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 04:56:54,117 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 04:56:54,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:56:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2019-01-14 04:56:54,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:54,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:54,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:54,152 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:56:54,152 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:56:54,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:56:54,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:56:54,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:56:54,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:56:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:54,335 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:56:54,687 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2019-01-14 04:56:54,768 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:54,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:54,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:54,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:54,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:54,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:54,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:54,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:54,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2019-01-14 04:56:54,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:54,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:54,974 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-14 04:56:54,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:55,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:55,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:55,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:55,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:55,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:56:55,510 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:55,510 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:55,510 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 [2019-01-14 04:56:55,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:55,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:55,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:55,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:55,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:55,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:55,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:55,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:55,518 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 [2019-01-14 04:56:55,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:55,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:55,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:55,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:55,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:55,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:55,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:55,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:55,523 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 [2019-01-14 04:56:55,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:55,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:55,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:55,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:55,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:55,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:55,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:55,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:55,526 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 [2019-01-14 04:56:55,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:55,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:55,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:55,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:55,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:55,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:55,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:55,530 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 [2019-01-14 04:56:55,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:55,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:55,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:55,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:55,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:55,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:55,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:55,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:55,533 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 [2019-01-14 04:56:55,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:55,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:55,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:55,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:55,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:55,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:55,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:55,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:56:55,546 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:56:55,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:55,547 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:55,548 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:55,548 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 [] [2019-01-14 04:56:55,592 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:56:55,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 04:56:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:55,682 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 [2019-01-14 04:56:55,682 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:56:55,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2019-01-14 04:56:55,706 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 [2019-01-14 04:56:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 04:56:55,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 04:56:55,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:55,707 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:55,766 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 [2019-01-14 04:56:55,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:56:55,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2019-01-14 04:56:55,799 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 [2019-01-14 04:56:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 04:56:55,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 04:56:55,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:55,800 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:56:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:55,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:55,882 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 [2019-01-14 04:56:55,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 04:56:55,902 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2019-01-14 04:56:55,905 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 [2019-01-14 04:56:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-14 04:56:55,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 04:56:55,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:55,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2019-01-14 04:56:55,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:55,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-14 04:56:55,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:55,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-01-14 04:56:55,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:55,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2019-01-14 04:56:55,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:56:55,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:56:55,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:56:55,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:55,912 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:55,912 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:55,912 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:55,912 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:56:55,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:56:55,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:55,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:56:55,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:56:55 BoogieIcfgContainer [2019-01-14 04:56:55,920 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:56:55,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:56:55,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:56:55,921 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:56:55,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:56:46" (3/4) ... [2019-01-14 04:56:55,925 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:56:55,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:56:55,926 INFO L168 Benchmark]: Toolchain (without parser) took 10258.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -329.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:55,927 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:55,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:55,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:55,928 INFO L168 Benchmark]: Boogie Preprocessor took 27.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:55,929 INFO L168 Benchmark]: RCFGBuilder took 473.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:55,930 INFO L168 Benchmark]: BuchiAutomizer took 9068.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:55,930 INFO L168 Benchmark]: Witness Printer took 4.54 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. [2019-01-14 04:56:55,934 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 628.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 473.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9068.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.54 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 3 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 9.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.5s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp52 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...