./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/termination-crafted/NonTermination3_false-termination_false-valid-deref.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:31:38,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:31:38,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:31:38,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:31:38,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:31:38,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:31:38,357 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:31:38,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:31:38,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:31:38,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:31:38,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:31:38,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:31:38,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:31:38,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:31:38,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:31:38,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:31:38,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:31:38,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:31:38,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:31:38,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:31:38,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:31:38,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:31:38,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:31:38,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:31:38,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:31:38,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:31:38,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:31:38,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:31:38,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:31:38,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:31:38,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:31:38,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:31:38,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:31:38,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:31:38,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:31:38,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:31:38,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:31:38,414 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:31:38,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:31:38,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:31:38,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:31:38,416 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:31:38,420 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:31:38,420 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:31:38,420 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:31:38,420 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:31:38,421 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:31:38,421 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:31:38,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:31:38,421 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:31:38,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:31:38,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:31:38,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:31:38,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:31:38,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:31:38,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:31:38,422 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:31:38,422 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:31:38,425 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:31:38,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:31:38,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:31:38,425 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:31:38,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:31:38,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:31:38,427 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:31:38,428 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:31:38,428 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2019-01-01 21:31:38,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:31:38,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:31:38,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:31:38,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:31:38,511 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:31:38,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c [2019-01-01 21:31:38,582 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd810e06/f6cc62484d9341878f8d77ab57872225/FLAGe71308a44 [2019-01-01 21:31:39,036 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:31:39,037 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c [2019-01-01 21:31:39,045 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd810e06/f6cc62484d9341878f8d77ab57872225/FLAGe71308a44 [2019-01-01 21:31:39,378 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd810e06/f6cc62484d9341878f8d77ab57872225 [2019-01-01 21:31:39,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:31:39,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:31:39,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:31:39,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:31:39,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:31:39,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53427258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39, skipping insertion in model container [2019-01-01 21:31:39,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:31:39,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:31:39,637 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:31:39,643 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:31:39,668 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:31:39,695 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:31:39,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39 WrapperNode [2019-01-01 21:31:39,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:31:39,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:31:39,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:31:39,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:31:39,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:31:39,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:31:39,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:31:39,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:31:39,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... [2019-01-01 21:31:39,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:31:39,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:31:39,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:31:39,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:31:39,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:31:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:31:39,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:31:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:31:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:31:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:31:40,395 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:31:40,396 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:31:40,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40 BoogieIcfgContainer [2019-01-01 21:31:40,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:31:40,398 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:31:40,398 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:31:40,402 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:31:40,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:31:39" (1/3) ... [2019-01-01 21:31:40,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0c1a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:31:40, skipping insertion in model container [2019-01-01 21:31:40,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:31:39" (2/3) ... [2019-01-01 21:31:40,407 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b0c1a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:31:40, skipping insertion in model container [2019-01-01 21:31:40,407 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:31:40,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40" (3/3) ... [2019-01-01 21:31:40,410 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_false-termination_false-valid-deref.c [2019-01-01 21:31:40,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:31:40,494 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:31:40,494 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:31:40,494 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:31:40,495 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:31:40,495 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:31:40,495 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:31:40,496 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:31:40,496 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:31:40,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:31:40,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:31:40,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:40,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:40,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:31:40,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:31:40,565 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:31:40,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:31:40,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:31:40,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:40,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:40,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:31:40,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:31:40,580 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2019-01-01 21:31:40,581 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 7#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2019-01-01 21:31:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:31:40,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 21:31:40,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 21:31:40,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:40,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:40,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:40,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:41,165 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:31:41,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:31:41,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:31:41,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:31:41,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:31:41,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:31:41,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:31:41,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:31:41,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_false-termination_false-valid-deref.c_Iteration1_Lasso [2019-01-01 21:31:41,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:31:41,168 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:31:41,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:41,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:31:42,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:31:42,087 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:31:42,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:31:42,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:31:42,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:31:42,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:31:42,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,142 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:31:42,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,147 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:31:42,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:31:42,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:31:42,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:31:42,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:31:42,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:31:42,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:31:42,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:31:42,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:31:42,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:31:42,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:31:42,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:31:42,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:31:42,239 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:31:42,277 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:31:42,281 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:31:42,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:31:42,286 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:31:42,286 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:31:42,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2019-01-01 21:31:42,297 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:31:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:42,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:42,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:42,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:31:42,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-01-01 21:31:42,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-01-01 21:31:42,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:31:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:31:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:31:42,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:31:42,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:42,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:31:42,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:42,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:31:42,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:31:42,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-01-01 21:31:42,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:42,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2019-01-01 21:31:42,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:42,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:31:42,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-01 21:31:42,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:42,741 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-01 21:31:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-01 21:31:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-01 21:31:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:31:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-01 21:31:42,768 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:31:42,769 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:31:42,769 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:31:42,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-01-01 21:31:42,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:42,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:42,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:42,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:31:42,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:42,771 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2019-01-01 21:31:42,771 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 83#L17-4 [2019-01-01 21:31:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2019-01-01 21:31:42,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:42,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:42,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:42,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:31:42,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:31:42,839 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-01-01 21:31:42,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:42,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:42,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,165 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:31:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:31:43,243 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:31:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:43,257 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-01 21:31:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:31:43,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-01 21:31:43,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:43,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-01-01 21:31:43,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:43,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:43,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-01 21:31:43,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:43,262 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-01 21:31:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-01 21:31:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-01 21:31:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:31:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-01 21:31:43,264 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:31:43,264 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:31:43,264 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:31:43,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-01 21:31:43,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:43,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:43,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:43,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:31:43,267 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:43,267 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2019-01-01 21:31:43,267 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 108#L17-4 [2019-01-01 21:31:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2019-01-01 21:31:43,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:43,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:43,381 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:43,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:43,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:43,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:43,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-01 21:31:43,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-01-01 21:31:43,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:43,768 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:43,912 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 21:31:43,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:31:43,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:31:43,914 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-01-01 21:31:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:44,067 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 21:31:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:31:44,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:31:44,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:44,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 21:31:44,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:44,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:44,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-01 21:31:44,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:44,075 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 21:31:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-01 21:31:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:31:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:31:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 21:31:44,079 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:31:44,080 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:31:44,080 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:31:44,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-01 21:31:44,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:44,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:44,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:44,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-01-01 21:31:44,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:44,084 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2019-01-01 21:31:44,084 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 147#L17-4 [2019-01-01 21:31:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2019-01-01 21:31:44,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:44,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:44,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:44,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:44,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:44,215 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:31:44,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:31:44,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:44,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:44,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:44,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 21:31:44,370 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:44,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-01-01 21:31:44,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:44,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,604 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:31:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:31:44,647 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-01 21:31:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:44,693 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-01 21:31:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:31:44,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-01 21:31:44,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:44,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2019-01-01 21:31:44,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:44,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:44,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-01-01 21:31:44,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:44,698 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-01 21:31:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-01-01 21:31:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 21:31:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:31:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-01 21:31:44,700 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-01 21:31:44,700 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-01 21:31:44,700 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:31:44,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-01-01 21:31:44,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:44,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:44,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:44,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2019-01-01 21:31:44,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:44,702 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2019-01-01 21:31:44,702 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 195#L17-4 [2019-01-01 21:31:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2019-01-01 21:31:44,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:44,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:44,758 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:44,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:31:44,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 21:31:44,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:44,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:44,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 21:31:44,817 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-01-01 21:31:44,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:44,981 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:31:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:31:45,018 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-01 21:31:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:45,053 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-01 21:31:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:31:45,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-01 21:31:45,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:45,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 21:31:45,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:45,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:45,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-01-01 21:31:45,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:45,060 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 21:31:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-01-01 21:31:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-01 21:31:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:31:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 21:31:45,062 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 21:31:45,063 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 21:31:45,063 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:31:45,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-01-01 21:31:45,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:45,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:45,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:45,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2019-01-01 21:31:45,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:45,064 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2019-01-01 21:31:45,065 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 258#L17-4 [2019-01-01 21:31:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2019-01-01 21:31:45,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:45,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:45,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:45,202 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:45,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:31:45,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:31:45,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:45,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:45,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:45,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 21:31:45,279 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-01-01 21:31:45,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:45,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:45,458 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:45,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:31:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:31:45,488 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2019-01-01 21:31:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:45,525 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-01-01 21:31:45,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:31:45,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-01-01 21:31:45,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:45,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-01-01 21:31:45,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:45,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:45,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-01-01 21:31:45,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:45,528 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 21:31:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-01-01 21:31:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-01 21:31:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:31:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-01-01 21:31:45,531 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-01 21:31:45,532 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-01 21:31:45,532 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:31:45,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-01-01 21:31:45,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:45,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:45,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:45,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2019-01-01 21:31:45,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:45,533 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2019-01-01 21:31:45,533 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 328#L17-4 [2019-01-01 21:31:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2019-01-01 21:31:45,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:45,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:45,756 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:31:45,788 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 21:31:45,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:45,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:45,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:45,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 21:31:45,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-01-01 21:31:45,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:45,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:45,968 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:45,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:31:45,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:31:45,999 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-01-01 21:31:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:46,045 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-01-01 21:31:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:31:46,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-01-01 21:31:46,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:46,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2019-01-01 21:31:46,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:46,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:46,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-01-01 21:31:46,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:46,050 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-01 21:31:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-01-01 21:31:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-01 21:31:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:31:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-01 21:31:46,052 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 21:31:46,052 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-01 21:31:46,052 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:31:46,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-01 21:31:46,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:46,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:46,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:46,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2019-01-01 21:31:46,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:46,054 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2019-01-01 21:31:46,054 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 413#L17-4 [2019-01-01 21:31:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2019-01-01 21:31:46,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:46,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:46,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:46,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:46,280 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:46,310 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:31:46,363 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 21:31:46,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:46,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:46,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:46,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 21:31:46,416 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2019-01-01 21:31:46,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:46,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:46,696 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:46,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:31:46,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:31:46,724 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-01-01 21:31:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:46,760 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-01-01 21:31:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:31:46,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2019-01-01 21:31:46,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:46,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2019-01-01 21:31:46,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:46,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:46,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-01-01 21:31:46,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:46,765 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-01 21:31:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-01-01 21:31:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-01 21:31:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:31:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-01 21:31:46,768 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 21:31:46,769 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 21:31:46,769 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:31:46,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-01-01 21:31:46,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:46,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:46,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:46,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2019-01-01 21:31:46,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:46,771 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2019-01-01 21:31:46,771 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 507#L17-4 [2019-01-01 21:31:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2019-01-01 21:31:46,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:46,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:46,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:46,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:47,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:47,219 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:47,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:47,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:47,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-01 21:31:47,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2019-01-01 21:31:47,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:47,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:31:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,486 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:47,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:31:47,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:31:47,516 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2019-01-01 21:31:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:47,556 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-01-01 21:31:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:31:47,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-01-01 21:31:47,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:47,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-01-01 21:31:47,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:47,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:47,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-01-01 21:31:47,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:47,561 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-01 21:31:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-01-01 21:31:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-01 21:31:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:31:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-01 21:31:47,563 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-01 21:31:47,563 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-01 21:31:47,563 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:31:47,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-01-01 21:31:47,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:47,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:47,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:47,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2019-01-01 21:31:47,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:47,565 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2019-01-01 21:31:47,565 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 610#L17-4 [2019-01-01 21:31:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2019-01-01 21:31:47,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:47,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:47,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:47,793 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:47,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:31:47,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:31:47,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:47,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:47,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:47,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-01 21:31:47,860 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2019-01-01 21:31:47,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:47,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,029 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:31:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:31:48,071 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-01-01 21:31:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:48,112 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-01 21:31:48,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:31:48,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-01-01 21:31:48,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:48,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-01-01 21:31:48,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:48,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:48,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-01-01 21:31:48,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:48,118 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-01 21:31:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-01-01 21:31:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-01 21:31:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:31:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-01 21:31:48,122 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-01 21:31:48,122 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-01 21:31:48,122 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:31:48,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-01-01 21:31:48,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:48,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:48,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:48,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2019-01-01 21:31:48,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:48,124 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2019-01-01 21:31:48,124 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 726#L17-4 [2019-01-01 21:31:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,124 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2019-01-01 21:31:48,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:31:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:48,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:31:48,318 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:31:48,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:31:48,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 21:31:48,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:31:48,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:31:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:31:48,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:31:48,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-01 21:31:48,426 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:31:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2019-01-01 21:31:48,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,709 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:31:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:31:48,738 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-01-01 21:31:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:31:48,912 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-01 21:31:48,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 21:31:48,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-01-01 21:31:48,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:48,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 21:31:48,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:31:48,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:31:48,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2019-01-01 21:31:48,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:31:48,915 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 21:31:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2019-01-01 21:31:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 21:31:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 21:31:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-01 21:31:48,921 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 21:31:48,921 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-01 21:31:48,921 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:31:48,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-01-01 21:31:48,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:31:48,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:31:48,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:31:48,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2019-01-01 21:31:48,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:31:48,923 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2019-01-01 21:31:48,923 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L17-4 [2019-01-01 21:31:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2019-01-01 21:31:48,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2019-01-01 21:31:48,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:31:48,964 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2019-01-01 21:31:48,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:31:48,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:31:48,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:31:48,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:31:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:31:49,772 WARN L181 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-01 21:31:52,722 WARN L181 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 191 DAG size of output: 147 [2019-01-01 21:31:52,933 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 21:31:52,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:31:52 BoogieIcfgContainer [2019-01-01 21:31:52,972 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:31:52,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:31:52,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:31:52,973 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:31:52,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:31:40" (3/4) ... [2019-01-01 21:31:52,986 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:31:53,117 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:31:53,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:31:53,118 INFO L168 Benchmark]: Toolchain (without parser) took 13735.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 952.7 MB in the beginning and 889.4 MB in the end (delta: 63.3 MB). Peak memory consumption was 259.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:53,119 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:53,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:53,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.71 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:31:53,124 INFO L168 Benchmark]: Boogie Preprocessor took 56.29 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:53,125 INFO L168 Benchmark]: RCFGBuilder took 589.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:53,129 INFO L168 Benchmark]: BuchiAutomizer took 12574.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 896.9 MB in the end (delta: 198.4 MB). Peak memory consumption was 273.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:53,130 INFO L168 Benchmark]: Witness Printer took 144.18 ms. Allocated memory is still 1.2 GB. Free memory was 896.9 MB in the beginning and 889.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:31:53,141 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.71 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.29 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 589.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12574.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 896.9 MB in the end (delta: 198.4 MB). Peak memory consumption was 273.4 MB. Max. memory is 11.5 GB. * Witness Printer took 144.18 ms. Allocated memory is still 1.2 GB. Free memory was 896.9 MB in the beginning and 889.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.4s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 11.1s. Construction of modules took 0.5s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn60 mio100 lsp68 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6da1f0dd=0, NULL=0, \result=0, NULL=0, n=10, i=9, a=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18bf8c49=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@64be0dbd=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4733d292=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@552611b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3c630872=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...