./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-14 02:14:10,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:14:10,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:14:10,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:14:10,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:14:10,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:14:10,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:14:10,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:14:10,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:14:10,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:14:10,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:14:10,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:14:10,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:14:10,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:14:10,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:14:10,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:14:10,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:14:10,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:14:10,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:14:10,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:14:10,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:14:10,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:14:10,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:14:10,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:14:10,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:14:10,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:14:10,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:14:10,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:14:10,836 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:14:10,837 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:14:10,837 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:14:10,838 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:14:10,839 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:14:10,839 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:14:10,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:14:10,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:14:10,842 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:14:10,864 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:14:10,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:14:10,866 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:14:10,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:14:10,867 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:14:10,867 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:14:10,867 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:14:10,867 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:14:10,868 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:14:10,868 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:14:10,869 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:14:10,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:14:10,869 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:14:10,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:14:10,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:14:10,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:14:10,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:14:10,870 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:14:10,870 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:14:10,870 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:14:10,870 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:14:10,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:14:10,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:14:10,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:14:10,872 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:14:10,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:14:10,872 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:14:10,872 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:14:10,874 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:14:10,874 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 [2019-01-14 02:14:10,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:14:10,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:14:10,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:14:10,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:14:10,952 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:14:10,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2019-01-14 02:14:11,020 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79cec066/62add8c79f0f45119c57e70219c518ae/FLAGcc1f6c1cb [2019-01-14 02:14:11,475 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:14:11,476 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2019-01-14 02:14:11,484 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79cec066/62add8c79f0f45119c57e70219c518ae/FLAGcc1f6c1cb [2019-01-14 02:14:11,822 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79cec066/62add8c79f0f45119c57e70219c518ae [2019-01-14 02:14:11,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:14:11,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:14:11,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:11,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:14:11,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:14:11,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:11" (1/1) ... [2019-01-14 02:14:11,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0f02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:11, skipping insertion in model container [2019-01-14 02:14:11,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:11" (1/1) ... [2019-01-14 02:14:11,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:14:11,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:14:12,078 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:12,084 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:14:12,113 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:12,160 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:14:12,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12 WrapperNode [2019-01-14 02:14:12,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:12,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:12,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:14:12,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:14:12,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:12,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:14:12,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:14:12,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:14:12,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... [2019-01-14 02:14:12,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:14:12,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:14:12,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:14:12,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:14:12,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:14:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:14:12,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:14:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:14:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:14:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:14:12,710 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:14:12,710 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:14:12,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:12 BoogieIcfgContainer [2019-01-14 02:14:12,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:14:12,713 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:14:12,713 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:14:12,721 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:14:12,722 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:12,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:14:11" (1/3) ... [2019-01-14 02:14:12,724 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@693e69a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:12, skipping insertion in model container [2019-01-14 02:14:12,724 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:12,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:12" (2/3) ... [2019-01-14 02:14:12,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@693e69a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:12, skipping insertion in model container [2019-01-14 02:14:12,725 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:12,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:12" (3/3) ... [2019-01-14 02:14:12,732 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_true-no-overflow_false-termination.c [2019-01-14 02:14:12,795 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:14:12,795 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:14:12,796 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:14:12,796 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:14:12,796 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:14:12,796 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:14:12,796 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:14:12,796 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:14:12,797 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:14:12,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:14:12,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:14:12,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:12,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:12,841 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:12,842 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:12,842 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:14:12,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:14:12,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:14:12,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:12,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:12,844 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:12,844 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:12,852 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.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2019-01-14 02:14:12,853 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 [2019-01-14 02:14:12,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:14:12,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 02:14:12,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:12,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:12,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:12,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:12,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 02:14:12,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:12,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:12,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:12,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:13,372 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:14:13,382 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:13,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:13,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:13,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:13,384 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:13,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:13,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:13,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:13,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_true-no-overflow_false-termination.c_Iteration1_Lasso [2019-01-14 02:14:13,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:13,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:13,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:13,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:14,075 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:14,080 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:14,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:14,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:14,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:14,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:14,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:14,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:14,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:14,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:14,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:14,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:14,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:14,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:14,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:14,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:14,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:14,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:14,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:14,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:14,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,139 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:14:14,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,143 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:14:14,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:14,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:14,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:14,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:14,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:14,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:14,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:14,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:14,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:14,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:14,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:14,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:14,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:14,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:14,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:14,282 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:14:14,282 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:14:14,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:14,289 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:14:14,289 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:14,290 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2019-01-14 02:14:14,301 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:14:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:14,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:14,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:14,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:14:14,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-01-14 02:14:14,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-01-14 02:14:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-14 02:14:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:14:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:14,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:14:14,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:14,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:14:14,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:14,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-01-14 02:14:14,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:14,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2019-01-14 02:14:14,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:14,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:14:14,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-14 02:14:14,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:14,723 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-14 02:14:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-14 02:14:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 02:14:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-14 02:14:14,750 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-14 02:14:14,750 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-14 02:14:14,750 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:14:14,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-01-14 02:14:14,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:14,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:14,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:14,752 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:14:14,752 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:14,752 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2019-01-14 02:14:14,753 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 [2019-01-14 02:14:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2019-01-14 02:14:14,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:14,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:14,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:14:14,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:14:14,798 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-01-14 02:14:14,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:14,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:14,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:14,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:14,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:15,033 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:15,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:14:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:14:15,099 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:14:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:15,116 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-14 02:14:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:14:15,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-14 02:14:15,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:15,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-01-14 02:14:15,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:15,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:15,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-14 02:14:15,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:15,121 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-14 02:14:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-14 02:14:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 02:14:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-14 02:14:15,123 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:14:15,123 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:14:15,123 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:14:15,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-14 02:14:15,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:15,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:15,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:15,124 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:14:15,125 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:15,125 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2019-01-14 02:14:15,125 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 [2019-01-14 02:14:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2019-01-14 02:14:15,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:15,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:15,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:15,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:15,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:15,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-14 02:14:15,246 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-01-14 02:14:15,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:15,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:15,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:15,427 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:14:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:14:15,456 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-01-14 02:14:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:15,520 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-14 02:14:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:14:15,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:14:15,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:15,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-14 02:14:15,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:15,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:15,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-14 02:14:15,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:15,523 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:14:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-14 02:14:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:14:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:14:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-14 02:14:15,525 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:14:15,525 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-14 02:14:15,526 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:14:15,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-14 02:14:15,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:15,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:15,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:15,527 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-01-14 02:14:15,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:15,527 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2019-01-14 02:14:15,528 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 [2019-01-14 02:14:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2019-01-14 02:14:15,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:15,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:15,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:15,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:15,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:15,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:15,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:14:15,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:14:15,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:15,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:15,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:15,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 02:14:15,951 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-01-14 02:14:15,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:16,100 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:16,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:14:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:14:16,130 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-14 02:14:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:16,170 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-14 02:14:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:14:16,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-14 02:14:16,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:16,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2019-01-14 02:14:16,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:16,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:16,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2019-01-14 02:14:16,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:16,175 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-14 02:14:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2019-01-14 02:14:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-14 02:14:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:14:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-14 02:14:16,179 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-14 02:14:16,179 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-14 02:14:16,179 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:14:16,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2019-01-14 02:14:16,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:16,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:16,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:16,180 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2019-01-14 02:14:16,181 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:16,183 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2019-01-14 02:14:16,183 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 [2019-01-14 02:14:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2019-01-14 02:14:16,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:16,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:16,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:14:16,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 02:14:16,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:16,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:16,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:16,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 02:14:16,473 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-01-14 02:14:16,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:16,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:16,593 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:14:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:14:16,620 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-14 02:14:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:16,650 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-14 02:14:16,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:14:16,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-14 02:14:16,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:16,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 02:14:16,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:16,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:16,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2019-01-14 02:14:16,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:16,655 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:14:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2019-01-14 02:14:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 02:14:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:14:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-14 02:14:16,657 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 02:14:16,657 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 02:14:16,657 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:14:16,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-01-14 02:14:16,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:16,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:16,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:16,659 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2019-01-14 02:14:16,659 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:16,659 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2019-01-14 02:14:16,659 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 [2019-01-14 02:14:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2019-01-14 02:14:16,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:16,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:16,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:16,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:16,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:14:16,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:14:16,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:16,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:16,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:16,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 02:14:16,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2019-01-14 02:14:16,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:16,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:16,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:14:16,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:14:16,983 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2019-01-14 02:14:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:17,015 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-01-14 02:14:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:14:17,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-01-14 02:14:17,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:17,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-01-14 02:14:17,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:17,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:17,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-01-14 02:14:17,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:17,021 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 02:14:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-01-14 02:14:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 02:14:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:14:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-01-14 02:14:17,023 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-14 02:14:17,023 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-14 02:14:17,023 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:14:17,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-01-14 02:14:17,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:17,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:17,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:17,024 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2019-01-14 02:14:17,025 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:17,025 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2019-01-14 02:14:17,025 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 [2019-01-14 02:14:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2019-01-14 02:14:17,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:17,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:17,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:17,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:17,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:14:17,125 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 02:14:17,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:17,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:17,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:17,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 02:14:17,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2019-01-14 02:14:17,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:17,482 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:14:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:14:17,521 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-01-14 02:14:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:17,581 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-01-14 02:14:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:14:17,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-01-14 02:14:17,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:17,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2019-01-14 02:14:17,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:17,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:17,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-01-14 02:14:17,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:17,585 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 02:14:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-01-14 02:14:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 02:14:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:14:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-14 02:14:17,589 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:14:17,589 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 02:14:17,589 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:14:17,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-01-14 02:14:17,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:17,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:17,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:17,592 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2019-01-14 02:14:17,592 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:17,592 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2019-01-14 02:14:17,592 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 [2019-01-14 02:14:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2019-01-14 02:14:17,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:17,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:17,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:17,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:17,700 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:14:17,813 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 02:14:17,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:17,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:17,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:17,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 02:14:17,938 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2019-01-14 02:14:17,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:17,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,107 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:14:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:14:18,131 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-01-14 02:14:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:18,168 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-01-14 02:14:18,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:14:18,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2019-01-14 02:14:18,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:18,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2019-01-14 02:14:18,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:18,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:18,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-01-14 02:14:18,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:18,172 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-14 02:14:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-01-14 02:14:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-14 02:14:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:14:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-14 02:14:18,174 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 02:14:18,174 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 02:14:18,175 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:14:18,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-01-14 02:14:18,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:18,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:18,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:18,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2019-01-14 02:14:18,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:18,176 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2019-01-14 02:14:18,176 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 [2019-01-14 02:14:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2019-01-14 02:14:18,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:18,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:18,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:18,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:18,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:18,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:18,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:18,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:18,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:18,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 02:14:18,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2019-01-14 02:14:18,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,542 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:14:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:14:18,564 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2019-01-14 02:14:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:18,606 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-01-14 02:14:18,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:14:18,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-01-14 02:14:18,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:18,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-01-14 02:14:18,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:18,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:18,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-01-14 02:14:18,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:18,610 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-01-14 02:14:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-01-14 02:14:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 02:14:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:14:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-14 02:14:18,613 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 02:14:18,614 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 02:14:18,614 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:14:18,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-01-14 02:14:18,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:18,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:18,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:18,615 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2019-01-14 02:14:18,615 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:18,615 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2019-01-14 02:14:18,616 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 [2019-01-14 02:14:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2019-01-14 02:14:18,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:18,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:18,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:18,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:18,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:18,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:14:18,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:14:18,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:18,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:18,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:18,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 02:14:18,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2019-01-14 02:14:18,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:18,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:14:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:14:19,057 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-01-14 02:14:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:19,105 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-01-14 02:14:19,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:14:19,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-01-14 02:14:19,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:19,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-01-14 02:14:19,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:19,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:19,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-01-14 02:14:19,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:19,108 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-14 02:14:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-01-14 02:14:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 02:14:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:14:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-14 02:14:19,111 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-14 02:14:19,111 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-14 02:14:19,111 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:14:19,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-01-14 02:14:19,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:19,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:19,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:19,112 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2019-01-14 02:14:19,112 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:19,112 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2019-01-14 02:14:19,113 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 [2019-01-14 02:14:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2019-01-14 02:14:19,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:19,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:19,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:19,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:14:19,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 02:14:19,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:19,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:19,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:19,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 02:14:19,351 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2019-01-14 02:14:19,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,466 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-01-14 02:14:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:14:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:14:19,507 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-01-14 02:14:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:19,677 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-14 02:14:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:14:19,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-01-14 02:14:19,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:19,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 02:14:19,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:19,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:14:19,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2019-01-14 02:14:19,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:19,680 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 02:14:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2019-01-14 02:14:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-14 02:14:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 02:14:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 02:14:19,682 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 02:14:19,682 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 02:14:19,682 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:14:19,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-01-14 02:14:19,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:14:19,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:19,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:19,684 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2019-01-14 02:14:19,684 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:19,684 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2019-01-14 02:14:19,684 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 [2019-01-14 02:14:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2019-01-14 02:14:19,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:19,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2019-01-14 02:14:19,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2019-01-14 02:14:19,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:19,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:23,711 WARN L181 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 191 DAG size of output: 147 [2019-01-14 02:14:23,955 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 02:14:23,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:14:23 BoogieIcfgContainer [2019-01-14 02:14:23,995 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:14:23,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:14:23,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:14:23,995 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:14:23,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:12" (3/4) ... [2019-01-14 02:14:23,999 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:14:24,078 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:14:24,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:14:24,079 INFO L168 Benchmark]: Toolchain (without parser) took 12251.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 952.7 MB in the beginning and 919.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:24,082 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:24,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.62 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:24,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:24,085 INFO L168 Benchmark]: Boogie Preprocessor took 49.42 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:24,087 INFO L168 Benchmark]: RCFGBuilder took 453.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:24,088 INFO L168 Benchmark]: BuchiAutomizer took 11282.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 919.3 MB in the end (delta: 174.4 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:24,090 INFO L168 Benchmark]: Witness Printer took 83.14 ms. Allocated memory is still 1.2 GB. Free memory is still 919.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:24,096 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.16 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 331.62 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.42 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 453.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11282.18 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 919.3 MB in the end (delta: 174.4 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. * Witness Printer took 83.14 ms. Allocated memory is still 1.2 GB. Free memory is still 919.3 MB. There was no memory consumed. 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.2s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 10.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn60 mio100 lsp68 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=2279} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3b468106=0, NULL=0, \result=0, NULL=2279, n=10, i=7, a=2278, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a9d6576=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@396c4942=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@166be325=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42801953=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1c4f4e9e=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...