./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.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 b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 23:13:15,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:13:15,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:13:15,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:13:15,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:13:15,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:13:15,967 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:13:15,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:13:15,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:13:15,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:13:15,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:13:15,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:13:15,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:13:15,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:13:15,978 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:13:15,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:13:15,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:13:15,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:13:15,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:13:15,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:13:15,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:13:15,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:13:15,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:13:15,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:13:15,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:13:15,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:13:15,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:13:15,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:13:15,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:13:15,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:13:15,999 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:13:16,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:13:16,001 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:13:16,001 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:13:16,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:13:16,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:13:16,003 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:13:16,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:13:16,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:13:16,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:13:16,040 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:13:16,040 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:13:16,040 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:13:16,041 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:13:16,041 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:13:16,041 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:13:16,042 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:13:16,042 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:13:16,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:13:16,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:13:16,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:13:16,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:13:16,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:13:16,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:13:16,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:13:16,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:13:16,046 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:13:16,046 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:13:16,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:13:16,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:13:16,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:13:16,048 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:13:16,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:13:16,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:13:16,049 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:13:16,052 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:13:16,053 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 -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2018-11-28 23:13:16,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:13:16,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:13:16,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:13:16,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:13:16,140 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:13:16,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2018-11-28 23:13:16,201 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac92620fb/7d8aec9f783d40b792244891aaa41d6b/FLAG13ac675f1 [2018-11-28 23:13:16,601 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:13:16,601 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2018-11-28 23:13:16,607 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac92620fb/7d8aec9f783d40b792244891aaa41d6b/FLAG13ac675f1 [2018-11-28 23:13:17,000 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac92620fb/7d8aec9f783d40b792244891aaa41d6b [2018-11-28 23:13:17,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:13:17,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:13:17,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:13:17,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:13:17,011 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:13:17,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0282d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17, skipping insertion in model container [2018-11-28 23:13:17,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:13:17,048 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:13:17,304 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:13:17,311 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:13:17,340 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:13:17,377 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:13:17,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17 WrapperNode [2018-11-28 23:13:17,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:13:17,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:13:17,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:13:17,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:13:17,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:13:17,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:13:17,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:13:17,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:13:17,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... [2018-11-28 23:13:17,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:13:17,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:13:17,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:13:17,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:13:17,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:13:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:13:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:13:17,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:13:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:13:17,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:13:17,936 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:13:17,936 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:13:17,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:17 BoogieIcfgContainer [2018-11-28 23:13:17,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:13:17,938 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:13:17,938 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:13:17,942 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:13:17,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:17,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:13:17" (1/3) ... [2018-11-28 23:13:17,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@775bf89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:13:17, skipping insertion in model container [2018-11-28 23:13:17,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:17,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:17" (2/3) ... [2018-11-28 23:13:17,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@775bf89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:13:17, skipping insertion in model container [2018-11-28 23:13:17,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:17,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:17" (3/3) ... [2018-11-28 23:13:17,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_true-no-overflow_false-termination.c [2018-11-28 23:13:18,019 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:13:18,019 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:13:18,020 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:13:18,020 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:13:18,021 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:13:18,021 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:13:18,021 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:13:18,021 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:13:18,021 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:13:18,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:13:18,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:13:18,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:18,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:18,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:13:18,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:18,072 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:13:18,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:13:18,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:13:18,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:18,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:18,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:13:18,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:18,085 INFO L794 eck$LassoCheckResult]: Stem: 7#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.alloc(40);main_~n~0 := 0; 5#L13-3true [2018-11-28 23:13:18,086 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; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2018-11-28 23:13:18,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:13:18,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:18,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:18,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 23:13:18,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:18,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:18,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:18,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:18,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:18,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 23:13:18,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:18,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:18,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:18,632 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:13:18,657 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:18,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:18,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:18,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:18,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:18,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:18,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:18,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:18,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_true-no-overflow_false-termination.c_Iteration1_Lasso [2018-11-28 23:13:18,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:18,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:18,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:18,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:18,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:18,984 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 23:13:19,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:19,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:19,610 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:19,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:19,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:19,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:19,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:19,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:19,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:19,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:19,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:19,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:19,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:19,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:19,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:19,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:19,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:19,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:19,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:19,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:19,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:19,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:19,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:19,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:19,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:19,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:19,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,702 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:13:19,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:13:19,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:19,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:19,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:19,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:19,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:19,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:19,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:19,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:19,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:19,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:19,843 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:13:19,843 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:13:19,847 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:19,849 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:13:19,849 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:19,850 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2018-11-28 23:13:19,859 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:13:19,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:19,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:19,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:20,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:20,116 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2018-11-28 23:13:20,278 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. [2018-11-28 23:13:20,281 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 [2018-11-28 23:13:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-28 23:13:20,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:13:20,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:20,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:13:20,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:20,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:13:20,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:20,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2018-11-28 23:13:20,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:20,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2018-11-28 23:13:20,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:20,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:13:20,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-28 23:13:20,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:20,309 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-28 23:13:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-28 23:13:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 23:13:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:13:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-11-28 23:13:20,349 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:13:20,349 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-28 23:13:20,349 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:13:20,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2018-11-28 23:13:20,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:20,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:20,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:20,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:13:20,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:20,354 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.alloc(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2018-11-28 23:13:20,355 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 83#L17-4 [2018-11-28 23:13:20,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2018-11-28 23:13:20,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:20,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:20,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:20,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:13:20,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:13:20,458 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:20,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2018-11-28 23:13:20,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:20,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:20,658 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:13:20,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:13:20,726 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:13:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:20,740 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2018-11-28 23:13:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:13:20,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-28 23:13:20,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:20,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2018-11-28 23:13:20,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:20,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:20,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-28 23:13:20,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:20,746 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:13:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-28 23:13:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 23:13:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:13:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-28 23:13:20,747 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:13:20,748 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:13:20,748 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:13:20,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-28 23:13:20,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:20,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:20,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:20,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:13:20,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:20,750 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.alloc(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 [2018-11-28 23:13:20,750 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L17-4 [2018-11-28 23:13:20,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2018-11-28 23:13:20,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:20,804 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 [2018-11-28 23:13:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:20,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:20,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:20,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-28 23:13:20,894 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:20,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2018-11-28 23:13:20,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:21,076 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:13:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:13:21,107 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-28 23:13:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:21,183 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-28 23:13:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:13:21,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-28 23:13:21,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:21,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-28 23:13:21,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:21,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:21,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-28 23:13:21,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:21,186 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:13:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-28 23:13:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 23:13:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:13:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 23:13:21,188 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:13:21,189 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:13:21,189 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:13:21,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 23:13:21,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:21,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:21,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:21,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-28 23:13:21,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:21,191 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.alloc(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 [2018-11-28 23:13:21,191 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 147#L17-4 [2018-11-28 23:13:21,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2018-11-28 23:13:21,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:21,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:21,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:21,273 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 [2018-11-28 23:13:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:13:21,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:13:21,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:21,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:21,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:21,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:13:21,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:21,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2018-11-28 23:13:21,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:21,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:21,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:21,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:21,559 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:13:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:13:21,642 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-28 23:13:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:21,671 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-28 23:13:21,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:13:21,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-28 23:13:21,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:21,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 23:13:21,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:21,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:21,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-28 23:13:21,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:21,675 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:13:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-28 23:13:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-28 23:13:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:13:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-28 23:13:21,677 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-28 23:13:21,677 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-28 23:13:21,677 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:13:21,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-28 23:13:21,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:21,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:21,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:21,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2018-11-28 23:13:21,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:21,679 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.alloc(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 [2018-11-28 23:13:21,679 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 195#L17-4 [2018-11-28 23:13:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2018-11-28 23:13:21,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:21,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:21,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:21,783 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 [2018-11-28 23:13:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:13:21,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:13:21,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:21,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:21,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:21,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:13:21,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:21,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:21,874 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2018-11-28 23:13:21,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:21,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:22,051 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:13:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:13:22,081 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 23:13:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:22,117 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:13:22,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:13:22,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:13:22,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:22,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:13:22,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:22,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:22,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-28 23:13:22,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:22,123 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:13:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-28 23:13:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-28 23:13:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:13:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-28 23:13:22,125 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:13:22,125 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:13:22,125 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:13:22,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-28 23:13:22,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:22,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:22,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:22,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2018-11-28 23:13:22,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:22,127 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.alloc(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 [2018-11-28 23:13:22,127 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L17-4 [2018-11-28 23:13:22,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2018-11-28 23:13:22,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:22,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:22,225 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 [2018-11-28 23:13:22,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:13:22,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:13:22,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:22,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:22,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:22,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:13:22,297 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:22,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2018-11-28 23:13:22,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:22,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:13:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:13:22,446 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-28 23:13:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:22,484 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-28 23:13:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:13:22,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-28 23:13:22,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:22,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 23:13:22,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:22,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:22,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-28 23:13:22,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:22,488 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:13:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-28 23:13:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 23:13:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:13:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-28 23:13:22,491 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-28 23:13:22,492 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-28 23:13:22,492 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:13:22,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-28 23:13:22,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:22,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:22,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:22,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2018-11-28 23:13:22,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:22,495 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.alloc(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 [2018-11-28 23:13:22,495 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 328#L17-4 [2018-11-28 23:13:22,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2018-11-28 23:13:22,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:22,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:22,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:22,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:22,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:22,565 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 [2018-11-28 23:13:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:13:22,595 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:13:22,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:22,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:22,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:22,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:13:22,643 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:22,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2018-11-28 23:13:22,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:22,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:22,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:22,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:22,780 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:13:22,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:13:22,804 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-28 23:13:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:22,852 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-28 23:13:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:13:22,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-28 23:13:22,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:22,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2018-11-28 23:13:22,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:22,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:22,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-28 23:13:22,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:22,859 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-28 23:13:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-28 23:13:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-28 23:13:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:13:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 23:13:22,861 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:13:22,862 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:13:22,862 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:13:22,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 23:13:22,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:22,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:22,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:22,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2018-11-28 23:13:22,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:22,864 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.alloc(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 [2018-11-28 23:13:22,864 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L17-4 [2018-11-28 23:13:22,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2018-11-28 23:13:22,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:22,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:22,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:23,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:23,088 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 [2018-11-28 23:13:23,097 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:13:23,116 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 23:13:23,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:23,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:23,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:23,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 23:13:23,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:23,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2018-11-28 23:13:23,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:23,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:23,291 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:13:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:13:23,321 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-11-28 23:13:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:23,360 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-28 23:13:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:13:23,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-11-28 23:13:23,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:23,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2018-11-28 23:13:23,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:23,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:23,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-11-28 23:13:23,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:23,364 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-28 23:13:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-11-28 23:13:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-28 23:13:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:13:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-28 23:13:23,370 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 23:13:23,370 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 23:13:23,370 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:13:23,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-28 23:13:23,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:23,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:23,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:23,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2018-11-28 23:13:23,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:23,374 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.alloc(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 [2018-11-28 23:13:23,374 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 507#L17-4 [2018-11-28 23:13:23,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2018-11-28 23:13:23,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:23,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:23,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:23,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:23,898 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 [2018-11-28 23:13:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:23,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:23,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:23,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:13:23,987 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:23,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2018-11-28 23:13:23,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:13:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:13:24,110 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 23:13:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:24,209 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-28 23:13:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:13:24,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-28 23:13:24,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:24,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2018-11-28 23:13:24,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:24,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:24,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-28 23:13:24,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:24,213 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 23:13:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-28 23:13:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 23:13:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:13:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-28 23:13:24,216 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:13:24,216 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:13:24,216 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:13:24,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-11-28 23:13:24,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:24,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:24,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:24,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2018-11-28 23:13:24,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:24,218 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.alloc(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 [2018-11-28 23:13:24,218 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 610#L17-4 [2018-11-28 23:13:24,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:24,219 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2018-11-28 23:13:24,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:24,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:24,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:24,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:24,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:24,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:24,473 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 [2018-11-28 23:13:24,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:13:24,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:13:24,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:24,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:24,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:24,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 23:13:24,565 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:24,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2018-11-28 23:13:24,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:24,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:13:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:13:24,676 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-28 23:13:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:24,722 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 23:13:24,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:13:24,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-11-28 23:13:24,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:24,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 23:13:24,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:24,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:24,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-28 23:13:24,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:24,727 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 23:13:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-28 23:13:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-28 23:13:24,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:13:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-28 23:13:24,731 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-28 23:13:24,731 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-28 23:13:24,731 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:13:24,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-11-28 23:13:24,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:24,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:24,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:24,733 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2018-11-28 23:13:24,733 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:24,733 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.alloc(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 [2018-11-28 23:13:24,733 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 726#L17-4 [2018-11-28 23:13:24,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:24,734 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2018-11-28 23:13:24,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:24,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:24,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:25,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:25,577 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 [2018-11-28 23:13:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:13:25,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 23:13:25,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:25,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:25,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:25,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 23:13:25,658 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:25,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:25,658 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2018-11-28 23:13:25,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:25,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:25,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:25,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:25,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:25,874 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:13:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:13:25,899 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2018-11-28 23:13:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:26,119 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-28 23:13:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:13:26,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-28 23:13:26,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:26,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 23:13:26,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:26,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:13:26,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2018-11-28 23:13:26,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:13:26,122 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 23:13:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2018-11-28 23:13:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 23:13:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:13:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 23:13:26,124 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 23:13:26,124 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 23:13:26,125 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:13:26,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-11-28 23:13:26,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:13:26,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:26,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:26,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2018-11-28 23:13:26,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:26,126 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.alloc(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 [2018-11-28 23:13:26,127 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~mem3;havoc main_#t~short4;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L17-4 [2018-11-28 23:13:26,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2018-11-28 23:13:26,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:26,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:26,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:26,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:26,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:26,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2018-11-28 23:13:26,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:26,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:26,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:26,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2018-11-28 23:13:26,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:26,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:26,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:26,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:26,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:26,368 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2018-11-28 23:13:29,279 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 189 DAG size of output: 145 [2018-11-28 23:13:29,451 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-28 23:13:29,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:13:29 BoogieIcfgContainer [2018-11-28 23:13:29,498 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:13:29,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:13:29,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:13:29,499 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:13:29,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:17" (3/4) ... [2018-11-28 23:13:29,517 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:13:29,635 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:13:29,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:13:29,636 INFO L168 Benchmark]: Toolchain (without parser) took 12632.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 951.4 MB in the beginning and 935.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 221.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:13:29,641 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. [2018-11-28 23:13:29,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:13:29,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.28 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:13:29,642 INFO L168 Benchmark]: Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:13:29,649 INFO L168 Benchmark]: RCFGBuilder took 471.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:13:29,652 INFO L168 Benchmark]: BuchiAutomizer took 11560.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 167.4 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:13:29,655 INFO L168 Benchmark]: Witness Printer took 136.42 ms. Allocated memory is still 1.2 GB. Free memory was 943.1 MB in the beginning and 935.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:13:29,668 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 372.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 57.28 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 471.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11560.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 167.4 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. * Witness Printer took 136.42 ms. Allocated memory is still 1.2 GB. Free memory was 943.1 MB in the beginning and 935.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 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 11.4s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 10.1s. Construction of modules took 0.6s. Büchi inclusion checks took 0.4s. 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.6s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp93 ukn58 mio100 lsp72 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 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 {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@73db75d6=0, NULL=0, \result=0, n=10, i=9, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bb95c83=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2674320b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21bcfe66=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ad30f66=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1822a3f5=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] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...