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/bhmr2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:13,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:13,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:13,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:13,723 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:13,724 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:13,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:13,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:13,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:13,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:13,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:13,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:13,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:13,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:13,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:13,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:13,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:13,737 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:13,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:13,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:13,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:13,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:13,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:13,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:13,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:13,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:13,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:13,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:13,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:13,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:13,753 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:13,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:13,756 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:13,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:13,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:13,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:13,758 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:13,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:13,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:13,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:13,789 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:13,790 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:13,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:13,790 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:13,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:13,791 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:13,791 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:13,791 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:13,791 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:13,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:13,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:13,793 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:13,793 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:13,793 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:13,794 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:13,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:13,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:13,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:13,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:13,796 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:13,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:13,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:13,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:13,797 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:13,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:13,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:13,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:13,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:13,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:13,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:13,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:13,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:13,872 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:13,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-23 13:12:13,941 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2a4f9748/2c3e792cd7ec45d6868862533c926ee5/FLAGf349c8705 [2018-11-23 13:12:14,337 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:14,338 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-23 13:12:14,344 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2a4f9748/2c3e792cd7ec45d6868862533c926ee5/FLAGf349c8705 [2018-11-23 13:12:14,721 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2a4f9748/2c3e792cd7ec45d6868862533c926ee5 [2018-11-23 13:12:14,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:14,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:14,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:14,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:14,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:14,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:14" (1/1) ... [2018-11-23 13:12:14,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6462a6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:14, skipping insertion in model container [2018-11-23 13:12:14,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:14" (1/1) ... [2018-11-23 13:12:14,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:14,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:15,007 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:15,013 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:15,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:15,050 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:15,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:15 WrapperNode [2018-11-23 13:12:15,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:15,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:15,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:15,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:15,062 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:15" (1/1) ... [2018-11-23 13:12:15,068 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:15" (1/1) ... [2018-11-23 13:12:15,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:15,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:15,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:15,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:15,087 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:15" (1/1) ... [2018-11-23 13:12:15,088 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:15" (1/1) ... [2018-11-23 13:12:15,089 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:15" (1/1) ... [2018-11-23 13:12:15,089 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:15" (1/1) ... [2018-11-23 13:12:15,094 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:15" (1/1) ... [2018-11-23 13:12:15,103 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:15" (1/1) ... [2018-11-23 13:12:15,104 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:15" (1/1) ... [2018-11-23 13:12:15,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:15,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:15,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:15,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:15,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:15,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:15,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:15,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:15,718 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:15,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:15 BoogieIcfgContainer [2018-11-23 13:12:15,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:15,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:15,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:15,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:15,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:14" (1/3) ... [2018-11-23 13:12:15,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3b3455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:15, skipping insertion in model container [2018-11-23 13:12:15,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:15" (2/3) ... [2018-11-23 13:12:15,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3b3455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:15, skipping insertion in model container [2018-11-23 13:12:15,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:15" (3/3) ... [2018-11-23 13:12:15,726 INFO L112 eAbstractionObserver]: Analyzing ICFG bhmr2007_true-unreach-call_true-termination.c.i [2018-11-23 13:12:15,737 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:15,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:15,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:15,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:15,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:15,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:15,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:15,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:15,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:15,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:15,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:15,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:12:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:15,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:15,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:15,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:15,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 439143249, now seen corresponding path program 1 times [2018-11-23 13:12:15,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:15,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:15,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:12:15,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:12:15,964 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #43#return; {24#true} is VALID [2018-11-23 13:12:15,965 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-23 13:12:15,965 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 13:12:15,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {24#true} is VALID [2018-11-23 13:12:15,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:12:15,967 INFO L256 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {25#false} is VALID [2018-11-23 13:12:15,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:12:15,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:12:15,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:12:15,972 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:15,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:15,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:15,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:12:15,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:15,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:16,060 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:16,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:16,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:16,071 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:12:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,160 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 13:12:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:16,160 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:12:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 13:12:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 13:12:16,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 13:12:16,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:16,527 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:12:16,528 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:12:16,531 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:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:12:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:12:16,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:16,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:16,571 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:16,571 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,574 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:12:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:12:16,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:16,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:16,575 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:16,575 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,578 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:12:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:12:16,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:16,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:16,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:16,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:12:16,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-11-23 13:12:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:16,583 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:12:16,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:12:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:16,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:16,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:16,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:16,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,585 INFO L82 PathProgramCache]: Analyzing trace with hash 428984518, now seen corresponding path program 1 times [2018-11-23 13:12:16,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:16,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,995 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-23 13:12:17,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {119#true} is VALID [2018-11-23 13:12:17,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2018-11-23 13:12:17,198 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #43#return; {119#true} is VALID [2018-11-23 13:12:17,198 INFO L256 TraceCheckUtils]: 3: Hoare triple {119#true} call #t~ret3 := main(); {119#true} is VALID [2018-11-23 13:12:17,216 INFO L273 TraceCheckUtils]: 4: Hoare triple {119#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {121#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} is VALID [2018-11-23 13:12:17,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {121#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (or (<= (+ main_~a~0 main_~b~0) 0) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0))))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {122#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-23 13:12:17,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {122#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {123#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:17,239 INFO L256 TraceCheckUtils]: 7: Hoare triple {123#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {124#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:17,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {124#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {125#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:17,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {125#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {120#false} is VALID [2018-11-23 13:12:17,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {120#false} assume !false; {120#false} is VALID [2018-11-23 13:12:17,243 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:17,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:17,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:12:17,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 13:12:17,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:17,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:12:17,270 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:17,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:12:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:12:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:17,272 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-11-23 13:12:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,874 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:12:17,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:17,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 13:12:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 13:12:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 13:12:17,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2018-11-23 13:12:17,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:17,954 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:12:17,954 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:17,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:12:17,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:17,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:12:17,973 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:12:17,974 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:12:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,976 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:17,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:17,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:17,977 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:12:17,977 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:12:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,980 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:17,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:17,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:17,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:17,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:12:17,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 13:12:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:17,983 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:12:17,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:12:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:12:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:17,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:17,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:17,985 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:17,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash -277157879, now seen corresponding path program 1 times [2018-11-23 13:12:17,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:17,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:17,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:18,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 13:12:18,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 13:12:18,358 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {216#true} {216#true} #43#return; {216#true} is VALID [2018-11-23 13:12:18,359 INFO L256 TraceCheckUtils]: 3: Hoare triple {216#true} call #t~ret3 := main(); {216#true} is VALID [2018-11-23 13:12:18,359 INFO L273 TraceCheckUtils]: 4: Hoare triple {216#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {218#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:18,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {218#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {218#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:18,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {218#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {219#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:18,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {219#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {220#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-23 13:12:18,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {220#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {221#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-23 13:12:18,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {221#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {222#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:18,371 INFO L256 TraceCheckUtils]: 10: Hoare triple {222#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {223#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:18,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {224#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:18,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {224#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {217#false} is VALID [2018-11-23 13:12:18,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 13:12:18,374 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:18,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:18,375 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:18,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:18,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:18,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 13:12:18,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 13:12:18,946 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {216#true} {216#true} #43#return; {216#true} is VALID [2018-11-23 13:12:18,947 INFO L256 TraceCheckUtils]: 3: Hoare triple {216#true} call #t~ret3 := main(); {216#true} is VALID [2018-11-23 13:12:18,947 INFO L273 TraceCheckUtils]: 4: Hoare triple {216#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {240#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:18,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {240#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {240#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:18,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {240#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {247#(and (= main_~b~0 0) (< main_~i~0 main_~n~0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:18,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {247#(and (= main_~b~0 0) (< main_~i~0 main_~n~0) (= main_~a~0 0) (= main_~i~0 0))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {251#(and (< main_~i~0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (= main_~i~0 0))} is VALID [2018-11-23 13:12:18,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {251#(and (< main_~i~0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {255#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~i~0 1))} is VALID [2018-11-23 13:12:18,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {255#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {259#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~n~0 1))} is VALID [2018-11-23 13:12:18,955 INFO L256 TraceCheckUtils]: 10: Hoare triple {259#(and (< 0 main_~n~0) (= main_~a~0 1) (= main_~b~0 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {223#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:18,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {224#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:18,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {224#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {217#false} is VALID [2018-11-23 13:12:18,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 13:12:18,959 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:18,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:18,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:12:18,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-23 13:12:18,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:18,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:12:19,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:12:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:12:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:12:19,071 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 14 states. [2018-11-23 13:12:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:19,907 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:12:19,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:12:19,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-11-23 13:12:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-23 13:12:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-23 13:12:19,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 33 transitions. [2018-11-23 13:12:20,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:20,023 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:12:20,023 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:12:20,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:12:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:12:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:12:20,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:20,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:12:20,106 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:12:20,106 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:12:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,109 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 13:12:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:12:20,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:20,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:20,110 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:12:20,110 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:12:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,112 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 13:12:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:12:20,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:20,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:20,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:20,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:12:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 13:12:20,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-11-23 13:12:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:20,116 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 13:12:20,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:12:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 13:12:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:12:20,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:20,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:20,117 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:20,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:20,118 INFO L82 PathProgramCache]: Analyzing trace with hash -608518108, now seen corresponding path program 1 times [2018-11-23 13:12:20,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:20,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:20,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-23 13:12:20,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-23 13:12:20,510 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {397#true} {397#true} #43#return; {397#true} is VALID [2018-11-23 13:12:20,511 INFO L256 TraceCheckUtils]: 3: Hoare triple {397#true} call #t~ret3 := main(); {397#true} is VALID [2018-11-23 13:12:20,516 INFO L273 TraceCheckUtils]: 4: Hoare triple {397#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {400#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)) (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)) (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)))} ~i~0 := 1 + ~i~0; {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {399#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {401#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {401#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {402#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-23 13:12:20,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {402#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {403#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2018-11-23 13:12:20,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {403#(and (or (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {404#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} is VALID [2018-11-23 13:12:20,530 INFO L256 TraceCheckUtils]: 13: Hoare triple {404#(and (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {405#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:20,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {406#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:20,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {398#false} is VALID [2018-11-23 13:12:20,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-23 13:12:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:20,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:20,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:21,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-23 13:12:21,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-23 13:12:21,135 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {397#true} {397#true} #43#return; {397#true} is VALID [2018-11-23 13:12:21,135 INFO L256 TraceCheckUtils]: 3: Hoare triple {397#true} call #t~ret3 := main(); {397#true} is VALID [2018-11-23 13:12:21,135 INFO L273 TraceCheckUtils]: 4: Hoare triple {397#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {422#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:21,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {422#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:21,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {422#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {422#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:21,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {422#(and (= main_~b~0 0) (= main_~a~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {432#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:12:21,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {432#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {436#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 1))} is VALID [2018-11-23 13:12:21,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {436#(and (= main_~a~0 2) (= main_~b~0 1) (= main_~i~0 1))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {440#(and (= main_~a~0 2) (= main_~b~0 1) (< main_~i~0 main_~n~0) (= main_~i~0 1))} is VALID [2018-11-23 13:12:21,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {440#(and (= main_~a~0 2) (= main_~b~0 1) (< main_~i~0 main_~n~0) (= main_~i~0 1))} assume 0 != #t~nondet2;havoc #t~nondet2;~a~0 := 1 + ~a~0;~b~0 := 2 + ~b~0; {444#(and (< main_~i~0 main_~n~0) (= main_~b~0 3) (= main_~i~0 1) (= main_~a~0 3))} is VALID [2018-11-23 13:12:21,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {444#(and (< main_~i~0 main_~n~0) (= main_~b~0 3) (= main_~i~0 1) (= main_~a~0 3))} ~i~0 := 1 + ~i~0; {448#(and (< 1 main_~n~0) (<= main_~i~0 2) (= main_~b~0 3) (= main_~a~0 3))} is VALID [2018-11-23 13:12:21,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#(and (< 1 main_~n~0) (<= main_~i~0 2) (= main_~b~0 3) (= main_~a~0 3))} assume !(~i~0 < ~n~0); {452#(and (< 1 main_~n~0) (= main_~b~0 3) (<= main_~n~0 2) (= main_~a~0 3))} is VALID [2018-11-23 13:12:21,149 INFO L256 TraceCheckUtils]: 13: Hoare triple {452#(and (< 1 main_~n~0) (= main_~b~0 3) (<= main_~n~0 2) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {405#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:21,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {406#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:21,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {398#false} is VALID [2018-11-23 13:12:21,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-23 13:12:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:21,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:21,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-23 13:12:21,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-11-23 13:12:21,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:21,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:12:21,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:21,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:12:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:12:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:12:21,237 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 17 states. [2018-11-23 13:12:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,400 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 13:12:22,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:12:22,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-11-23 13:12:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-11-23 13:12:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-11-23 13:12:22,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 28 transitions. [2018-11-23 13:12:22,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:22,441 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:12:22,442 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:22,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:12:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:22,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:22,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:22,444 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:22,444 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,444 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:22,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,445 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:22,445 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:22,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:22,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:22,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 13:12:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:22,446 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:22,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:12:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:22,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:22,621 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:22,621 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:22,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:22,622 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:22,622 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:22,622 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:22,622 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 26) the Hoare annotation is: true [2018-11-23 13:12:22,622 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 26) no Hoare annotation was computed. [2018-11-23 13:12:22,623 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-23 13:12:22,623 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-11-23 13:12:22,623 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-23 13:12:22,623 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 21) no Hoare annotation was computed. [2018-11-23 13:12:22,623 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 26) no Hoare annotation was computed. [2018-11-23 13:12:22,623 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~i~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 (* 3 main_~n~0)))) [2018-11-23 13:12:22,624 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~n~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2018-11-23 13:12:22,624 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:22,624 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:22,624 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:22,624 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:22,625 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:22,625 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:22,626 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:22,626 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:12:22,626 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:22,627 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:22,629 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:22,630 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:22,630 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:12:22,630 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 13:12:22,630 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:22,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:22 BoogieIcfgContainer [2018-11-23 13:12:22,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:22,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:22,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:22,640 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:22,641 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:15" (3/4) ... [2018-11-23 13:12:22,644 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:22,650 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:22,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:22,651 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:22,655 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:12:22,656 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:12:22,656 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:22,656 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:22,704 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:22,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:22,705 INFO L168 Benchmark]: Toolchain (without parser) took 7974.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -245.3 MB). Peak memory consumption was 479.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:22,712 INFO L168 Benchmark]: CDTParser took 0.45 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:22,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.90 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:12:22,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.35 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:22,714 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 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:22,714 INFO L168 Benchmark]: RCFGBuilder took 607.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:22,715 INFO L168 Benchmark]: TraceAbstraction took 6919.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 506.1 MB). Peak memory consumption was 506.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:22,716 INFO L168 Benchmark]: Witness Printer took 64.21 ms. Allocated memory is still 2.3 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:22,722 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.45 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 317.90 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 24.35 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 34.41 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 607.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6919.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 506.1 MB). Peak memory consumption was 506.1 MB. Max. memory is 7.1 GB. * Witness Printer took 64.21 ms. Allocated memory is still 2.3 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. 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: 14]: Loop Invariant Derived loop invariant: (a + b <= 3 * i && 3 * i <= a + b) && a + b <= 3 * n - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 6.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 23 SDslu, 143 SDs, 0 SdLazy, 275 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 42 HoareAnnotationTreeSize, 12 FomulaSimplifications, 97 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 145 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 8051 SizeOfPredicates, 6 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...