java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc /storage/repos/ultimate/trunk/examples/toolchains/ReqCheck.xml -s /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf --traceabstraction.limit.analysis.time 300 --pea2boogie.always.use.all.invariants.during.rt-inconsistency.checks true --pea2boogie.check.vacuity true --pea2boogie.check.consistency true --pea2boogie.check.rt-inconsistency true --pea2boogie.report.trivial.rt-consistency false --pea2boogie.rt-inconsistency.range 2 -i /storage/repos/re2019-exp/hybrid2_extended.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-05 11:56:36,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-05 11:56:36,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-05 11:56:36,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-05 11:56:36,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-05 11:56:36,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-05 11:56:36,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-05 11:56:36,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-05 11:56:36,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-05 11:56:36,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-05 11:56:36,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-05 11:56:36,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-05 11:56:36,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-05 11:56:36,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-05 11:56:36,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-05 11:56:36,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-05 11:56:36,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-05 11:56:36,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-05 11:56:36,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-05 11:56:36,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-05 11:56:36,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-05 11:56:36,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-05 11:56:36,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-05 11:56:36,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-05 11:56:36,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-05 11:56:36,765 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-05 11:56:36,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-05 11:56:36,766 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-05 11:56:36,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-05 11:56:36,768 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-05 11:56:36,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-05 11:56:36,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-05 11:56:36,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-05 11:56:36,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-05 11:56:36,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-05 11:56:36,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-05 11:56:36,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-05 11:56:36,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-05 11:56:36,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-05 11:56:36,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-05 11:56:36,791 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-05 11:56:36,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-05 11:56:36,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-05 11:56:36,792 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-05 11:56:36,793 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:36,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:36,793 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-05 11:56:36,793 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-05 11:56:36,793 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-05 11:56:36,794 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-05 11:56:36,794 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-05 11:56:36,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:36,794 INFO L133 SettingsManager]: * Compute trace for counterexample result=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit analysis time -> 300 Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Always use all invariants during rt-inconsistency checks -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check vacuity -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check consistency -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Check rt-inconsistency -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Report trivial rt-consistency -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.pea2boogie: Rt-inconsistency range -> 2 [2019-04-05 11:56:36,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-05 11:56:36,837 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-05 11:56:36,840 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-05 11:56:36,841 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-05 11:56:36,842 INFO L276 PluginConnector]: ReqParser initialized [2019-04-05 11:56:36,843 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/hybrid2_extended.new.req [2019-04-05 11:56:36,843 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/hybrid2_extended.new.req [2019-04-05 11:56:36,885 INFO L134 ReqParser]: 23 requirements (15 non-initialization) in total [2019-04-05 11:56:36,890 INFO L134 ReqParser]: 23 requirements (15 non-initialization) after unification [2019-04-05 11:56:36,895 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-05 11:56:36,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-05 11:56:36,898 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-05 11:56:36,898 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-05 11:56:36,898 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-05 11:56:36,900 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:36" (1/1) ... [2019-04-05 11:56:36,909 INFO L157 Req2BoogieTranslator]: Check vacuity=true, Rt-inconsistency range=2, Check consistency=true, Report trivial rt-consistency=false, Always use all invariants during rt-inconsistency checks=true [2019-04-05 11:56:36,920 INFO L59 ReqToPEA]: Transforming 15 requirements to PEAs [2019-04-05 11:56:36,966 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-05 11:56:36,967 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 5 [2019-04-05 11:56:36,967 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MaxDurationPattern : 5 [2019-04-05 11:56:36,967 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 2 [2019-04-05 11:56:36,968 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 2 [2019-04-05 11:56:36,968 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.PrecedencePattern : 1 [2019-04-05 11:56:36,968 INFO L92 ReqToPEA]: Finished transforming 15 requirements to PEAs No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-04-05 11:56:37,285 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 1 [2019-04-05 11:56:37,297 WARN L496 Req2BoogieTranslator]: phase without clock or state invariant for ID011: Globally, it is always the case that if "x0004" holds, then "x0003", previously held [2019-04-05 11:56:37,304 INFO L769 Req2BoogieTranslator]: 0 of 15 requirements are invariant [2019-04-05 11:56:37,305 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 105 subsets [2019-04-05 11:56:38,049 INFO L284 cyConditionGenerator]: 105 checks, 71 trivial consistent, 34 non-trivial [2019-04-05 11:56:38,050 INFO L290 cyConditionGenerator]: Of 1636 formulas, 0 were quantified, 1636 were plain. Needed 364 quantifier elimination runs, 0 quantified solver queries. [2019-04-05 11:56:38,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38 Unit [2019-04-05 11:56:38,061 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-05 11:56:38,061 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-05 11:56:38,062 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-05 11:56:38,062 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-05 11:56:38,063 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,065 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-05 11:56:38,065 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-05 11:56:38,079 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-05 11:56:38,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-05 11:56:38,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-05 11:56:38,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-05 11:56:38,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... [2019-04-05 11:56:38,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-05 11:56:38,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-05 11:56:38,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-05 11:56:38,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-05 11:56:38,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:38,230 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-05 11:56:38,230 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-05 11:56:38,230 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure [2019-04-05 11:56:44,381 INFO L278 CfgBuilder]: Using library mode [2019-04-05 11:56:44,381 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-05 11:56:44,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:44 BoogieIcfgContainer [2019-04-05 11:56:44,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-05 11:56:44,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-05 11:56:44,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-05 11:56:44,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-05 11:56:44,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:36" (1/3) ... [2019-04-05 11:56:44,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e83ec8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 05.04 11:56:44, skipping insertion in model container [2019-04-05 11:56:44,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:38" (2/3) ... [2019-04-05 11:56:44,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e83ec8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:56:44, skipping insertion in model container [2019-04-05 11:56:44,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:44" (3/3) ... [2019-04-05 11:56:44,390 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-05 11:56:44,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-05 11:56:44,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-04-05 11:56:44,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:44,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:44,450 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:44,450 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:44,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:44,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:44,451 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:44,451 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:44,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010======== [2019-04-05 11:56:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-05 11:56:44,476 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:44,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:44,477 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-05 11:56:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1665643260, now seen corresponding path program 1 times [2019-04-05 11:56:44,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:44,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:44,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:44,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:44,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:44,762 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:44,784 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:44,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-05 11:56:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:44,795 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:44,795 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:44,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:44,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-05 11:56:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:44,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:44,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:44,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:44,827 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 was SAFE (1/50) [2019-04-05 11:56:44,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:44,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:44,830 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:44,830 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:44,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:44,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:44,830 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:44,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:44,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID010_ID003======== [2019-04-05 11:56:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-04-05 11:56:44,836 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:44,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:44,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID010_ID003]=== [2019-04-05 11:56:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:44,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1096008312, now seen corresponding path program 1 times [2019-04-05 11:56:44,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:44,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:44,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:44,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:44,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:44,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:44,940 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:44,950 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:44,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:44,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-04-05 11:56:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:44,951 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:44,951 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:44,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:44,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-04-05 11:56:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:44,953 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:44,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:44,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:44,954 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID010_ID003 was SAFE (2/50) [2019-04-05 11:56:44,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:44,956 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:44,957 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:44,957 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:44,957 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:44,957 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:44,957 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:44,957 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:44,957 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID010_ID009======== [2019-04-05 11:56:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-05 11:56:44,963 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:44,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:44,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID010_ID009]=== [2019-04-05 11:56:44,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash -996988470, now seen corresponding path program 1 times [2019-04-05 11:56:44,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:44,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:45,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,021 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,031 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:45,031 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-04-05 11:56:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,032 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:45,032 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:45,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:45,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-04-05 11:56:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,037 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:45,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:45,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:45,038 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID010_ID009 was SAFE (3/50) [2019-04-05 11:56:45,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,039 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,039 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,039 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,039 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,039 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,040 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,040 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,040 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010======== [2019-04-05 11:56:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-05 11:56:45,045 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010]=== [2019-04-05 11:56:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1499941058, now seen corresponding path program 1 times [2019-04-05 11:56:45,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,093 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,102 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:45,102 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-04-05 11:56:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,102 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:45,103 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:45,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:45,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-04-05 11:56:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,105 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:45,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:45,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:45,106 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010 was SAFE (4/50) [2019-04-05 11:56:45,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,108 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,109 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,109 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr46ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-05 11:56:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-04-05 11:56:45,116 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr46ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-05 11:56:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash 599265548, now seen corresponding path program 1 times [2019-04-05 11:56:45,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:45,164 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:45,172 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr46ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (5/50) [2019-04-05 11:56:45,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,174 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,175 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,175 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,175 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,175 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,175 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,175 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,175 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID010======== [2019-04-05 11:56:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-05 11:56:45,178 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,180 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID010]=== [2019-04-05 11:56:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1450951552, now seen corresponding path program 1 times [2019-04-05 11:56:45,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,212 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,219 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:45,219 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-04-05 11:56:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,219 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:45,220 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:45,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:45,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-04-05 11:56:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,224 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:45,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:45,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:45,227 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID010 was SAFE (6/50) [2019-04-05 11:56:45,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,228 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,228 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,228 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,229 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,229 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,229 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID010_ID004======== [2019-04-05 11:56:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-04-05 11:56:45,231 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID010_ID004]=== [2019-04-05 11:56:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2080874256, now seen corresponding path program 1 times [2019-04-05 11:56:45,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,267 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,271 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:45,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-04-05 11:56:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,272 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:45,272 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:45,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:45,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-04-05 11:56:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,273 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:45,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:45,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:45,274 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID010_ID004 was SAFE (7/50) [2019-04-05 11:56:45,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,275 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,275 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,275 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,275 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,275 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,276 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,276 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr38ASSERT_VIOLATIONVACUOUSforID010======== [2019-04-05 11:56:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-04-05 11:56:45,278 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr38ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-05 11:56:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash -500838140, now seen corresponding path program 1 times [2019-04-05 11:56:45,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:45,417 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-05 11:56:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,508 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 11:56:45,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:45,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-04-05 11:56:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,512 INFO L225 Difference]: With dead ends: 146 [2019-04-05 11:56:45,513 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 11:56:45,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 11:56:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2019-04-05 11:56:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-04-05 11:56:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-04-05 11:56:45,530 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 41 [2019-04-05 11:56:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,531 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-04-05 11:56:45,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-04-05 11:56:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-04-05 11:56:45,534 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,534 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,534 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr38ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-05 11:56:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash -612843275, now seen corresponding path program 1 times [2019-04-05 11:56:45,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:45,613 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:45,618 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr38ASSERT_VIOLATIONVACUOUSforID010 was UNSAFE (8/50) [2019-04-05 11:56:45,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,623 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,623 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,623 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,623 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,623 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012======== [2019-04-05 11:56:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-05 11:56:45,628 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,628 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012]=== [2019-04-05 11:56:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1584286482, now seen corresponding path program 1 times [2019-04-05 11:56:45,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,665 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,667 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:45,667 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-04-05 11:56:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,668 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:45,673 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:45,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:45,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-04-05 11:56:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,675 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:45,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:45,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:45,675 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012 was SAFE (9/50) [2019-04-05 11:56:45,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,678 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,678 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,678 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,678 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,678 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,678 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,679 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,680 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr34ASSERT_VIOLATIONVACUOUSforID013======== [2019-04-05 11:56:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-04-05 11:56:45,682 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,683 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr34ASSERT_VIOLATIONVACUOUSforID013]=== [2019-04-05 11:56:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash -340074240, now seen corresponding path program 1 times [2019-04-05 11:56:45,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:45,701 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:45,702 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr34ASSERT_VIOLATIONVACUOUSforID013 was UNSAFE (10/50) [2019-04-05 11:56:45,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,703 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,703 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,703 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,704 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,704 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,704 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID014======== [2019-04-05 11:56:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-05 11:56:45,707 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,707 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID014]=== [2019-04-05 11:56:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2029824798, now seen corresponding path program 1 times [2019-04-05 11:56:45,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,736 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,737 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:45,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:45,742 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-04-05 11:56:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,743 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:45,743 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:45,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:45,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-05 11:56:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,744 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:45,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:45,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:45,745 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID014 was SAFE (11/50) [2019-04-05 11:56:45,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:45,747 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:45,747 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:45,747 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:45,747 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:45,747 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:45,747 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:45,747 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:45,747 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr42ASSERT_VIOLATIONVACUOUSforID007======== [2019-04-05 11:56:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-04-05 11:56:45,755 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,755 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr42ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-05 11:56:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash -908795640, now seen corresponding path program 1 times [2019-04-05 11:56:45,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:45,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:45,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:45,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:45,832 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-05 11:56:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:45,898 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 11:56:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:45,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-04-05 11:56:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:45,903 INFO L225 Difference]: With dead ends: 146 [2019-04-05 11:56:45,903 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 11:56:45,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 11:56:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2019-04-05 11:56:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-04-05 11:56:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-04-05 11:56:45,918 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 45 [2019-04-05 11:56:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:45,919 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-04-05 11:56:45,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-04-05 11:56:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-04-05 11:56:45,924 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:45,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:45,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr42ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-05 11:56:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -10719111, now seen corresponding path program 1 times [2019-04-05 11:56:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:45,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:46,539 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-04-05 11:56:46,856 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-04-05 11:56:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:46,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:46,919 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 [2019-04-05 11:56:46,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:47,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjunts are in the unsatisfiable core [2019-04-05 11:56:47,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:48,908 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 13 [2019-04-05 11:56:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:51,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-04-05 11:56:51,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-04-05 11:56:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-04-05 11:56:51,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-04-05 11:56:51,524 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 7 states. [2019-04-05 11:56:52,163 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-04-05 11:56:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:52,260 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-04-05 11:56:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-04-05 11:56:52,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-04-05 11:56:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:52,264 INFO L225 Difference]: With dead ends: 155 [2019-04-05 11:56:52,264 INFO L226 Difference]: Without dead ends: 155 [2019-04-05 11:56:52,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-04-05 11:56:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-04-05 11:56:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2019-04-05 11:56:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-04-05 11:56:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-04-05 11:56:52,284 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 96 [2019-04-05 11:56:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:52,284 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-04-05 11:56:52,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-04-05 11:56:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-04-05 11:56:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-04-05 11:56:52,286 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,286 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-04-05 11:56:52,286 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr42ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-05 11:56:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1296868712, now seen corresponding path program 2 times [2019-04-05 11:56:52,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:52,428 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:52,429 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr42ASSERT_VIOLATIONVACUOUSforID007 was UNSAFE (12/50) [2019-04-05 11:56:52,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,434 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,435 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,435 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-05 11:56:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-04-05 11:56:52,439 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,440 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-05 11:56:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1458672018, now seen corresponding path program 1 times [2019-04-05 11:56:52,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:52,464 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:52,465 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (13/50) [2019-04-05 11:56:52,466 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,467 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,467 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,467 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,467 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr43ASSERT_VIOLATIONVACUOUSforID008======== [2019-04-05 11:56:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-04-05 11:56:52,469 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr43ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-05 11:56:52,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1892106664, now seen corresponding path program 1 times [2019-04-05 11:56:52,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:52,482 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:52,485 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr43ASSERT_VIOLATIONVACUOUSforID008 was UNSAFE (14/50) [2019-04-05 11:56:52,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,487 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,487 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,487 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,487 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,487 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID007_ID014======== [2019-04-05 11:56:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-04-05 11:56:52,489 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID007_ID014]=== [2019-04-05 11:56:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1914106, now seen corresponding path program 1 times [2019-04-05 11:56:52,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:52,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:52,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:52,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:52,516 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:52,517 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:52,517 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-04-05 11:56:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:52,518 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:52,518 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:52,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:52,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-04-05 11:56:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:52,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:52,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:52,522 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID007_ID014 was SAFE (15/50) [2019-04-05 11:56:52,523 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,523 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,523 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,523 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,524 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,524 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr39ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-05 11:56:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-04-05 11:56:52,526 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr39ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-05 11:56:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1653887268, now seen corresponding path program 1 times [2019-04-05 11:56:52,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:52,539 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:52,540 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr39ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (16/50) [2019-04-05 11:56:52,541 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,541 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,541 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,541 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID010_ID005======== [2019-04-05 11:56:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-05 11:56:52,543 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID010_ID005]=== [2019-04-05 11:56:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1868240306, now seen corresponding path program 1 times [2019-04-05 11:56:52,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:52,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:52,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:52,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:52,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:52,568 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:52,570 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:52,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:52,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-04-05 11:56:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:52,571 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:52,571 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:52,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:52,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-04-05 11:56:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:52,572 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:52,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:52,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:52,573 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID010_ID005 was SAFE (17/50) [2019-04-05 11:56:52,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,575 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,575 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,576 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000======== [2019-04-05 11:56:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-04-05 11:56:52,578 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,578 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000]=== [2019-04-05 11:56:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash -82592112, now seen corresponding path program 1 times [2019-04-05 11:56:52,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:52,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:52,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:52,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:52,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:52,600 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:52,601 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:52,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-04-05 11:56:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:52,602 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:52,602 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:52,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:52,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-04-05 11:56:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:52,603 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:52,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:52,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:52,604 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000 was SAFE (18/50) [2019-04-05 11:56:52,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:52,605 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:52,605 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:52,605 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:52,605 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:52,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:52,605 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:52,606 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:52,606 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008======== [2019-04-05 11:56:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-04-05 11:56:52,609 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:52,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:52,609 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008]=== [2019-04-05 11:56:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1027773686, now seen corresponding path program 1 times [2019-04-05 11:56:52,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:52,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:53,166 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-04-05 11:56:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:53,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:53,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:53,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:53,168 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-05 11:56:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:53,345 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 11:56:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:53,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-04-05 11:56:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:53,347 INFO L225 Difference]: With dead ends: 146 [2019-04-05 11:56:53,347 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 11:56:53,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 11:56:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2019-04-05 11:56:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-04-05 11:56:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-04-05 11:56:53,353 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 27 [2019-04-05 11:56:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:53,353 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-04-05 11:56:53,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-04-05 11:56:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-04-05 11:56:53,354 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:53,354 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:53,354 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008]=== [2019-04-05 11:56:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1102630567, now seen corresponding path program 1 times [2019-04-05 11:56:53,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:53,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 11:56:53,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:53,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:53,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:53,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:53,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:53,517 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 3 states. [2019-04-05 11:56:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:53,579 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-04-05 11:56:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:53,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-04-05 11:56:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:53,581 INFO L225 Difference]: With dead ends: 78 [2019-04-05 11:56:53,581 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:53,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:53,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-04-05 11:56:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:53,582 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:53,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:53,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:53,583 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008 was SAFE (19/50) [2019-04-05 11:56:53,584 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:53,585 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:53,585 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:53,585 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:53,585 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:53,585 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:53,585 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:53,585 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:53,585 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID006_ID014======== [2019-04-05 11:56:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-05 11:56:53,587 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:53,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:53,587 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID006_ID014]=== [2019-04-05 11:56:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -746467100, now seen corresponding path program 1 times [2019-04-05 11:56:53,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:53,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:53,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:53,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:53,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:53,605 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:53,606 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:53,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:53,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-04-05 11:56:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:53,606 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:53,607 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:53,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:53,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-04-05 11:56:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:53,608 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:53,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:53,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:53,609 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID006_ID014 was SAFE (20/50) [2019-04-05 11:56:53,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:53,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:53,610 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:53,610 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:53,610 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:53,610 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:53,610 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:53,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:53,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID012_ID014======== [2019-04-05 11:56:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-04-05 11:56:53,612 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:53,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:53,612 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID012_ID014]=== [2019-04-05 11:56:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1839468796, now seen corresponding path program 1 times [2019-04-05 11:56:53,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:53,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:53,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:53,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:53,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:53,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:53,632 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:53,632 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:53,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:53,633 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-04-05 11:56:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:53,633 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:53,633 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:53,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:53,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-04-05 11:56:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:53,634 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:53,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:53,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:53,635 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID012_ID014 was SAFE (21/50) [2019-04-05 11:56:53,636 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:53,636 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:53,636 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:53,636 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:53,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:53,637 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:53,637 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:53,637 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:53,637 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID010_ID008======== [2019-04-05 11:56:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-04-05 11:56:53,638 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:53,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:53,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID010_ID008]=== [2019-04-05 11:56:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash -328200692, now seen corresponding path program 1 times [2019-04-05 11:56:53,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:53,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:53,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:53,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:53,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:53,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:53,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:53,656 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 11:56:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:53,657 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 11:56:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:53,657 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-04-05 11:56:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:53,657 INFO L225 Difference]: With dead ends: 74 [2019-04-05 11:56:53,657 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:53,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:53,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-04-05 11:56:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:53,659 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:53,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:53,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:53,659 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID010_ID008 was SAFE (22/50) [2019-04-05 11:56:53,660 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:53,660 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:53,660 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:53,660 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:53,660 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:53,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:53,661 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:53,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:53,661 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr45ASSERT_VIOLATIONVACUOUSforID005======== [2019-04-05 11:56:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 11:56:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-04-05 11:56:53,662 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:53,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:53,663 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr45ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-05 11:56:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1543351786, now seen corresponding path program 1 times [2019-04-05 11:56:53,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:53,886 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-04-05 11:56:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:53,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:53,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:53,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:53,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:53,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:54,000 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-05 11:56:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:54,092 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 11:56:54,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:54,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-04-05 11:56:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:54,093 INFO L225 Difference]: With dead ends: 146 [2019-04-05 11:56:54,093 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 11:56:54,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 11:56:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-04-05 11:56:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-04-05 11:56:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-04-05 11:56:54,101 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 48 [2019-04-05 11:56:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:54,101 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-04-05 11:56:54,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-04-05 11:56:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-04-05 11:56:54,103 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:54,103 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:54,103 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr45ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-05 11:56:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1505026855, now seen corresponding path program 1 times [2019-04-05 11:56:54,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:54,417 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-04-05 11:56:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:54,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:54,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 11:56:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:54,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-04-05 11:56:54,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:55,725 WARN L188 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-04-05 11:56:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:55,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:55,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-04-05 11:56:55,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-04-05 11:56:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-04-05 11:56:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-04-05 11:56:55,766 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 8 states. [2019-04-05 11:56:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:56,130 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-04-05 11:56:56,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-05 11:56:56,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-04-05 11:56:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:56,134 INFO L225 Difference]: With dead ends: 155 [2019-04-05 11:56:56,134 INFO L226 Difference]: Without dead ends: 155 [2019-04-05 11:56:56,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-04-05 11:56:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-04-05 11:56:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-04-05 11:56:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-04-05 11:56:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-04-05 11:56:56,141 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 99 [2019-04-05 11:56:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-04-05 11:56:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-04-05 11:56:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-04-05 11:56:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-04-05 11:56:56,143 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:56,143 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1] [2019-04-05 11:56:56,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr45ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-05 11:56:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1785400714, now seen corresponding path program 2 times [2019-04-05 11:56:56,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:56,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:57,175 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-04-05 11:56:57,792 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2019-04-05 11:56:58,449 WARN L188 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 83 [2019-04-05 11:56:58,970 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 55 [2019-04-05 11:56:59,089 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-04-05 11:56:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:59,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:59,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 11:56:59,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:59,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 50 conjunts are in the unsatisfiable core [2019-04-05 11:56:59,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:58:46,494 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 13176 conjuctions. This might take some time... [2019-04-05 11:58:58,709 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 13176 conjuctions. [2019-04-05 11:59:22,811 WARN L188 SmtUtils]: Spent 23.32 s on a formula simplification. DAG size of input: 1052 DAG size of output: 34 [2019-04-05 11:59:33,006 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 1720320 conjuctions. This might take some time... [2019-04-05 12:01:53,663 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-04-05 12:01:53,864 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 12:01:53,864 WARN L549 AbstractCegarLoop]: Verification canceled [2019-04-05 12:01:53,867 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr45ASSERT_VIOLATIONVACUOUSforID005 was TIMEOUT (23/50) [2019-04-05 12:01:53,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:53,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:53,868 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:53,868 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:53,868 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:53,868 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:53,868 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:53,868 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:53,868 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID003_ID008======== [2019-04-05 12:01:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-04-05 12:01:53,871 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:53,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:53,873 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID003_ID008]=== [2019-04-05 12:01:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:53,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2061595950, now seen corresponding path program 1 times [2019-04-05 12:01:53,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:53,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:53,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:53,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:53,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:53,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:53,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:53,892 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:53,893 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:53,893 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-04-05 12:01:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:53,893 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:53,893 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:53,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:53,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-04-05 12:01:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:53,895 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:53,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:53,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:53,896 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID003_ID008 was SAFE (24/50) [2019-04-05 12:01:53,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:53,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:53,897 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:53,897 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:53,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:53,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:53,897 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:53,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:53,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID005_ID014======== [2019-04-05 12:01:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-04-05 12:01:53,898 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:53,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:53,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID005_ID014]=== [2019-04-05 12:01:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:53,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1188958236, now seen corresponding path program 1 times [2019-04-05 12:01:53,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:53,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:53,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:53,915 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:53,916 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:53,916 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2019-04-05 12:01:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:53,916 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:53,916 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:53,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:53,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-04-05 12:01:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:53,917 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:53,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:53,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:53,918 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID005_ID014 was SAFE (25/50) [2019-04-05 12:01:53,919 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:53,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:53,919 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:53,919 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:53,919 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:53,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:53,919 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:53,920 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:53,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID014======== [2019-04-05 12:01:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-05 12:01:53,921 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:53,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:53,921 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID014]=== [2019-04-05 12:01:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1420828440, now seen corresponding path program 1 times [2019-04-05 12:01:53,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:53,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:53,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:53,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:53,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:53,936 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:53,937 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:53,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:53,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-04-05 12:01:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:53,937 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:53,937 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:53,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:53,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-04-05 12:01:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:53,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:53,939 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID014 was SAFE (26/50) [2019-04-05 12:01:53,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:53,940 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:53,940 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:53,940 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:53,940 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:53,940 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:53,940 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:53,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:53,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002======== [2019-04-05 12:01:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-05 12:01:53,942 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:53,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:53,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002]=== [2019-04-05 12:01:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1339640134, now seen corresponding path program 1 times [2019-04-05 12:01:53,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:53,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:54,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:54,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 12:01:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 12:01:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 12:01:54,081 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-05 12:01:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:54,148 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 12:01:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 12:01:54,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-04-05 12:01:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:54,150 INFO L225 Difference]: With dead ends: 146 [2019-04-05 12:01:54,150 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 12:01:54,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 12:01:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 12:01:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 64. [2019-04-05 12:01:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-04-05 12:01:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-04-05 12:01:54,154 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 12 [2019-04-05 12:01:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:54,154 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-04-05 12:01:54,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 12:01:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-04-05 12:01:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-04-05 12:01:54,155 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:54,155 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:54,156 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002]=== [2019-04-05 12:01:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash -818478155, now seen corresponding path program 1 times [2019-04-05 12:01:54,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:54,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:54,359 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-04-05 12:01:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:54,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 12:01:54,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 12:01:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:54,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-04-05 12:01:54,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 12:01:55,009 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2019-04-05 12:01:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 12:01:55,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-04-05 12:01:55,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-04-05 12:01:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-04-05 12:01:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-04-05 12:01:55,032 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 10 states. [2019-04-05 12:01:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,082 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-04-05 12:01:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-05 12:01:55,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-04-05 12:01:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,083 INFO L225 Difference]: With dead ends: 103 [2019-04-05 12:01:55,083 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-04-05 12:01:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2019-04-05 12:01:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,085 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-04-05 12:01:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,086 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 was SAFE (27/50) [2019-04-05 12:01:55,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,087 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,087 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,087 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID000_ID014======== [2019-04-05 12:01:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-04-05 12:01:55,089 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID000_ID014]=== [2019-04-05 12:01:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash 127577182, now seen corresponding path program 1 times [2019-04-05 12:01:55,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,108 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,109 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,109 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2019-04-05 12:01:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,109 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,110 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-04-05 12:01:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,113 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,113 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID000_ID014 was SAFE (28/50) [2019-04-05 12:01:55,114 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,114 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,114 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,114 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,115 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004======== [2019-04-05 12:01:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-04-05 12:01:55,118 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004]=== [2019-04-05 12:01:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 515035380, now seen corresponding path program 1 times [2019-04-05 12:01:55,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,133 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,134 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,135 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2019-04-05 12:01:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,135 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,135 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-04-05 12:01:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,137 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004 was SAFE (29/50) [2019-04-05 12:01:55,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,138 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,138 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,141 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID003_ID014======== [2019-04-05 12:01:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-04-05 12:01:55,142 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID003_ID014]=== [2019-04-05 12:01:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1213772012, now seen corresponding path program 1 times [2019-04-05 12:01:55,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,160 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,161 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,163 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2019-04-05 12:01:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,163 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,164 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-04-05 12:01:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,165 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID003_ID014 was SAFE (30/50) [2019-04-05 12:01:55,170 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,170 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,171 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,172 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014======== [2019-04-05 12:01:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-04-05 12:01:55,173 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014]=== [2019-04-05 12:01:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 59337690, now seen corresponding path program 1 times [2019-04-05 12:01:55,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,193 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,194 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,195 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-04-05 12:01:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,195 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,195 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-04-05 12:01:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,196 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,197 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014 was SAFE (31/50) [2019-04-05 12:01:55,198 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,198 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,198 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,198 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000======== [2019-04-05 12:01:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-04-05 12:01:55,201 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000]=== [2019-04-05 12:01:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1397363244, now seen corresponding path program 1 times [2019-04-05 12:01:55,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:55,211 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:55,211 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000 was UNSAFE (32/50) [2019-04-05 12:01:55,213 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,214 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,214 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,214 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,214 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,214 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,214 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,214 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID009_ID014======== [2019-04-05 12:01:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-04-05 12:01:55,215 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,216 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID009_ID014]=== [2019-04-05 12:01:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash -415580264, now seen corresponding path program 1 times [2019-04-05 12:01:55,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,230 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,230 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,232 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2019-04-05 12:01:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,232 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,232 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-04-05 12:01:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,233 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,234 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID009_ID014 was SAFE (33/50) [2019-04-05 12:01:55,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,235 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,235 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,235 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007======== [2019-04-05 12:01:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-05 12:01:55,237 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,238 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007]=== [2019-04-05 12:01:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash -841871124, now seen corresponding path program 1 times [2019-04-05 12:01:55,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,253 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,254 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,254 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-04-05 12:01:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,254 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,254 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-04-05 12:01:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,256 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,256 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007 was SAFE (34/50) [2019-04-05 12:01:55,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,257 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,257 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,258 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,258 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,258 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014======== [2019-04-05 12:01:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-04-05 12:01:55,260 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,260 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014]=== [2019-04-05 12:01:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1796999938, now seen corresponding path program 1 times [2019-04-05 12:01:55,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,275 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,276 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,276 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2019-04-05 12:01:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,277 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,277 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-04-05 12:01:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,278 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,279 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014 was SAFE (35/50) [2019-04-05 12:01:55,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,279 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,279 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,279 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,280 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004======== [2019-04-05 12:01:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-04-05 12:01:55,282 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,282 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004]=== [2019-04-05 12:01:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1796213590, now seen corresponding path program 1 times [2019-04-05 12:01:55,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:55,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 12:01:55,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 12:01:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 12:01:55,438 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-05 12:01:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,507 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 12:01:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 12:01:55,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-04-05 12:01:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,509 INFO L225 Difference]: With dead ends: 146 [2019-04-05 12:01:55,509 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 12:01:55,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 12:01:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 12:01:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2019-04-05 12:01:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-04-05 12:01:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-04-05 12:01:55,513 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 28 [2019-04-05 12:01:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,513 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-04-05 12:01:55,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 12:01:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-04-05 12:01:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-04-05 12:01:55,514 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004]=== [2019-04-05 12:01:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -178190395, now seen corresponding path program 1 times [2019-04-05 12:01:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 12:01:55,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:55,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 12:01:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 12:01:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:55,668 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 3 states. [2019-04-05 12:01:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,718 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-04-05 12:01:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 12:01:55,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-04-05 12:01:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,719 INFO L225 Difference]: With dead ends: 79 [2019-04-05 12:01:55,720 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-04-05 12:01:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,721 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 12:01:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,721 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004 was SAFE (36/50) [2019-04-05 12:01:55,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,722 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,722 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,722 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,722 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,723 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr41ASSERT_VIOLATIONVACUOUSforID009======== [2019-04-05 12:01:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-04-05 12:01:55,724 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,725 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr41ASSERT_VIOLATIONVACUOUSforID009]=== [2019-04-05 12:01:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash 247778662, now seen corresponding path program 1 times [2019-04-05 12:01:55,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:55,733 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:55,733 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr41ASSERT_VIOLATIONVACUOUSforID009 was UNSAFE (37/50) [2019-04-05 12:01:55,734 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,734 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,734 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,735 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010======== [2019-04-05 12:01:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-05 12:01:55,736 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-05 12:01:55,736 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010]=== [2019-04-05 12:01:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash 95454, now seen corresponding path program 1 times [2019-04-05 12:01:55,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:55,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:55,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,749 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:55,750 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:55,750 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-04-05 12:01:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:55,750 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:55,751 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:55,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:55,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-04-05 12:01:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:55,752 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:55,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:55,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:55,752 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010 was SAFE (38/50) [2019-04-05 12:01:55,753 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,753 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,753 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,753 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,753 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,753 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,753 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,753 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,754 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr44ASSERT_VIOLATIONVACUOUSforID012======== [2019-04-05 12:01:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-04-05 12:01:55,755 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,755 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr44ASSERT_VIOLATIONVACUOUSforID012]=== [2019-04-05 12:01:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1474235126, now seen corresponding path program 1 times [2019-04-05 12:01:55,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:55,764 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:55,764 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr44ASSERT_VIOLATIONVACUOUSforID012 was UNSAFE (39/50) [2019-04-05 12:01:55,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,765 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,765 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,765 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,765 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr36ASSERT_VIOLATIONVACUOUSforID006======== [2019-04-05 12:01:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-04-05 12:01:55,767 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:55,767 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr36ASSERT_VIOLATIONVACUOUSforID006]=== [2019-04-05 12:01:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash -393816830, now seen corresponding path program 1 times [2019-04-05 12:01:55,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:55,775 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:55,776 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr36ASSERT_VIOLATIONVACUOUSforID006 was UNSAFE (40/50) [2019-04-05 12:01:55,776 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:55,776 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:55,776 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:55,776 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:55,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:55,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:55,777 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:55,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:55,777 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014======== [2019-04-05 12:01:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-05 12:01:55,778 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:55,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-05 12:01:55,778 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014]=== [2019-04-05 12:01:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash 91742432, now seen corresponding path program 1 times [2019-04-05 12:01:55,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:55,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:55,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:55,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:55,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:55,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 12:01:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 12:01:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 12:01:55,950 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-05 12:01:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,004 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-04-05 12:01:56,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 12:01:56,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-04-05 12:01:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,005 INFO L225 Difference]: With dead ends: 145 [2019-04-05 12:01:56,005 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 12:01:56,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 12:01:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 12:01:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2019-04-05 12:01:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-04-05 12:01:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-04-05 12:01:56,007 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 5 [2019-04-05 12:01:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,008 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-04-05 12:01:56,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 12:01:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-04-05 12:01:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-04-05 12:01:56,008 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,009 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014]=== [2019-04-05 12:01:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -412060335, now seen corresponding path program 1 times [2019-04-05 12:01:56,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 12:01:56,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:56,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 12:01:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 12:01:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:56,138 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 3 states. [2019-04-05 12:01:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,192 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-04-05 12:01:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 12:01:56,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-04-05 12:01:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,193 INFO L225 Difference]: With dead ends: 56 [2019-04-05 12:01:56,194 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:56,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:56,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-04-05 12:01:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,195 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:56,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 12:01:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:56,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:56,196 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014 was SAFE (41/50) [2019-04-05 12:01:56,196 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,196 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,196 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,197 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,197 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,198 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014======== [2019-04-05 12:01:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-04-05 12:01:56,200 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,200 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014]=== [2019-04-05 12:01:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash -151953160, now seen corresponding path program 1 times [2019-04-05 12:01:56,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:56,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:56,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,229 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,230 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:56,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-04-05 12:01:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,230 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:56,230 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:56,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:56,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-04-05 12:01:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,231 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:56,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:56,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:56,232 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014 was SAFE (42/50) [2019-04-05 12:01:56,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,236 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,236 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,236 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,236 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,236 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,236 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,237 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr37ASSERT_VIOLATIONVACUOUSforID011======== [2019-04-05 12:01:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-04-05 12:01:56,238 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,239 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr37ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-05 12:01:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 676580578, now seen corresponding path program 1 times [2019-04-05 12:01:56,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:56,247 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:56,247 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr37ASSERT_VIOLATIONVACUOUSforID011 was UNSAFE (43/50) [2019-04-05 12:01:56,248 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,248 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,248 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,248 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,248 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr48ASSERT_VIOLATIONVACUOUSforID014======== [2019-04-05 12:01:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-04-05 12:01:56,250 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,250 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr48ASSERT_VIOLATIONVACUOUSforID014]=== [2019-04-05 12:01:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash 368588046, now seen corresponding path program 1 times [2019-04-05 12:01:56,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:56,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:56,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 12:01:56,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 12:01:56,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:56,371 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2019-04-05 12:01:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,474 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-04-05 12:01:56,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 12:01:56,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-04-05 12:01:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,475 INFO L225 Difference]: With dead ends: 145 [2019-04-05 12:01:56,475 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 12:01:56,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 12:01:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-04-05 12:01:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-04-05 12:01:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-04-05 12:01:56,478 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 51 [2019-04-05 12:01:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,479 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-04-05 12:01:56,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 12:01:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-04-05 12:01:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-04-05 12:01:56,480 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,480 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-04-05 12:01:56,480 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr48ASSERT_VIOLATIONVACUOUSforID014]=== [2019-04-05 12:01:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1090999361, now seen corresponding path program 1 times [2019-04-05 12:01:56,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:56,508 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:56,508 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr48ASSERT_VIOLATIONVACUOUSforID014 was UNSAFE (44/50) [2019-04-05 12:01:56,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,509 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,509 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,510 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,510 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID010_ID002======== [2019-04-05 12:01:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-05 12:01:56,511 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID010_ID002]=== [2019-04-05 12:01:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash 383481066, now seen corresponding path program 1 times [2019-04-05 12:01:56,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:56,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:56,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,525 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,525 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:56,526 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-04-05 12:01:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,526 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:56,526 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:56,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:56,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-04-05 12:01:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,527 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:56,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:56,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:56,528 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID010_ID002 was SAFE (45/50) [2019-04-05 12:01:56,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,528 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,528 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,529 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,529 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,529 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,529 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,529 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,529 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID010_ID014======== [2019-04-05 12:01:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-05 12:01:56,531 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID010_ID014]=== [2019-04-05 12:01:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1734612210, now seen corresponding path program 1 times [2019-04-05 12:01:56,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:56,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,545 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,546 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:56,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-04-05 12:01:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,547 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:56,547 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:56,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:56,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-04-05 12:01:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,548 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:56,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:56,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:56,550 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID010_ID014 was SAFE (46/50) [2019-04-05 12:01:56,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,551 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,551 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,551 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,551 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,551 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,551 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003======== [2019-04-05 12:01:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-05 12:01:56,553 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,553 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003]=== [2019-04-05 12:01:56,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash -95333146, now seen corresponding path program 1 times [2019-04-05 12:01:56,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:56,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 12:01:56,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 12:01:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 12:01:56,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,571 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 2 states. [2019-04-05 12:01:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,572 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-04-05 12:01:56,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 12:01:56,573 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-04-05 12:01:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,573 INFO L225 Difference]: With dead ends: 74 [2019-04-05 12:01:56,573 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:56,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 12:01:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:56,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-04-05 12:01:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,574 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:56,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 12:01:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:56,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:56,575 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 was SAFE (47/50) [2019-04-05 12:01:56,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,577 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,577 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,577 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,577 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,577 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,577 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,577 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,578 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr40ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-05 12:01:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-04-05 12:01:56,579 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr40ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-05 12:01:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash -269101818, now seen corresponding path program 1 times [2019-04-05 12:01:56,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:56,590 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:56,590 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr40ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (48/50) [2019-04-05 12:01:56,591 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,592 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,592 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,592 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,592 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,592 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,592 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,592 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr35ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-05 12:01:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-04-05 12:01:56,594 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr35ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-05 12:01:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1952366432, now seen corresponding path program 1 times [2019-04-05 12:01:56,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 12:01:56,602 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 12:01:56,603 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr35ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (49/50) [2019-04-05 12:01:56,603 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 12:01:56,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 12:01:56,603 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 12:01:56,603 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 12:01:56,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 12:01:56,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 12:01:56,604 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 12:01:56,604 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 12:01:56,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012======== [2019-04-05 12:01:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2019-04-05 12:01:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-05 12:01:56,605 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-05 12:01:56,605 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012]=== [2019-04-05 12:01:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2959422, now seen corresponding path program 1 times [2019-04-05 12:01:56,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 12:01:56,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:56,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 12:01:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 12:01:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 12:01:56,695 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2019-04-05 12:01:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:56,783 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-04-05 12:01:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 12:01:56,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-04-05 12:01:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:56,784 INFO L225 Difference]: With dead ends: 146 [2019-04-05 12:01:56,784 INFO L226 Difference]: Without dead ends: 104 [2019-04-05 12:01:56,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 12:01:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-04-05 12:01:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 56. [2019-04-05 12:01:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-04-05 12:01:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-04-05 12:01:56,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 4 [2019-04-05 12:01:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:56,786 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-04-05 12:01:56,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 12:01:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-04-05 12:01:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-04-05 12:01:56,787 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 12:01:56,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 12:01:56,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012]=== [2019-04-05 12:01:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 12:01:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1233633709, now seen corresponding path program 1 times [2019-04-05 12:01:56,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 12:01:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 12:01:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 12:01:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 12:01:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 12:01:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 12:01:56,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 12:01:56,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 12:01:56,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 12:01:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 12:01:56,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:56,940 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 3 states. [2019-04-05 12:01:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 12:01:57,003 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-04-05 12:01:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 12:01:57,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-04-05 12:01:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 12:01:57,005 INFO L225 Difference]: With dead ends: 55 [2019-04-05 12:01:57,005 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 12:01:57,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 12:01:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 12:01:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 12:01:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 12:01:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 12:01:57,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-04-05 12:01:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 12:01:57,006 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 12:01:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 12:01:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 12:01:57,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 12:01:57,006 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012 was SAFE (50/50) [2019-04-05 12:01:57,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:01:57 BoogieIcfgContainer [2019-04-05 12:01:57,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-05 12:01:57,008 INFO L168 Benchmark]: Toolchain (without parser) took 320111.99 ms. Allocated memory was 134.7 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 110.0 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,009 INFO L168 Benchmark]: ReqParser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,011 INFO L168 Benchmark]: PEA to Boogie took 1163.22 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 110.0 MB in the beginning and 84.9 MB in the end (delta: 25.2 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,012 INFO L168 Benchmark]: Boogie Printer took 17.82 ms. Allocated memory is still 169.3 MB. Free memory was 84.9 MB in the beginning and 83.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,013 INFO L168 Benchmark]: Boogie Preprocessor took 134.38 ms. Allocated memory is still 169.3 MB. Free memory was 83.4 MB in the beginning and 79.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,013 INFO L168 Benchmark]: RCFGBuilder took 6168.45 ms. Allocated memory was 169.3 MB in the beginning and 229.6 MB in the end (delta: 60.3 MB). Free memory was 78.9 MB in the beginning and 73.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,015 INFO L168 Benchmark]: TraceAbstraction took 312623.69 ms. Allocated memory was 229.6 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 73.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-04-05 12:01:57,023 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * ReqParser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * PEA to Boogie took 1163.22 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 110.0 MB in the beginning and 84.9 MB in the end (delta: 25.2 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. * Boogie Printer took 17.82 ms. Allocated memory is still 169.3 MB. Free memory was 84.9 MB in the beginning and 83.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.38 ms. Allocated memory is still 169.3 MB. Free memory was 83.4 MB in the beginning and 79.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6168.45 ms. Allocated memory was 169.3 MB in the beginning and 229.6 MB in the end (delta: 60.3 MB). Free memory was 78.9 MB in the beginning and 73.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 312623.69 ms. Allocated memory was 229.6 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 73.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID010 are rt-consistent Requirements ID011, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID003 are rt-consistent Requirements ID010, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID010_ID003 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID009 are rt-consistent Requirements ID010, ID009 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID010_ID009 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID006, ID010 are rt-consistent Requirements ID006, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID006_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID004 is non-vacuous Requirement ID004 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr46ASSERT_VIOLATIONVACUOUSforID004 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID001, ID010 are rt-consistent Requirements ID001, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID004 are rt-consistent Requirements ID010, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr18ASSERT_VIOLATIONRTINCONSISTENTforID010_ID004 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID010 is non-vacuous Requirement ID010 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr38ASSERT_VIOLATIONVACUOUSforID010 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 32 SDslu, 70 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID012 are rt-consistent Requirements ID010, ID012 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID010_ID012 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID013 is non-vacuous Requirement ID013 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr34ASSERT_VIOLATIONVACUOUSforID013 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID001, ID014 are rt-consistent Requirements ID001, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID007 is non-vacuous Requirement ID007 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr42ASSERT_VIOLATIONVACUOUSforID007 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 6.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 84 SDslu, 315 SDs, 0 SdLazy, 22 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=2, 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, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 10 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/88 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [UNKNOWN] : All requirements are consistent All requirements are consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr49ASSERT_VIOLATIONCONSISTENCYforallrequirements CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID008 is non-vacuous Requirement ID008 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr43ASSERT_VIOLATIONVACUOUSforID008 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID007, ID014 are rt-consistent Requirements ID007, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr28ASSERT_VIOLATIONRTINCONSISTENTforID007_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID003 is non-vacuous Requirement ID003 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr39ASSERT_VIOLATIONVACUOUSforID003 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID005 are rt-consistent Requirements ID010, ID005 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID010_ID005 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID000 are rt-consistent Requirements ID010, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr19ASSERT_VIOLATIONRTINCONSISTENTforID010_ID000 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID008 are rt-consistent Requirements ID002, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr24ASSERT_VIOLATIONRTINCONSISTENTforID002_ID008 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.9s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 141 SDslu, 133 SDs, 0 SdLazy, 22 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 26/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID006, ID014 are rt-consistent Requirements ID006, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID006_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID012, ID014 are rt-consistent Requirements ID012, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr30ASSERT_VIOLATIONRTINCONSISTENTforID012_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID008 are rt-consistent Requirements ID010, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID010_ID008 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that Requirement ID005 is non-vacuous (line -1). Cancelled while BasicCegarLoop was analyzing trace of length 151 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while DnfTransformerHelper was XNF transformer was simplifying 1720320 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr45ASSERT_VIOLATIONVACUOUSforID005 CFG has 1 procedures, 103 locations, 50 error locations. TIMEOUT Result, 300.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 203 SDslu, 384 SDs, 0 SdLazy, 30 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=2, 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, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 16 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/94 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID008 are rt-consistent Requirements ID003, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr21ASSERT_VIOLATIONRTINCONSISTENTforID003_ID008 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID005, ID014 are rt-consistent Requirements ID005, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr31ASSERT_VIOLATIONRTINCONSISTENTforID005_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID014 are rt-consistent Requirements ID011, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID002 are rt-consistent Requirements ID011, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 1.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 541 SDslu, 182 SDs, 0 SdLazy, 27 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 7 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID000, ID014 are rt-consistent Requirements ID000, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr33ASSERT_VIOLATIONRTINCONSISTENTforID000_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID004 are rt-consistent Requirements ID003, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr22ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID014 are rt-consistent Requirements ID003, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr23ASSERT_VIOLATIONRTINCONSISTENTforID003_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID008, ID014 are rt-consistent Requirements ID008, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr29ASSERT_VIOLATIONRTINCONSISTENTforID008_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID000 is non-vacuous Requirement ID000 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr47ASSERT_VIOLATIONVACUOUSforID000 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID009, ID014 are rt-consistent Requirements ID009, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr27ASSERT_VIOLATIONRTINCONSISTENTforID009_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID007 are rt-consistent Requirements ID010, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID010_ID007 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID004, ID014 are rt-consistent Requirements ID004, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr32ASSERT_VIOLATIONRTINCONSISTENTforID004_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID004 are rt-consistent Requirements ID002, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr25ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 139 SDslu, 133 SDs, 0 SdLazy, 22 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID009 is non-vacuous Requirement ID009 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr41ASSERT_VIOLATIONVACUOUSforID009 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID013, ID010 are rt-consistent Requirements ID013, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID013_ID010 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID012 is non-vacuous Requirement ID012 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr44ASSERT_VIOLATIONVACUOUSforID012 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID006 is non-vacuous Requirement ID006 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr36ASSERT_VIOLATIONVACUOUSforID006 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID013, ID014 are rt-consistent Requirements ID013, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID013_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 117 SDslu, 138 SDs, 0 SdLazy, 12 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID002, ID014 are rt-consistent Requirements ID002, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr26ASSERT_VIOLATIONRTINCONSISTENTforID002_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID011 is non-vacuous Requirement ID011 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr37ASSERT_VIOLATIONVACUOUSforID011 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID014 is non-vacuous Requirement ID014 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr48ASSERT_VIOLATIONVACUOUSforID014 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 21 SDslu, 69 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID002 are rt-consistent Requirements ID010, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID010_ID002 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID010, ID014 are rt-consistent Requirements ID010, ID014 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr20ASSERT_VIOLATIONRTINCONSISTENTforID010_ID014 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID003 are rt-consistent Requirements ID011, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID003 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr40ASSERT_VIOLATIONVACUOUSforID002 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID001 is non-vacuous Requirement ID001 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr35ASSERT_VIOLATIONVACUOUSforID001 CFG has 1 procedures, 103 locations, 50 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID013, ID012 are rt-consistent Requirements ID013, ID012 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID013_ID012 CFG has 1 procedures, 103 locations, 50 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 187 SDslu, 136 SDs, 0 SdLazy, 18 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred 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, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...