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/loops/terminator_03_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:34,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:34,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:34,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:34,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:34,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:34,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:34,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:34,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:34,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:34,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:34,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:34,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:34,676 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:34,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:34,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:34,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:34,681 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:34,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:34,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:34,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:34,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:34,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:34,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:34,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:34,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:34,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:34,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:34,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:34,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:34,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:34,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:34,709 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:34,709 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:34,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:34,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:34,713 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:04:34,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:34,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:34,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:34,744 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:34,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:34,744 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:34,745 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:34,745 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:34,745 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:34,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:34,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:34,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:34,746 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:34,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:34,746 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:34,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:34,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:34,747 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:34,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:34,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:34,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:34,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:34,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:34,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:34,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:34,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:34,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:34,749 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:34,749 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:34,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:34,749 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:34,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:34,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:34,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:34,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:34,826 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:34,827 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/terminator_03_true-unreach-call_true-termination.i [2018-11-23 13:04:34,876 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b10f1401/80e9a61ce5314166a51da145271d167e/FLAG63f77dcd9 [2018-11-23 13:04:35,316 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:35,317 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/terminator_03_true-unreach-call_true-termination.i [2018-11-23 13:04:35,324 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b10f1401/80e9a61ce5314166a51da145271d167e/FLAG63f77dcd9 [2018-11-23 13:04:35,650 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b10f1401/80e9a61ce5314166a51da145271d167e [2018-11-23 13:04:35,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:35,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:35,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:35,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:35,665 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:35,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:35,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e55024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35, skipping insertion in model container [2018-11-23 13:04:35,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:35,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:35,711 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:35,944 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:35,948 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:35,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:35,981 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:35,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35 WrapperNode [2018-11-23 13:04:35,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:35,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:35,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:35,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:35,992 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:04:35" (1/1) ... [2018-11-23 13:04:35,997 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:04:35" (1/1) ... [2018-11-23 13:04:36,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:36,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:36,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:36,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:36,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (1/1) ... [2018-11-23 13:04:36,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:36,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:36,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:36,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:36,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (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:04:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:36,623 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:36,624 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:36,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:36 BoogieIcfgContainer [2018-11-23 13:04:36,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:36,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:36,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:36,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:36,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:35" (1/3) ... [2018-11-23 13:04:36,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d0f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:36, skipping insertion in model container [2018-11-23 13:04:36,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:35" (2/3) ... [2018-11-23 13:04:36,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d0f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:36, skipping insertion in model container [2018-11-23 13:04:36,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:36" (3/3) ... [2018-11-23 13:04:36,634 INFO L112 eAbstractionObserver]: Analyzing ICFG terminator_03_true-unreach-call_true-termination.i [2018-11-23 13:04:36,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:36,650 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:36,667 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:36,700 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:36,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:36,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:36,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:36,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:36,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:36,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:36,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:36,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:04:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:04:36,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:36,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:36,730 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:36,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:36,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1995182865, now seen corresponding path program 1 times [2018-11-23 13:04:36,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:36,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:36,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 13:04:36,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 13:04:36,988 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #42#return; {23#true} is VALID [2018-11-23 13:04:36,988 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-23 13:04:36,989 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-23 13:04:36,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~y~0 <= 1000000); {23#true} is VALID [2018-11-23 13:04:36,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !(~y~0 > 0); {25#(<= main_~y~0 0)} is VALID [2018-11-23 13:04:36,999 INFO L256 TraceCheckUtils]: 7: Hoare triple {25#(<= main_~y~0 0)} call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 > 0 && ~x~0 >= 100) then 1 else 0)); {26#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:04:37,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:37,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24#false} is VALID [2018-11-23 13:04:37,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 13:04:37,005 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:04:37,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:37,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:37,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:04:37,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:37,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:37,097 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:04:37,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:37,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:37,111 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 13:04:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:37,854 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 13:04:37,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:37,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:04:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 13:04:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 13:04:37,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2018-11-23 13:04:38,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,151 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:04:38,152 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:04:38,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:04:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:04:38,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:38,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:38,195 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:38,195 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,198 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:04:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:38,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,200 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:38,200 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,202 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:04:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:38,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:38,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:04:38,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:04:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:38,207 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:04:38,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:38,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:38,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:38,209 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:38,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2146425897, now seen corresponding path program 1 times [2018-11-23 13:04:38,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:38,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:38,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:38,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2018-11-23 13:04:38,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2018-11-23 13:04:38,337 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #42#return; {129#true} is VALID [2018-11-23 13:04:38,337 INFO L256 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret2 := main(); {129#true} is VALID [2018-11-23 13:04:38,338 INFO L273 TraceCheckUtils]: 4: Hoare triple {129#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {129#true} is VALID [2018-11-23 13:04:38,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {129#true} assume !!(~y~0 <= 1000000); {129#true} is VALID [2018-11-23 13:04:38,338 INFO L273 TraceCheckUtils]: 6: Hoare triple {129#true} assume ~y~0 > 0; {131#(< 0 main_~y~0)} is VALID [2018-11-23 13:04:38,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {131#(< 0 main_~y~0)} assume !(~x~0 < 100); {132#(and (< 0 main_~y~0) (< 99 main_~x~0))} is VALID [2018-11-23 13:04:38,343 INFO L256 TraceCheckUtils]: 8: Hoare triple {132#(and (< 0 main_~y~0) (< 99 main_~x~0))} call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 > 0 && ~x~0 >= 100) then 1 else 0)); {133#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:04:38,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {133#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {134#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:38,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {134#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2018-11-23 13:04:38,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {130#false} assume !false; {130#false} is VALID [2018-11-23 13:04:38,346 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:04:38,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:38,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:04:38,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:04:38,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:38,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:04:38,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:04:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:04:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:38,503 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:04:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,793 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:04:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:04:38,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:04:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-23 13:04:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-23 13:04:38,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2018-11-23 13:04:38,815 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 13:04:38,816 INFO L225 Difference]: With dead ends: 13 [2018-11-23 13:04:38,816 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:38,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:38,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:38,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,819 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,819 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,820 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:38,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,821 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,821 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,821 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:38,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:38,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:38,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-11-23 13:04:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:38,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:38,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:04:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:38,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:39,022 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-23 13:04:39,039 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:04:39,039 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:39,039 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:39,039 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:04:39,040 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:39,040 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:39,040 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 22) the Hoare annotation is: true [2018-11-23 13:04:39,040 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 22) no Hoare annotation was computed. [2018-11-23 13:04:39,040 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 13:04:39,040 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2018-11-23 13:04:39,040 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:04:39,041 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 18) the Hoare annotation is: (< 0 main_~y~0) [2018-11-23 13:04:39,041 INFO L444 ceAbstractionStarter]: At program point L15-1(lines 15 19) the Hoare annotation is: (or (< 99 main_~x~0) (<= main_~y~0 0)) [2018-11-23 13:04:39,041 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 22) no Hoare annotation was computed. [2018-11-23 13:04:39,041 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:04:39,041 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:04:39,041 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:39,042 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:04:39,042 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:04:39,042 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:39,044 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:39,044 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:04:39,044 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:39,044 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:39,044 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:39,044 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:04:39,045 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:39,046 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:39,046 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:04:39,046 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:39,049 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:04:39,049 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:39,049 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:04:39,049 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:04:39,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:39 BoogieIcfgContainer [2018-11-23 13:04:39,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:39,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:39,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:39,058 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:39,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:36" (3/4) ... [2018-11-23 13:04:39,062 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:39,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:39,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:39,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:39,073 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:04:39,073 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:04:39,073 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:39,117 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/terminator_03_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:39,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:39,119 INFO L168 Benchmark]: Toolchain (without parser) took 3459.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -686.5 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:39,120 INFO L168 Benchmark]: CDTParser took 0.21 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:04:39,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.99 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 13:04:39,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.48 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:04:39,122 INFO L168 Benchmark]: Boogie Preprocessor took 22.18 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:04:39,123 INFO L168 Benchmark]: RCFGBuilder took 597.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:39,124 INFO L168 Benchmark]: TraceAbstraction took 2430.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:39,124 INFO L168 Benchmark]: Witness Printer took 60.12 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:39,128 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.21 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 320.99 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 21.48 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 22.18 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 597.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2430.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.9 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB. * Witness Printer took 60.12 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 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: 16]: Loop Invariant Derived loop invariant: 0 < y - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 10 SDslu, 80 SDs, 0 SdLazy, 26 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...