./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 91b1670e 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-91b1670 [2018-11-29 00:10:39,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:39,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:39,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:39,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:39,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:39,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:39,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:39,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:39,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:39,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:39,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:39,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:39,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:39,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:39,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:39,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:39,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:39,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:39,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:39,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:39,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:39,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:39,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:39,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:39,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:39,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:39,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:39,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:39,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:39,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:39,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:39,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:39,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:39,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:39,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:39,395 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:39,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:39,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:39,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:39,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:39,415 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:39,415 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:39,415 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:39,416 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:39,416 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:39,416 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:39,416 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:39,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:39,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:39,417 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:39,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:39,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:39,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:39,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:39,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:39,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:39,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:39,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:39,419 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:39,419 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:39,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:39,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:39,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:39,421 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:39,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:39,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:39,421 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:39,423 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:39,423 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 [2018-11-29 00:10:39,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:39,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:39,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:39,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:39,479 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:39,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:39,541 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d1980ca8/04cd1baac07e4f6e89aae6662c437e06/FLAGc6f8409f5 [2018-11-29 00:10:40,108 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:40,109 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:40,134 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d1980ca8/04cd1baac07e4f6e89aae6662c437e06/FLAGc6f8409f5 [2018-11-29 00:10:40,362 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d1980ca8/04cd1baac07e4f6e89aae6662c437e06 [2018-11-29 00:10:40,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:40,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:40,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:40,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:40,373 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:40,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1f8fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40, skipping insertion in model container [2018-11-29 00:10:40,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:40,449 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:40,884 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:40,901 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:40,969 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:41,113 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:41,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41 WrapperNode [2018-11-29 00:10:41,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:41,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:41,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:41,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:41,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:41,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:41,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:41,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:41,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (1/1) ... [2018-11-29 00:10:41,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:41,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:41,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:41,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:41,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (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 [2018-11-29 00:10:41,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:41,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:41,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:41,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:41,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:41,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:41,670 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:41,670 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:10:41,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:41 BoogieIcfgContainer [2018-11-29 00:10:41,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:41,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:41,672 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:41,676 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:41,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:41,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:40" (1/3) ... [2018-11-29 00:10:41,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4da6ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:41, skipping insertion in model container [2018-11-29 00:10:41,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:41,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:41" (2/3) ... [2018-11-29 00:10:41,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4da6ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:41, skipping insertion in model container [2018-11-29 00:10:41,680 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:41,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:41" (3/3) ... [2018-11-29 00:10:41,682 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:41,747 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:41,748 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:41,748 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:41,748 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:41,749 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:41,749 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:41,749 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:41,749 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:41,750 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:41,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:10:41,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:10:41,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:41,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:41,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:41,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:10:41,798 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:41,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:10:41,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:10:41,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:41,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:41,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:41,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:10:41,809 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.alloc(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 [2018-11-29 00:10:41,810 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 [2018-11-29 00:10:41,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:10:41,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2018-11-29 00:10:41,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:42,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:42,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:10:42,023 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:10:42,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:10:42,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:10:42,041 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-29 00:10:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:42,048 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-29 00:10:42,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:10:42,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-29 00:10:42,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:10:42,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2018-11-29 00:10:42,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:10:42,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:10:42,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-11-29 00:10:42,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:42,062 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-29 00:10:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-11-29 00:10:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-29 00:10:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-29 00:10:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-29 00:10:42,094 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-29 00:10:42,094 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-29 00:10:42,094 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:42,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-29 00:10:42,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:10:42,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:42,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:42,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:42,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:42,098 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.alloc(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 [2018-11-29 00:10:42,098 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 [2018-11-29 00:10:42,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:10:42,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2018-11-29 00:10:42,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:42,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2018-11-29 00:10:42,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,513 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-29 00:10:42,798 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-29 00:10:43,108 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-29 00:10:43,126 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:43,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:43,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:43,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:43,128 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:43,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:43,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:43,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:43,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:10:43,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:43,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:43,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,446 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:10:43,734 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-29 00:10:43,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,270 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:44,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:44,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:44,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:44,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:44,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:44,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:44,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:44,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:44,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:44,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:44,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:44,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:44,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:44,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:44,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:44,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:44,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,313 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:44,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,318 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:44,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:44,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:44,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:44,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:44,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:44,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:44,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:44,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 [2018-11-29 00:10:44,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:44,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:44,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:44,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:44,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:44,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:44,524 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:44,588 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:44,591 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:10:44,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:44,598 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:44,599 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:44,600 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-29 00:10:44,684 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:44,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:44,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:44,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-29 00:10:44,932 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. [2018-11-29 00:10:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-29 00:10:44,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-29 00:10:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-29 00:10:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-29 00:10:44,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2018-11-29 00:10:44,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:44,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2018-11-29 00:10:44,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:10:44,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:10:44,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2018-11-29 00:10:44,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:44,944 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-29 00:10:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2018-11-29 00:10:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-29 00:10:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-29 00:10:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-29 00:10:44,946 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-29 00:10:44,946 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-29 00:10:44,946 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:44,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-29 00:10:44,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:44,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:44,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:44,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:44,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:44,948 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.alloc(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 [2018-11-29 00:10:44,949 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 [2018-11-29 00:10:44,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2018-11-29 00:10:44,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:44,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-29 00:10:44,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,973 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:44,974 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:44,974 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 [2018-11-29 00:10:44,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:45,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2018-11-29 00:10:45,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,053 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:45,054 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:45,054 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 [2018-11-29 00:10:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:45,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:45,315 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 [2018-11-29 00:10:45,318 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 [2018-11-29 00:10:45,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:45,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-29 00:10:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:45,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:45,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:45,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:45,442 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-29 00:10:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:45,707 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-29 00:10:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:45,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-29 00:10:45,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:45,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-11-29 00:10:45,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:10:45,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:10:45,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-29 00:10:45,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:45,711 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-29 00:10:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-29 00:10:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-29 00:10:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-29 00:10:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-29 00:10:45,719 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-29 00:10:45,719 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-29 00:10:45,721 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:45,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-29 00:10:45,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:45,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:45,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:45,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:45,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:45,725 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.alloc(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 [2018-11-29 00:10:45,725 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 [2018-11-29 00:10:45,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-29 00:10:45,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:45,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:45,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:45,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:45,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2018-11-29 00:10:45,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:45,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:45,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:45,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:45,780 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:45,780 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 [2018-11-29 00:10:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:45,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-29 00:10:45,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-29 00:10:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:45,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2018-11-29 00:10:45,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:45,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:45,862 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:45,863 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:45,863 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 [2018-11-29 00:10:45,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,160 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:10:46,321 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-29 00:10:46,753 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-29 00:10:47,078 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-29 00:10:47,089 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:47,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:47,089 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:47,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:47,090 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:47,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:47,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:47,090 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:47,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:10:47,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:47,091 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:47,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,278 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-11-29 00:10:47,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,994 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-29 00:10:48,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:48,029 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:48,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,121 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:48,131 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:48,134 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:48,135 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:48,137 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:48,138 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:48,138 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-29 00:10:48,229 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:48,239 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:48,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:48,300 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:48,300 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-29 00:10:48,329 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. [2018-11-29 00:10:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-29 00:10:48,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-29 00:10:48,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-29 00:10:48,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-29 00:10:48,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2018-11-29 00:10:48,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:48,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2018-11-29 00:10:48,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-29 00:10:48,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:10:48,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-11-29 00:10:48,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:48,337 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-29 00:10:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-11-29 00:10:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-29 00:10:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-29 00:10:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-29 00:10:48,341 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-29 00:10:48,341 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-29 00:10:48,341 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:48,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2018-11-29 00:10:48,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:48,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:48,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:48,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:48,343 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.alloc(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 [2018-11-29 00:10:48,343 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 [2018-11-29 00:10:48,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-29 00:10:48,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2018-11-29 00:10:48,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,383 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:48,384 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:48,384 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 [2018-11-29 00:10:48,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:10:48,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-29 00:10:48,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-29 00:10:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2018-11-29 00:10:48,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,444 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:48,444 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:48,444 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 [2018-11-29 00:10:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,522 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 [2018-11-29 00:10:48,529 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 [2018-11-29 00:10:48,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:48,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:48,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:48,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-29 00:10:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:48,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:48,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:48,622 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-29 00:10:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:48,676 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-29 00:10:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:48,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-29 00:10:48,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2018-11-29 00:10:48,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:10:48,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:10:48,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-29 00:10:48,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:48,684 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-29 00:10:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-29 00:10:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-29 00:10:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-29 00:10:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-29 00:10:48,688 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-29 00:10:48,688 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-29 00:10:48,688 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:48,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-11-29 00:10:48,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:48,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:48,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:48,690 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:48,690 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:48,690 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.alloc(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 [2018-11-29 00:10:48,690 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 [2018-11-29 00:10:48,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2018-11-29 00:10:48,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:48,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-29 00:10:48,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:48,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2018-11-29 00:10:48,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,873 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:48,874 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:48,874 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 [2018-11-29 00:10:48,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-29 00:10:48,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-29 00:10:48,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-29 00:10:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,119 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:10:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:49,145 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-29 00:10:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:49,236 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-29 00:10:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:49,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2018-11-29 00:10:49,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:49,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2018-11-29 00:10:49,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:10:49,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:10:49,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-29 00:10:49,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:49,240 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-29 00:10:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-29 00:10:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-29 00:10:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-29 00:10:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-29 00:10:49,243 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-29 00:10:49,243 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-29 00:10:49,243 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:49,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-11-29 00:10:49,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:49,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:49,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:49,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:49,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:49,245 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.alloc(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 [2018-11-29 00:10:49,245 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 [2018-11-29 00:10:49,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2018-11-29 00:10:49,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:49,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:49,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,251 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:49,251 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:49,251 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 [2018-11-29 00:10:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2018-11-29 00:10:49,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:49,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:49,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:49,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,352 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:49,352 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:49,352 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 [2018-11-29 00:10:49,367 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-29 00:10:49,373 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-29 00:10:49,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-29 00:10:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2018-11-29 00:10:49,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:49,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:49,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:49,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:49,419 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-29 00:10:49,419 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-29 00:10:49,419 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 [2018-11-29 00:10:49,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:49,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:49,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-29 00:10:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:49,948 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-11-29 00:10:50,026 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:50,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:50,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:50,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:50,027 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:50,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:50,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:50,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:50,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-29 00:10:50,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:50,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:50,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,215 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-29 00:10:50,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,646 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-29 00:10:50,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:50,666 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:50,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:50,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:50,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:50,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:50,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:50,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:50,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:50,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:50,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:50,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:50,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:50,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:50,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:50,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:50,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:50,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:50,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:50,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:50,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:50,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:50,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:50,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:50,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:50,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:50,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:50,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:50,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:50,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:50,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:50,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:50,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:50,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:50,723 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:50,723 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:50,724 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:50,724 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:50,725 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-29 00:10:50,834 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:50,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:51,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:51,344 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:51,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:51,373 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. [2018-11-29 00:10:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-29 00:10:51,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-29 00:10:51,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:51,379 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:51,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:51,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:51,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:51,477 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. [2018-11-29 00:10:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-29 00:10:51,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-29 00:10:51,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:51,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:51,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:51,546 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:51,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:51,567 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. [2018-11-29 00:10:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-29 00:10:51,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-29 00:10:51,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:51,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-29 00:10:51,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:51,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-29 00:10:51,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:51,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-29 00:10:51,574 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:51,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-29 00:10:51,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:51,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:51,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:51,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:51,575 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:51,575 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:51,575 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:51,575 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:51,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:51,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:51,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:51,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:51 BoogieIcfgContainer [2018-11-29 00:10:51,582 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:51,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:51,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:51,583 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:51,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:41" (3/4) ... [2018-11-29 00:10:51,586 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:51,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:51,587 INFO L168 Benchmark]: Toolchain (without parser) took 11221.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 943.3 MB in the beginning and 821.5 MB in the end (delta: 121.8 MB). Peak memory consumption was 338.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:51,589 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:51,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:51,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.10 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:51,596 INFO L168 Benchmark]: Boogie Preprocessor took 30.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:51,596 INFO L168 Benchmark]: RCFGBuilder took 466.34 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:51,599 INFO L168 Benchmark]: BuchiAutomizer took 9910.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 821.5 MB in the end (delta: 291.7 MB). Peak memory consumption was 364.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:51,601 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.2 GB. Free memory is still 821.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:51,609 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 745.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.10 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.67 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 466.34 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9910.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 821.5 MB in the end (delta: 291.7 MB). Peak memory consumption was 364.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.2 GB. Free memory is still 821.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. 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: inital173 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp53 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...