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_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:27,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:27,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:27,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:27,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:27,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:27,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:27,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:27,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:27,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:27,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:27,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:27,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:27,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:27,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:27,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:27,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:27,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:27,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:27,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:27,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:27,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:27,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:27,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:27,565 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:27,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:27,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:27,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:27,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:27,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:27,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:27,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:27,572 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:27,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:27,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:27,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:27,576 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:12:27,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:27,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:27,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:27,600 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:27,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:27,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:27,602 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:27,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:27,604 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:27,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:27,604 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:27,604 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:27,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:27,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:27,605 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:27,605 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:27,605 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:27,605 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:27,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:27,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:27,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:27,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:27,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:27,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:27,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:27,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:27,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:27,607 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:27,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:27,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:27,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:27,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:27,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:27,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:27,684 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:27,684 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:27,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call_true-termination.c.i [2018-11-23 13:12:27,746 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc0d67b7/16a781d32cb649699ca4345a81219647/FLAGbe9b381f1 [2018-11-23 13:12:28,222 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:28,223 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call_true-termination.c.i [2018-11-23 13:12:28,230 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc0d67b7/16a781d32cb649699ca4345a81219647/FLAGbe9b381f1 [2018-11-23 13:12:28,588 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc0d67b7/16a781d32cb649699ca4345a81219647 [2018-11-23 13:12:28,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:28,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:28,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:28,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:28,606 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:28,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3ccf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28, skipping insertion in model container [2018-11-23 13:12:28,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:28,646 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:28,901 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:28,905 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:28,927 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:28,943 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:28,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28 WrapperNode [2018-11-23 13:12:28,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:28,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:28,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:28,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:28,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:28,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:28,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:28,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:28,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (1/1) ... [2018-11-23 13:12:28,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:29,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:29,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:29,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:29,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (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 13:12:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:29,645 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:29,645 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:29,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:29 BoogieIcfgContainer [2018-11-23 13:12:29,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:29,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:29,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:29,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:29,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:28" (1/3) ... [2018-11-23 13:12:29,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350c9f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:29, skipping insertion in model container [2018-11-23 13:12:29,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:28" (2/3) ... [2018-11-23 13:12:29,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350c9f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:29, skipping insertion in model container [2018-11-23 13:12:29,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:29" (3/3) ... [2018-11-23 13:12:29,654 INFO L112 eAbstractionObserver]: Analyzing ICFG gsv2008_true-unreach-call_true-termination.c.i [2018-11-23 13:12:29,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:29,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:29,688 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:29,721 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:29,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:29,723 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:29,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:29,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:29,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:29,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:29,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:29,726 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:12:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:29,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:29,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:29,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:29,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:29,766 INFO L82 PathProgramCache]: Analyzing trace with hash 578729635, now seen corresponding path program 1 times [2018-11-23 13:12:29,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:29,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:29,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:29,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:12:29,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:12:29,924 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #36#return; {22#true} is VALID [2018-11-23 13:12:29,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret3 := main(); {22#true} is VALID [2018-11-23 13:12:29,924 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {22#true} is VALID [2018-11-23 13:12:29,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {22#true} is VALID [2018-11-23 13:12:29,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:12:29,940 INFO L256 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:12:29,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:12:29,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:12:29,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:12:29,946 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 13:12:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:29,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:29,953 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:12:29,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:29,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:30,009 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 13:12:30,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:30,022 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:12:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,106 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:12:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:30,107 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:12:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:12:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:12:30,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 13:12:30,352 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 13:12:30,363 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:12:30,364 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:12:30,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:12:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:12:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:12:30,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:30,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:30,480 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:30,480 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,483 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:30,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:30,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:30,484 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:30,484 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,488 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:30,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:30,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:30,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:30,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:12:30,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2018-11-23 13:12:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:30,494 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:12:30,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:30,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:30,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:30,495 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:30,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,496 INFO L82 PathProgramCache]: Analyzing trace with hash 575035551, now seen corresponding path program 1 times [2018-11-23 13:12:30,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:30,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:30,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {109#true} call ULTIMATE.init(); {109#true} is VALID [2018-11-23 13:12:30,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#true} assume true; {109#true} is VALID [2018-11-23 13:12:30,590 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {109#true} {109#true} #36#return; {109#true} is VALID [2018-11-23 13:12:30,590 INFO L256 TraceCheckUtils]: 3: Hoare triple {109#true} call #t~ret3 := main(); {109#true} is VALID [2018-11-23 13:12:30,608 INFO L273 TraceCheckUtils]: 4: Hoare triple {109#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {111#(<= (+ main_~x~0 50) 0)} is VALID [2018-11-23 13:12:30,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {111#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {111#(<= (+ main_~x~0 50) 0)} is VALID [2018-11-23 13:12:30,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(<= (+ main_~x~0 50) 0)} assume !(~x~0 < 0); {110#false} is VALID [2018-11-23 13:12:30,612 INFO L256 TraceCheckUtils]: 7: Hoare triple {110#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {110#false} is VALID [2018-11-23 13:12:30,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {110#false} ~cond := #in~cond; {110#false} is VALID [2018-11-23 13:12:30,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {110#false} assume 0 == ~cond; {110#false} is VALID [2018-11-23 13:12:30,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {110#false} assume !false; {110#false} is VALID [2018-11-23 13:12:30,614 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 13:12:30,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:30,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:30,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 13:12:30,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:30,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:30,695 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 13:12:30,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:30,696 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-23 13:12:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,747 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:30,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 13:12:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 13:12:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 13:12:30,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2018-11-23 13:12:30,810 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 13:12:30,811 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:12:30,812 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:12:30,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:12:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:12:30,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:30,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:30,887 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:30,887 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,889 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:12:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:30,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:30,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:30,890 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:30,890 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,892 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:12:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:30,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:30,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:30,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:30,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:12:30,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:12:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:30,895 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:12:30,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:30,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:30,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:30,896 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:30,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash 681770644, now seen corresponding path program 1 times [2018-11-23 13:12:30,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:30,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:31,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:12:31,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:12:31,100 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #36#return; {189#true} is VALID [2018-11-23 13:12:31,101 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret3 := main(); {189#true} is VALID [2018-11-23 13:12:31,101 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {191#(<= (+ main_~x~0 50) 0)} is VALID [2018-11-23 13:12:31,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {191#(<= (+ main_~x~0 50) 0)} is VALID [2018-11-23 13:12:31,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {192#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2018-11-23 13:12:31,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(<= (+ main_~x~0 51) main_~y~0)} assume !(~x~0 < 0); {193#(<= 51 main_~y~0)} is VALID [2018-11-23 13:12:31,109 INFO L256 TraceCheckUtils]: 8: Hoare triple {193#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {194#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:31,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {195#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:31,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {195#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:12:31,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:12:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:31,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:31,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:31,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:31,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:31,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:12:31,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:12:31,704 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #36#return; {189#true} is VALID [2018-11-23 13:12:31,704 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret3 := main(); {189#true} is VALID [2018-11-23 13:12:31,705 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {189#true} is VALID [2018-11-23 13:12:31,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {189#true} is VALID [2018-11-23 13:12:31,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#true} assume !!(~x~0 < 0);~x~0 := ~x~0 + ~y~0;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {217#(<= (+ main_~x~0 2) main_~y~0)} is VALID [2018-11-23 13:12:31,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(<= (+ main_~x~0 2) main_~y~0)} assume !(~x~0 < 0); {221#(<= 2 main_~y~0)} is VALID [2018-11-23 13:12:31,708 INFO L256 TraceCheckUtils]: 8: Hoare triple {221#(<= 2 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {194#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:31,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {195#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:31,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {195#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:12:31,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:12:31,717 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 13:12:31,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:12:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:12:31,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-11-23 13:12:31,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:31,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:12:31,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:31,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:12:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:12:31,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:12:31,810 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2018-11-23 13:12:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:32,260 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 13:12:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:32,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-11-23 13:12:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-11-23 13:12:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-11-23 13:12:32,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2018-11-23 13:12:32,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:32,335 INFO L225 Difference]: With dead ends: 15 [2018-11-23 13:12:32,336 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:32,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:12:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:32,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:32,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:32,339 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:32,339 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:32,342 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:32,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:32,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:32,343 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:32,343 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:32,343 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:32,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:32,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:32,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:32,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:32,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-11-23 13:12:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:32,349 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:32,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:12:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:32,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:32,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:32,517 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:32,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:32,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:32,518 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:32,518 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:32,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:32,519 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 21) the Hoare annotation is: true [2018-11-23 13:12:32,519 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 21) no Hoare annotation was computed. [2018-11-23 13:12:32,519 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 13:12:32,519 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:12:32,520 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 18) the Hoare annotation is: (or (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 2) main_~y~0)) [2018-11-23 13:12:32,520 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 21) no Hoare annotation was computed. [2018-11-23 13:12:32,520 INFO L444 ceAbstractionStarter]: At program point L15-3(lines 15 18) the Hoare annotation is: (and (<= (+ main_~x~0 2) main_~y~0) (<= 2 main_~y~0)) [2018-11-23 13:12:32,520 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:32,521 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:32,521 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:32,521 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:32,521 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:32,521 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:32,523 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:32,523 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:32,524 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:32,525 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:32,525 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:32,527 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:32,527 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:32,528 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:32,528 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:32,528 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:12:32,528 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:32,528 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:12:32,528 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:32,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:32 BoogieIcfgContainer [2018-11-23 13:12:32,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:32,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:32,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:32,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:32,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:29" (3/4) ... [2018-11-23 13:12:32,543 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:32,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:32,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:32,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:32,555 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:12:32,555 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:12:32,555 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:32,604 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/gsv2008_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:32,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:32,606 INFO L168 Benchmark]: Toolchain (without parser) took 4006.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -615.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,608 INFO L168 Benchmark]: CDTParser took 0.20 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 13:12:32,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.43 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.49 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 13:12:32,611 INFO L168 Benchmark]: Boogie Preprocessor took 29.68 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 13:12:32,611 INFO L168 Benchmark]: RCFGBuilder took 641.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,612 INFO L168 Benchmark]: TraceAbstraction took 2890.99 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: 140.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,613 INFO L168 Benchmark]: Witness Printer took 66.85 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 13:12:32,620 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.20 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 343.43 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.49 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 29.68 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 641.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2890.99 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: 140.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 7.1 GB. * Witness Printer took 66.85 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: 5]: 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: 15]: Loop Invariant Derived loop invariant: x + 50 <= 0 || x + 2 <= y - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 3 SDslu, 46 SDs, 0 SdLazy, 36 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 25 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 830 SizeOfPredicates, 3 NumberOfNonLiveVariables, 33 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...