./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive/gcd01-1.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-30f4e4a [2019-11-28 00:24:13,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:24:13,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:24:13,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:24:13,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:24:13,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:24:13,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:24:13,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:24:13,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:24:13,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:24:13,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:24:13,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:24:13,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:24:13,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:24:13,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:24:13,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:24:13,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:24:13,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:24:13,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:24:13,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:24:13,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:24:13,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:24:13,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:24:13,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:24:13,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:24:13,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:24:13,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:24:13,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:24:13,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:24:13,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:24:13,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:24:13,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:24:13,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:24:13,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:24:13,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:24:13,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:24:13,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:24:13,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:24:13,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:24:13,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:24:13,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:24:13,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:24:13,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:24:13,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:24:13,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:24:13,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:24:13,632 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:24:13,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:24:13,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:24:13,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:24:13,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:24:13,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:24:13,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:24:13,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:24:13,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:24:13,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:24:13,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:24:13,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:24:13,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:24:13,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:24:13,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:24:13,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:24:13,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:24:13,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:24:13,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:24:13,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:24:13,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:24:13,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:24:13,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:24:13,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:24:13,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2019-11-28 00:24:13,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:24:13,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:24:13,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:24:13,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:24:13,968 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:24:13,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/gcd01-1.c [2019-11-28 00:24:14,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cc70e99/2d178152a7e34f5990da1e06e242df35/FLAGcc20bbd28 [2019-11-28 00:24:14,470 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:24:14,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd01-1.c [2019-11-28 00:24:14,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cc70e99/2d178152a7e34f5990da1e06e242df35/FLAGcc20bbd28 [2019-11-28 00:24:14,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83cc70e99/2d178152a7e34f5990da1e06e242df35 [2019-11-28 00:24:14,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:24:14,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:24:14,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:14,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:24:14,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:24:14,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:14" (1/1) ... [2019-11-28 00:24:14,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1035cb71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:14, skipping insertion in model container [2019-11-28 00:24:14,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:14" (1/1) ... [2019-11-28 00:24:14,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:24:14,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:24:15,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:15,127 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:24:15,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:15,163 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:24:15,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15 WrapperNode [2019-11-28 00:24:15,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:15,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:15,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:24:15,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:24:15,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:15,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:24:15,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:24:15,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:24:15,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (1/1) ... [2019-11-28 00:24:15,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:24:15,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:24:15,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:24:15,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:24:15,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (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 [2019-11-28 00:24:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-11-28 00:24:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-11-28 00:24:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:24:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:24:15,555 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:24:15,555 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:24:15,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:15 BoogieIcfgContainer [2019-11-28 00:24:15,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:24:15,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:24:15,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:24:15,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:24:15,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:24:14" (1/3) ... [2019-11-28 00:24:15,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752e04ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:15, skipping insertion in model container [2019-11-28 00:24:15,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:15" (2/3) ... [2019-11-28 00:24:15,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752e04ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:15, skipping insertion in model container [2019-11-28 00:24:15,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:15" (3/3) ... [2019-11-28 00:24:15,564 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2019-11-28 00:24:15,575 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:24:15,583 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:24:15,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:24:15,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:24:15,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:24:15,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:24:15,641 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:24:15,641 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:24:15,641 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:24:15,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:24:15,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:24:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-11-28 00:24:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:24:15,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:15,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:15,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash -540428153, now seen corresponding path program 1 times [2019-11-28 00:24:15,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:15,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592873125] [2019-11-28 00:24:15,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:24:16,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592873125] [2019-11-28 00:24:16,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:16,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:24:16,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91661465] [2019-11-28 00:24:16,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:24:16,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:24:16,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:24:16,023 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2019-11-28 00:24:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:16,175 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-11-28 00:24:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:24:16,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 00:24:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:16,186 INFO L225 Difference]: With dead ends: 36 [2019-11-28 00:24:16,187 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:24:16,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:24:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:24:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:24:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-28 00:24:16,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2019-11-28 00:24:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:16,234 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-28 00:24:16,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:24:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-11-28 00:24:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:24:16,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:16,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:16,236 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 999682999, now seen corresponding path program 1 times [2019-11-28 00:24:16,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:16,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391571769] [2019-11-28 00:24:16,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:24:16,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391571769] [2019-11-28 00:24:16,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:16,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:24:16,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502449180] [2019-11-28 00:24:16,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:24:16,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:24:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:24:16,314 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 6 states. [2019-11-28 00:24:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:16,391 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-28 00:24:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:24:16,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-28 00:24:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:16,392 INFO L225 Difference]: With dead ends: 26 [2019-11-28 00:24:16,393 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 00:24:16,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 00:24:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-28 00:24:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:24:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-28 00:24:16,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2019-11-28 00:24:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:16,401 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-28 00:24:16,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:24:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-11-28 00:24:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:24:16,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:16,403 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:16,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1243478463, now seen corresponding path program 1 times [2019-11-28 00:24:16,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:16,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791568554] [2019-11-28 00:24:16,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:24:16,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791568554] [2019-11-28 00:24:16,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:16,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:24:16,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568696939] [2019-11-28 00:24:16,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:24:16,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:24:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:16,567 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 7 states. [2019-11-28 00:24:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:16,723 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-11-28 00:24:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:16,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 00:24:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:16,727 INFO L225 Difference]: With dead ends: 32 [2019-11-28 00:24:16,727 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 00:24:16,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:24:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 00:24:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 00:24:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 00:24:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-28 00:24:16,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2019-11-28 00:24:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:16,741 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-28 00:24:16,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:24:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-11-28 00:24:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:24:16,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:16,744 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:16,745 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash -102281283, now seen corresponding path program 1 times [2019-11-28 00:24:16,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:16,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391158217] [2019-11-28 00:24:16,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:24:16,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391158217] [2019-11-28 00:24:16,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:16,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:24:16,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246906088] [2019-11-28 00:24:16,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:24:16,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:24:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:16,908 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 7 states. [2019-11-28 00:24:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:17,047 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 00:24:17,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:17,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 00:24:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:17,051 INFO L225 Difference]: With dead ends: 32 [2019-11-28 00:24:17,051 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 00:24:17,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:24:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 00:24:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-28 00:24:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:24:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-28 00:24:17,066 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 19 [2019-11-28 00:24:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:17,068 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 00:24:17,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:24:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-28 00:24:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 00:24:17,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:17,069 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:17,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1914749337, now seen corresponding path program 1 times [2019-11-28 00:24:17,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:17,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166529843] [2019-11-28 00:24:17,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:17,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166529843] [2019-11-28 00:24:17,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:17,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:24:17,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121012809] [2019-11-28 00:24:17,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:24:17,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:24:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:17,204 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2019-11-28 00:24:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:17,265 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-11-28 00:24:17,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:17,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-28 00:24:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:17,267 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:24:17,268 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 00:24:17,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 00:24:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-28 00:24:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 00:24:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-28 00:24:17,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 20 [2019-11-28 00:24:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:17,278 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-28 00:24:17,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:24:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-28 00:24:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 00:24:17,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:17,283 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:17,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash -675898105, now seen corresponding path program 1 times [2019-11-28 00:24:17,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:17,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463216141] [2019-11-28 00:24:17,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:24:17,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463216141] [2019-11-28 00:24:17,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:24:17,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343379753] [2019-11-28 00:24:17,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:24:17,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:24:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:17,377 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2019-11-28 00:24:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:17,449 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-28 00:24:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:17,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-28 00:24:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:17,451 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:24:17,451 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:24:17,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:24:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:24:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:24:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-28 00:24:17,459 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 20 [2019-11-28 00:24:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:17,459 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-28 00:24:17,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:24:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-28 00:24:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 00:24:17,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:17,461 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:17,462 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash -482715817, now seen corresponding path program 1 times [2019-11-28 00:24:17,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:17,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204393685] [2019-11-28 00:24:17,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 00:24:17,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204393685] [2019-11-28 00:24:17,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:17,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:24:17,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817293931] [2019-11-28 00:24:17,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:24:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:17,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:24:17,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:24:17,586 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 8 states. [2019-11-28 00:24:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:17,670 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-28 00:24:17,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:24:17,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-28 00:24:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:17,672 INFO L225 Difference]: With dead ends: 26 [2019-11-28 00:24:17,672 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:24:17,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:24:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:24:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:24:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:24:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:24:17,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-11-28 00:24:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:17,675 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:24:17,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:24:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:24:17,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:24:17,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:24:17,741 INFO L246 CegarLoopResult]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2019-11-28 00:24:17,741 INFO L246 CegarLoopResult]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2019-11-28 00:24:17,742 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (<= 1 gcd_~y1) (<= (+ gcd_~y1 1) gcd_~y2)) [2019-11-28 00:24:17,742 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 00:24:17,742 INFO L249 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2019-11-28 00:24:17,742 INFO L242 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (<= (+ gcd_~y2 1) gcd_~y1)) [2019-11-28 00:24:17,742 INFO L246 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point L30(lines 30 32) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:24:17,743 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:24:17,744 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 00:24:17,744 INFO L249 CegarLoopResult]: At program point L41(lines 28 43) the Hoare annotation is: true [2019-11-28 00:24:17,745 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 00:24:17,745 INFO L246 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-28 00:24:17,745 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~m~0) (<= 1 ULTIMATE.start_main_~n~0)) [2019-11-28 00:24:17,745 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 00:24:17,745 INFO L246 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-28 00:24:17,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:17 BoogieIcfgContainer [2019-11-28 00:24:17,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:17,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:17,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:17,758 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:17,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:15" (3/4) ... [2019-11-28 00:24:17,762 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:24:17,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2019-11-28 00:24:17,775 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:24:17,776 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:24:17,826 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:17,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:17,829 INFO L168 Benchmark]: Toolchain (without parser) took 2972.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 957.7 MB in the beginning and 922.6 MB in the end (delta: 35.1 MB). Peak memory consumption was 151.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,829 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:17,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.84 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.25 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:17,831 INFO L168 Benchmark]: Boogie Preprocessor took 93.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,832 INFO L168 Benchmark]: RCFGBuilder took 259.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,833 INFO L168 Benchmark]: TraceAbstraction took 2199.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 929.3 MB in the end (delta: 163.1 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,833 INFO L168 Benchmark]: Witness Printer took 68.99 ms. Allocated memory is still 1.1 GB. Free memory was 929.3 MB in the beginning and 922.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,837 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.84 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 37.25 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 259.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2199.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 929.3 MB in the end (delta: 163.1 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.99 ms. Allocated memory is still 1.1 GB. Free memory was 929.3 MB in the beginning and 922.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. 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 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 112 SDtfs, 96 SDslu, 351 SDs, 0 SdLazy, 300 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 11 PreInvPairs, 14 NumberOfFragments, 39 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 5212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 34/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...