java -ea -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:29:57,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:29:57,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:29:57,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:29:57,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:29:57,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:29:57,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:29:57,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:29:57,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:29:57,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:29:57,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:29:57,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:29:57,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:29:57,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:29:57,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:29:57,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:29:57,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:29:57,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:29:57,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:29:57,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:29:57,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:29:57,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:29:57,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:29:57,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:29:57,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:29:57,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:29:57,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:29:57,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:29:57,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:29:57,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:29:57,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:29:57,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:29:57,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:29:57,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:29:57,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:29:57,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:29:57,559 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:29:57,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:29:57,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:29:57,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:29:57,576 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:29:57,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:29:57,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:29:57,577 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:29:57,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:29:57,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:29:57,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:29:57,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:29:57,578 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:29:57,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:29:57,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:29:57,579 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:29:57,579 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:29:57,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:29:57,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:29:57,580 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:29:57,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:29:57,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:29:57,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:29:57,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:29:57,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:29:57,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:29:57,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:29:57,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:29:57,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:29:57,582 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:29:57,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:29:57,582 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:29:57,582 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:29:57,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:29:57,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:29:57,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:29:57,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:29:57,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:29:57,662 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:29:57,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-23 11:29:57,730 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3278b38c3/47250a22d96c4f60b5c4b15f4f45fcf7/FLAG65e81db5f [2018-11-23 11:29:58,180 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:29:58,181 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-23 11:29:58,186 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3278b38c3/47250a22d96c4f60b5c4b15f4f45fcf7/FLAG65e81db5f [2018-11-23 11:29:58,528 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3278b38c3/47250a22d96c4f60b5c4b15f4f45fcf7 [2018-11-23 11:29:58,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:29:58,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:29:58,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:58,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:29:58,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:29:58,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c04f9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58, skipping insertion in model container [2018-11-23 11:29:58,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:29:58,596 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:29:58,833 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:58,839 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:29:58,859 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:58,877 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:29:58,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58 WrapperNode [2018-11-23 11:29:58,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:58,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:58,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:29:58,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:29:58,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:58,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:29:58,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:29:58,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:29:58,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2018-11-23 11:29:58,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:29:58,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:29:58,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:29:58,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:29:58,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (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-23 11:29:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:29:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:29:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:29:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:29:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:29:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:29:59,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:29:59,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:29:59,692 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:29:59,692 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:29:59,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:59 BoogieIcfgContainer [2018-11-23 11:29:59,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:29:59,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:29:59,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:29:59,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:29:59,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:58" (1/3) ... [2018-11-23 11:29:59,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:59, skipping insertion in model container [2018-11-23 11:29:59,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (2/3) ... [2018-11-23 11:29:59,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:59, skipping insertion in model container [2018-11-23 11:29:59,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:59" (3/3) ... [2018-11-23 11:29:59,702 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call2_false-termination.i [2018-11-23 11:29:59,712 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:29:59,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:29:59,737 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:29:59,772 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:29:59,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:29:59,773 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:29:59,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:29:59,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:29:59,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:29:59,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:29:59,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:29:59,774 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:29:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:29:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:29:59,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:59,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:59,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:59,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:59,808 INFO L82 PathProgramCache]: Analyzing trace with hash -133618162, now seen corresponding path program 1 times [2018-11-23 11:29:59,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:59,813 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:59,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:59,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:59,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:29:59,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:29:59,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2018-11-23 11:29:59,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret3 := main(); {22#true} is VALID [2018-11-23 11:29:59,984 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 1bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {22#true} is VALID [2018-11-23 11:29:59,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!~bvugt32(~y~0, 0bv32); {22#true} is VALID [2018-11-23 11:29:59,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 11:29:59,996 INFO L256 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-23 11:29:59,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 11:29:59,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:29:59,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:30:00,000 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-23 11:30:00,000 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:00,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:00,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:30:00,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:30:00,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:00,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:30:00,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:00,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:30:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:30:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:30:00,079 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 11:30:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:00,255 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 11:30:00,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:30:00,255 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 11:30:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:30:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 11:30:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:30:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 11:30:00,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 11:30:00,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:00,629 INFO L225 Difference]: With dead ends: 30 [2018-11-23 11:30:00,629 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:30:00,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:30:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:30:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:30:00,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:00,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:30:00,671 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:30:00,671 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:30:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:00,674 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:30:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:30:00,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:00,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:00,675 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:30:00,675 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:30:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:00,678 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:30:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:30:00,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:00,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:00,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:00,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:30:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 11:30:00,684 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-11-23 11:30:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:00,684 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 11:30:00,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:30:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:30:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:30:00,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:00,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:00,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:00,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -142853372, now seen corresponding path program 1 times [2018-11-23 11:30:00,687 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:00,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:00,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:01,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2018-11-23 11:30:01,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2018-11-23 11:30:01,119 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #41#return; {141#true} is VALID [2018-11-23 11:30:01,120 INFO L256 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2018-11-23 11:30:01,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {141#true} ~x~0 := 1bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {158#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:01,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {158#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvugt32(~y~0, 0bv32); {162#(and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:01,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {162#(and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvult32(~x~0, ~y~0); {166#(and (bvugt main_~y~0 (_ bv0 32)) (not (bvult main_~x~0 main_~y~0)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:30:01,136 INFO L256 TraceCheckUtils]: 7: Hoare triple {166#(and (bvugt main_~y~0 (_ bv0 32)) (not (bvult main_~x~0 main_~y~0)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1bv32 else 0bv32)); {170#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:01,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {170#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {174#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:01,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {174#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {142#false} is VALID [2018-11-23 11:30:01,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {142#false} assume !false; {142#false} is VALID [2018-11-23 11:30:01,141 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-23 11:30:01,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:01,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:01,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:30:01,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 11:30:01,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:01,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:30:01,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:01,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:30:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:30:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:30:01,171 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-11-23 11:30:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:02,296 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:30:02,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:30:02,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 11:30:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:30:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 11:30:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:30:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 11:30:02,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-11-23 11:30:02,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:02,447 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:30:02,447 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:30:02,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:30:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:30:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:30:02,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:02,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:02,458 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:02,458 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:02,461 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 11:30:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 11:30:02,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:02,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:02,462 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:02,462 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:30:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:02,464 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 11:30:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 11:30:02,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:02,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:02,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:02,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:30:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 11:30:02,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2018-11-23 11:30:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:02,467 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 11:30:02,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:30:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 11:30:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:30:02,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:02,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:02,469 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:02,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1289453439, now seen corresponding path program 1 times [2018-11-23 11:30:02,470 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:02,470 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:30:02,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:02,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:02,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {265#true} is VALID [2018-11-23 11:30:02,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {265#true} assume true; {265#true} is VALID [2018-11-23 11:30:02,709 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {265#true} {265#true} #41#return; {265#true} is VALID [2018-11-23 11:30:02,710 INFO L256 TraceCheckUtils]: 3: Hoare triple {265#true} call #t~ret3 := main(); {265#true} is VALID [2018-11-23 11:30:02,710 INFO L273 TraceCheckUtils]: 4: Hoare triple {265#true} ~x~0 := 1bv32;~y~0 := #t~nondet1;havoc #t~nondet1; {282#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:02,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {282#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvugt32(~y~0, 0bv32); {282#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:02,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {282#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, ~y~0); {289#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvult main_~x~0 main_~y~0))} is VALID [2018-11-23 11:30:02,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {289#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvult main_~x~0 main_~y~0))} assume !~bvult32(~x~0, ~bvudiv32(~y~0, ~x~0));#t~post2 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {266#false} is VALID [2018-11-23 11:30:02,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {266#false} assume !~bvult32(~x~0, ~y~0); {266#false} is VALID [2018-11-23 11:30:02,723 INFO L256 TraceCheckUtils]: 9: Hoare triple {266#false} call __VERIFIER_assert((if ~x~0 == ~y~0 then 1bv32 else 0bv32)); {266#false} is VALID [2018-11-23 11:30:02,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {266#false} ~cond := #in~cond; {266#false} is VALID [2018-11-23 11:30:02,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {266#false} assume 0bv32 == ~cond; {266#false} is VALID [2018-11-23 11:30:02,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {266#false} assume !false; {266#false} is VALID [2018-11-23 11:30:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:02,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:30:02,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:30:02,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:02,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:30:02,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:02,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:30:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:30:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:30:02,781 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2018-11-23 11:30:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:02,867 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:30:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:30:02,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 11:30:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:30:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 11:30:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:30:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 11:30:02,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 11:30:02,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:02,959 INFO L225 Difference]: With dead ends: 16 [2018-11-23 11:30:02,959 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:30:02,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:30:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:30:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:30:02,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:02,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:02,960 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:02,961 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:02,961 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:02,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:02,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:02,962 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:02,962 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:30:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:02,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:30:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:02,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:02,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:02,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:02,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:30:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:30:02,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 11:30:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:02,964 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:30:02,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:30:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:30:02,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:02,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:30:03,295 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:30:03,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:03,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:30:03,296 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:30:03,296 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:30:03,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:30:03,297 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 22) the Hoare annotation is: true [2018-11-23 11:30:03,297 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2018-11-23 11:30:03,297 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2018-11-23 11:30:03,297 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-23 11:30:03,297 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (bvugt main_~y~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:30:03,297 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2018-11-23 11:30:03,298 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 20) the Hoare annotation is: (and (bvugt main_~y~0 (_ bv0 32)) (not (bvult main_~x~0 main_~y~0)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:30:03,298 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 11:30:03,298 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 11:30:03,298 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:30:03,298 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 11:30:03,299 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 11:30:03,299 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:30:03,301 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:03,301 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:30:03,301 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:30:03,301 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:30:03,302 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:03,305 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:30:03,305 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:30:03,305 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 11:30:03,306 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 11:30:03,306 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:30:03,306 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:30:03,306 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:30:03,306 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:30:03,306 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:30:03,306 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:30:03,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:03 BoogieIcfgContainer [2018-11-23 11:30:03,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:30:03,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:30:03,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:30:03,316 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:30:03,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:59" (3/4) ... [2018-11-23 11:30:03,321 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:30:03,327 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:30:03,327 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:30:03,327 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:30:03,332 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:30:03,332 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:30:03,332 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:30:03,381 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/phases_true-unreach-call2_false-termination.i-witness.graphml [2018-11-23 11:30:03,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:30:03,384 INFO L168 Benchmark]: Toolchain (without parser) took 4839.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -611.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:03,385 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:03,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:03,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:03,387 INFO L168 Benchmark]: Boogie Preprocessor took 32.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:03,388 INFO L168 Benchmark]: RCFGBuilder took 755.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:03,389 INFO L168 Benchmark]: TraceAbstraction took 3620.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 143.3 MB). Peak memory consumption was 143.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:30:03,389 INFO L168 Benchmark]: Witness Printer took 66.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:30:03,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 755.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3620.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 143.3 MB). Peak memory consumption was 143.3 MB. Max. memory is 7.1 GB. * Witness Printer took 66.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 14]: Loop Invariant Derived loop invariant: ~bvugt32(y, 0bv32) && ~bvadd64(x, 4294967295bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 5 SDslu, 38 SDs, 0 SdLazy, 36 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 27 HoareAnnotationTreeSize, 9 FomulaSimplifications, 13 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 SizeOfPredicates, 2 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...