./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0497b69437c9ebb889888bdb31aaefcc8eaad029 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:49:53,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:49:53,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:49:53,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:49:53,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:49:53,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:49:53,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:49:53,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:49:53,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:49:53,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:49:54,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:49:54,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:49:54,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:49:54,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:49:54,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:49:54,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:49:54,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:49:54,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:49:54,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:49:54,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:49:54,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:49:54,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:49:54,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:49:54,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:49:54,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:49:54,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:49:54,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:49:54,023 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:49:54,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:49:54,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:49:54,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:49:54,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:49:54,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:49:54,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:49:54,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:49:54,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:49:54,029 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:49:54,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:49:54,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:49:54,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:49:54,047 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:49:54,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:49:54,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:49:54,048 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:49:54,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:49:54,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:49:54,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:49:54,050 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:49:54,051 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:49:54,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:49:54,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:49:54,051 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:49:54,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:49:54,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:49:54,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:49:54,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:49:54,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:49:54,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:49:54,054 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:49:54,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:49:54,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:49:54,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0497b69437c9ebb889888bdb31aaefcc8eaad029 [2018-11-28 18:49:54,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:49:54,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:49:54,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:49:54,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:49:54,125 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:49:54,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:54,194 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38a260af/c4051d4b89534033b36e8a630b632859/FLAG07ee33dd4 [2018-11-28 18:49:54,694 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:49:54,695 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:54,702 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38a260af/c4051d4b89534033b36e8a630b632859/FLAG07ee33dd4 [2018-11-28 18:49:55,028 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38a260af/c4051d4b89534033b36e8a630b632859 [2018-11-28 18:49:55,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:49:55,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:49:55,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:55,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:49:55,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:49:55,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf57bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55, skipping insertion in model container [2018-11-28 18:49:55,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:49:55,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:49:55,292 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:55,299 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:49:55,327 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:55,346 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:49:55,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55 WrapperNode [2018-11-28 18:49:55,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:55,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:55,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:49:55,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:49:55,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:55,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:49:55,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:49:55,373 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:49:55,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (1/1) ... [2018-11-28 18:49:55,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:49:55,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:49:55,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:49:55,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:49:55,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:49:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:49:55,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:49:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-11-28 18:49:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-11-28 18:49:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:49:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:49:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:49:55,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:49:56,090 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:49:56,090 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:49:56,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:56 BoogieIcfgContainer [2018-11-28 18:49:56,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:49:56,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:49:56,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:49:56,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:49:56,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:49:55" (1/3) ... [2018-11-28 18:49:56,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b58406a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:56, skipping insertion in model container [2018-11-28 18:49:56,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:55" (2/3) ... [2018-11-28 18:49:56,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b58406a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:56, skipping insertion in model container [2018-11-28 18:49:56,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:56" (3/3) ... [2018-11-28 18:49:56,100 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd01_true-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:56,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:49:56,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:49:56,139 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:49:56,171 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:49:56,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:49:56,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:49:56,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:49:56,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:49:56,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:49:56,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:49:56,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:49:56,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:49:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-28 18:49:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:49:56,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:56,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:56,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:56,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1001932622, now seen corresponding path program 1 times [2018-11-28 18:49:56,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:56,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:56,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:56,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:56,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:49:56,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:49:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:49:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:56,521 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2018-11-28 18:49:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:56,801 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-28 18:49:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:49:56,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 18:49:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:56,814 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:49:56,814 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 18:49:56,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:49:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 18:49:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-28 18:49:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 18:49:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-28 18:49:56,861 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2018-11-28 18:49:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:56,861 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 18:49:56,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:49:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-28 18:49:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:49:56,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:56,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:56,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:56,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash -423841111, now seen corresponding path program 1 times [2018-11-28 18:49:56,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:56,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:57,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:57,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:49:57,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:49:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:49:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:57,016 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-11-28 18:49:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:57,170 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-28 18:49:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:49:57,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 18:49:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:57,172 INFO L225 Difference]: With dead ends: 30 [2018-11-28 18:49:57,173 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:49:57,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:49:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:49:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-28 18:49:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 18:49:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-28 18:49:57,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2018-11-28 18:49:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:57,184 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 18:49:57,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:49:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-28 18:49:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 18:49:57,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:57,187 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:57,187 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:57,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1280495258, now seen corresponding path program 1 times [2018-11-28 18:49:57,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:57,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:57,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:49:57,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:57,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:49:57,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:49:57,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:49:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:57,491 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2018-11-28 18:49:57,653 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 18:49:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:57,838 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-28 18:49:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:49:57,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-28 18:49:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:57,843 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:49:57,843 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:49:57,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:49:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:49:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-28 18:49:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 18:49:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-28 18:49:57,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2018-11-28 18:49:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:57,856 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 18:49:57,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:49:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-28 18:49:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 18:49:57,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:57,859 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:57,859 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:57,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712292, now seen corresponding path program 1 times [2018-11-28 18:49:57,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:57,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:57,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:49:58,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:58,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:49:58,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:49:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:49:58,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:49:58,039 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2018-11-28 18:49:58,322 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 18:49:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:58,604 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 18:49:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:49:58,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-28 18:49:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:58,609 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:49:58,609 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:49:58,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:49:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:49:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-28 18:49:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 18:49:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-28 18:49:58,617 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2018-11-28 18:49:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:58,617 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 18:49:58,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:49:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-28 18:49:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 18:49:58,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:58,619 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:58,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:58,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1139697511, now seen corresponding path program 1 times [2018-11-28 18:49:58,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:58,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:49:58,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:58,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:49:58,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:49:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:49:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:49:58,717 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2018-11-28 18:49:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:58,815 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-28 18:49:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:49:58,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 18:49:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:58,817 INFO L225 Difference]: With dead ends: 31 [2018-11-28 18:49:58,817 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 18:49:58,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:49:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 18:49:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-28 18:49:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 18:49:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-28 18:49:58,826 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2018-11-28 18:49:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:58,826 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-28 18:49:58,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:49:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-28 18:49:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 18:49:58,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:58,828 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:58,829 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:58,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash 99153721, now seen corresponding path program 1 times [2018-11-28 18:49:58,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:58,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:58,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:58,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:49:58,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:58,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:49:58,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:49:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:49:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:49:58,938 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2018-11-28 18:49:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:59,027 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-28 18:49:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:49:59,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 18:49:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:59,030 INFO L225 Difference]: With dead ends: 34 [2018-11-28 18:49:59,030 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:49:59,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:49:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:49:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 18:49:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:49:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-28 18:49:59,038 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2018-11-28 18:49:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:59,038 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-28 18:49:59,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:49:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-28 18:49:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 18:49:59,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:59,040 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:59,040 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:59,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash 10057033, now seen corresponding path program 1 times [2018-11-28 18:49:59,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:59,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 18:49:59,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:59,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:49:59,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:49:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:49:59,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:59,204 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2018-11-28 18:49:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:59,323 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-28 18:49:59,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:49:59,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-28 18:49:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:59,325 INFO L225 Difference]: With dead ends: 30 [2018-11-28 18:49:59,325 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:49:59,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:49:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:49:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:49:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:49:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:49:59,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-28 18:49:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:59,327 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:49:59,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:49:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:49:59,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:49:59,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:49:59,464 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:49:59,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:49:59,465 INFO L448 ceAbstractionStarter]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2018-11-28 18:49:59,465 INFO L448 ceAbstractionStarter]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2018-11-28 18:49:59,467 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= |gcd_#in~y2| gcd_~y2) (<= 1 gcd_~y1) (<= |gcd_#in~y1| gcd_~y1) (< gcd_~y1 gcd_~y2)) [2018-11-28 18:49:59,467 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-28 18:49:59,467 INFO L451 ceAbstractionStarter]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2018-11-28 18:49:59,467 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= |gcd_#in~y2| gcd_~y2) (<= 1 gcd_~y2) (<= (+ gcd_~y2 1) gcd_~y1) (<= |gcd_#in~y1| gcd_~y1)) [2018-11-28 18:49:59,467 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-11-28 18:49:59,467 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 18:49:59,468 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2018-11-28 18:49:59,468 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-11-28 18:49:59,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:49:59,468 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:49:59,468 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:49:59,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:49:59,468 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. [2018-11-28 18:49:59,469 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2018-11-28 18:49:59,469 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-28 18:49:59,469 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 28 43) no Hoare annotation was computed. [2018-11-28 18:49:59,469 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-28 18:49:59,469 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2018-11-28 18:49:59,469 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2018-11-28 18:49:59,469 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 28 43) no Hoare annotation was computed. [2018-11-28 18:49:59,470 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-11-28 18:49:59,470 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-28 18:49:59,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:49:59 BoogieIcfgContainer [2018-11-28 18:49:59,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:49:59,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:49:59,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:49:59,474 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:49:59,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:56" (3/4) ... [2018-11-28 18:49:59,479 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:49:59,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:49:59,487 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-11-28 18:49:59,487 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:49:59,493 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 18:49:59,494 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 18:49:59,494 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:49:59,564 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:49:59,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:49:59,568 INFO L168 Benchmark]: Toolchain (without parser) took 4535.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.0 MB in the beginning and 962.8 MB in the end (delta: -16.8 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:59,572 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:59,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.83 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:59,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.50 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:59,573 INFO L168 Benchmark]: Boogie Preprocessor took 36.54 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:59,578 INFO L168 Benchmark]: RCFGBuilder took 681.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:59,578 INFO L168 Benchmark]: TraceAbstraction took 3381.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 962.8 MB in the end (delta: 147.3 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:59,579 INFO L168 Benchmark]: Witness Printer took 92.81 ms. Allocated memory is still 1.2 GB. Free memory is still 962.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:59,584 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.83 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 25.50 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.54 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 681.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3381.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 962.8 MB in the end (delta: 147.3 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. * Witness Printer took 92.81 ms. Allocated memory is still 1.2 GB. Free memory is still 962.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 85 SDslu, 501 SDs, 0 SdLazy, 291 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 14 NumberOfFragments, 40 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 6726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 34/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...