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/exampleDeadlock.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-05 11:56:29,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-05 11:56:29,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-05 11:56:29,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-05 11:56:29,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-05 11:56:29,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-05 11:56:29,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-05 11:56:29,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-05 11:56:29,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-05 11:56:29,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-05 11:56:29,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-05 11:56:29,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-05 11:56:29,649 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-05 11:56:29,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-05 11:56:29,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-05 11:56:29,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-05 11:56:29,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-05 11:56:29,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-05 11:56:29,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-05 11:56:29,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-05 11:56:29,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-05 11:56:29,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-05 11:56:29,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-05 11:56:29,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-05 11:56:29,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-05 11:56:29,676 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-05 11:56:29,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-05 11:56:29,678 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-05 11:56:29,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-05 11:56:29,680 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-05 11:56:29,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-05 11:56:29,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-05 11:56:29,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-05 11:56:29,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-05 11:56:29,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-05 11:56:29,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-05 11:56:29,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-05 11:56:29,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-05 11:56:29,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-05 11:56:29,687 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-05 11:56:29,698 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-05 11:56:29,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-05 11:56:29,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-05 11:56:29,700 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-05 11:56:29,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:29,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:29,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-05 11:56:29,701 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-05 11:56:29,701 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-05 11:56:29,701 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-05 11:56:29,702 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-05 11:56:29,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-05 11:56:29,702 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:29,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-05 11:56:29,747 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-05 11:56:29,750 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-05 11:56:29,752 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-05 11:56:29,753 INFO L276 PluginConnector]: ReqParser initialized [2019-04-05 11:56:29,753 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/exampleDeadlock.new.req [2019-04-05 11:56:29,754 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/exampleDeadlock.new.req [2019-04-05 11:56:29,808 INFO L134 ReqParser]: 15 requirements (8 non-initialization) in total [2019-04-05 11:56:29,812 INFO L134 ReqParser]: 15 requirements (8 non-initialization) after unification [2019-04-05 11:56:29,821 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-05 11:56:29,822 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-05 11:56:29,823 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-05 11:56:29,823 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-05 11:56:29,823 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-05 11:56:29,825 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:29" (1/1) ... [2019-04-05 11:56:29,833 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:29,844 INFO L59 ReqToPEA]: Transforming 8 requirements to PEAs [2019-04-05 11:56:29,868 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-05 11:56:29,869 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 2 [2019-04-05 11:56:29,869 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.UniversalityPattern : 1 [2019-04-05 11:56:29,869 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.PrecedencePattern : 1 [2019-04-05 11:56:29,869 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.PrecedenceChain12Pattern : 1 [2019-04-05 11:56:29,869 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 2 [2019-04-05 11:56:29,869 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.InstAbsPattern : 1 [2019-04-05 11:56:29,870 INFO L92 ReqToPEA]: Finished transforming 8 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:30,061 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 4 [2019-04-05 11:56:30,084 WARN L496 Req2BoogieTranslator]: phase without clock or state invariant for ID005: Globally, it is always the case that if "x0004" holds, then "x0006", previously held [2019-04-05 11:56:30,088 WARN L496 Req2BoogieTranslator]: phase without clock or state invariant for ID004: Globally, it is always the case that if "x0004" holds and is succeeded by "x0005", then "x0006" previously held [2019-04-05 11:56:30,092 INFO L769 Req2BoogieTranslator]: 2 of 8 requirements are invariant [2019-04-05 11:56:30,093 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 15 subsets [2019-04-05 11:56:30,405 INFO L284 cyConditionGenerator]: 15 checks, 3 trivial consistent, 12 non-trivial [2019-04-05 11:56:30,405 INFO L290 cyConditionGenerator]: Of 195 formulas, 0 were quantified, 195 were plain. Needed 51 quantifier elimination runs, 0 quantified solver queries. [2019-04-05 11:56:30,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30 Unit [2019-04-05 11:56:30,413 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-05 11:56:30,414 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-05 11:56:30,414 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-05 11:56:30,414 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-05 11:56:30,415 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,415 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-05 11:56:30,416 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-05 11:56:30,425 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-05 11:56:30,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-05 11:56:30,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-05 11:56:30,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-05 11:56:30,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (1/1) ... [2019-04-05 11:56:30,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-05 11:56:30,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-05 11:56:30,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-05 11:56:30,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-05 11:56:30,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (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) [2019-04-05 11:56:30,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-05 11:56:30,529 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-05 11:56:30,529 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-05 11:56:33,613 INFO L278 CfgBuilder]: Using library mode [2019-04-05 11:56:33,613 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-05 11:56:33,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:33 BoogieIcfgContainer [2019-04-05 11:56:33,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-05 11:56:33,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-05 11:56:33,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-05 11:56:33,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-05 11:56:33,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 05.04 11:56:29" (1/3) ... [2019-04-05 11:56:33,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b9921e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 05.04 11:56:33, skipping insertion in model container [2019-04-05 11:56:33,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 05.04 11:56:30" (2/3) ... [2019-04-05 11:56:33,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b9921e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:56:33, skipping insertion in model container [2019-04-05 11:56:33,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:56:33" (3/3) ... [2019-04-05 11:56:33,627 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-05 11:56:33,639 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-05 11:56:33,646 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-04-05 11:56:33,669 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:33,708 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:33,709 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:33,709 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:33,709 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:33,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:33,712 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:33,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:33,712 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-05 11:56:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-05 11:56:33,755 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:33,757 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:33,759 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-05 11:56:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1724096196, now seen corresponding path program 1 times [2019-04-05 11:56:33,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:33,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:34,071 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-04-05 11:56:34,146 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:34,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:34,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:34,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:34,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:34,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:34,172 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:34,265 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-04-05 11:56:34,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:34,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-04-05 11:56:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:34,276 INFO L225 Difference]: With dead ends: 68 [2019-04-05 11:56:34,277 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:34,279 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 11:56:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-04-05 11:56:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-04-05 11:56:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-04-05 11:56:34,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 16 [2019-04-05 11:56:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:34,318 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-04-05 11:56:34,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-04-05 11:56:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-04-05 11:56:34,319 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:34,320 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:34,320 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr13ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-05 11:56:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 868540112, now seen corresponding path program 1 times [2019-04-05 11:56:34,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:34,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:34,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:34,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:34,717 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:34,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:34,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-04-05 11:56:34,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 11:56:35,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:35,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-04-05 11:56:35,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-05 11:56:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-05 11:56:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-04-05 11:56:35,058 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 6 states. [2019-04-05 11:56:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:35,149 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-04-05 11:56:35,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:35,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-04-05 11:56:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:35,152 INFO L225 Difference]: With dead ends: 36 [2019-04-05 11:56:35,152 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:35,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-04-05 11:56:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:35,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-04-05 11:56:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:35,155 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:35,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-05 11:56:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:35,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:35,159 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONVACUOUSforID001 was SAFE (1/19) [2019-04-05 11:56:35,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,161 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,162 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,162 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,162 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr18ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-05 11:56:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-04-05 11:56:35,166 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,166 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:35,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr18ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-05 11:56:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1369450358, now seen corresponding path program 1 times [2019-04-05 11:56:35,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:35,190 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:35,201 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr18ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (2/19) [2019-04-05 11:56:35,201 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,202 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,202 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,202 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,203 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID003======== [2019-04-05 11:56:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-05 11:56:35,209 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-05 11:56:35,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID003]=== [2019-04-05 11:56:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash 51428, now seen corresponding path program 1 times [2019-04-05 11:56:35,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:35,496 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:35,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:35,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:35,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:35,498 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:35,606 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-04-05 11:56:35,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:35,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-04-05 11:56:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:35,608 INFO L225 Difference]: With dead ends: 67 [2019-04-05 11:56:35,609 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:35,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 24. [2019-04-05 11:56:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-04-05 11:56:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-04-05 11:56:35,615 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 3 [2019-04-05 11:56:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:35,615 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-04-05 11:56:35,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-04-05 11:56:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-05 11:56:35,616 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,617 INFO L402 BasicCegarLoop]: trace histogram [2, 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:35,618 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID003]=== [2019-04-05 11:56:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1782343000, now seen corresponding path program 1 times [2019-04-05 11:56:35,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:35,693 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:35,696 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID003 was UNSAFE (3/19) [2019-04-05 11:56:35,697 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,698 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,698 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,698 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,698 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,698 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,698 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,698 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,699 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID005_ID007======== [2019-04-05 11:56:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-05 11:56:35,702 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:35,702 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID005_ID007]=== [2019-04-05 11:56:35,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1776190656, now seen corresponding path program 1 times [2019-04-05 11:56:35,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:35,731 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:35,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:35,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:35,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:35,733 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-04-05 11:56:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:35,737 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-04-05 11:56:35,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:35,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-04-05 11:56:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:35,737 INFO L225 Difference]: With dead ends: 35 [2019-04-05 11:56:35,738 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:35,738 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:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:35,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-04-05 11:56:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:35,739 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:35,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:35,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:35,740 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID005_ID007 was SAFE (4/19) [2019-04-05 11:56:35,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,742 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,742 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,742 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,743 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID005_ID004======== [2019-04-05 11:56:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-05 11:56:35,745 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:35,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID005_ID004]=== [2019-04-05 11:56:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash 772664686, now seen corresponding path program 1 times [2019-04-05 11:56:35,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:35,840 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:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:35,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:35,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:35,842 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:35,905 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-04-05 11:56:35,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:35,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-04-05 11:56:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:35,907 INFO L225 Difference]: With dead ends: 30 [2019-04-05 11:56:35,908 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:35,908 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 11:56:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:35,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-04-05 11:56:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:35,911 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:35,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:35,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:35,912 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID005_ID004 was SAFE (5/19) [2019-04-05 11:56:35,913 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,913 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,913 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,913 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,914 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,914 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,914 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,914 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-05 11:56:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-05 11:56:35,916 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:35,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-05 11:56:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash -498573328, now seen corresponding path program 1 times [2019-04-05 11:56:35,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:35,931 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:35,932 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (6/19) [2019-04-05 11:56:35,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,935 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,935 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,935 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,935 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,935 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,936 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,936 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,936 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID003======== [2019-04-05 11:56:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-05 11:56:35,941 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-05 11:56:35,941 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID003]=== [2019-04-05 11:56:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1532246522, now seen corresponding path program 1 times [2019-04-05 11:56:35,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:35,959 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:35,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:35,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:35,965 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-04-05 11:56:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:35,967 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-04-05 11:56:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:35,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-04-05 11:56:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:35,968 INFO L225 Difference]: With dead ends: 35 [2019-04-05 11:56:35,968 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:35,969 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:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:35,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-04-05 11:56:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:35,970 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:35,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:35,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:35,971 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID003 was SAFE (7/19) [2019-04-05 11:56:35,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:35,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:35,972 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:35,973 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:35,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:35,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:35,973 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:35,973 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:35,973 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONVACUOUSforID007======== [2019-04-05 11:56:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-05 11:56:35,975 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:35,975 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:35,976 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-05 11:56:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash -963937036, now seen corresponding path program 1 times [2019-04-05 11:56:35,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:35,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:35,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:36,076 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:36,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:36,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:36,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:36,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:36,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:36,078 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-04-05 11:56:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:36,143 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-04-05 11:56:36,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:36,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-04-05 11:56:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:36,146 INFO L225 Difference]: With dead ends: 68 [2019-04-05 11:56:36,146 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:36,146 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:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-04-05 11:56:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-04-05 11:56:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-04-05 11:56:36,151 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 19 [2019-04-05 11:56:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:36,152 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-04-05 11:56:36,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-04-05 11:56:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-04-05 11:56:36,153 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:36,154 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-04-05 11:56:36,154 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr16ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-05 11:56:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1795666280, now seen corresponding path program 1 times [2019-04-05 11:56:36,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:36,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:36,396 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-04-05 11:56:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:36,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:36,559 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:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:36,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2019-04-05 11:56:36,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:36,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:36,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-04-05 11:56:36,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-04-05 11:56:36,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-04-05 11:56:36,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:36,667 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2019-04-05 11:56:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:36,700 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-04-05 11:56:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:36,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-04-05 11:56:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:36,705 INFO L225 Difference]: With dead ends: 39 [2019-04-05 11:56:36,705 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:36,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-04-05 11:56:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:36,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-04-05 11:56:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:36,708 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:36,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-04-05 11:56:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:36,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:36,709 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONVACUOUSforID007 was SAFE (8/19) [2019-04-05 11:56:36,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:36,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:36,713 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:36,714 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:36,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:36,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:36,714 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:36,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:36,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID003_ID005======== [2019-04-05 11:56:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-05 11:56:36,716 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:36,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:36,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID003_ID005]=== [2019-04-05 11:56:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash 243875946, now seen corresponding path program 1 times [2019-04-05 11:56:36,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:36,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:36,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:36,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:36,731 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:36,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:36,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:36,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:36,734 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-04-05 11:56:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:36,735 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-04-05 11:56:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:36,735 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-04-05 11:56:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:36,740 INFO L225 Difference]: With dead ends: 35 [2019-04-05 11:56:36,740 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:36,741 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:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:36,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-04-05 11:56:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:36,743 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:36,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:36,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:36,744 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID003_ID005 was SAFE (9/19) [2019-04-05 11:56:36,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:36,745 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:36,745 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:36,745 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:36,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:36,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:36,746 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:36,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:36,746 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID004======== [2019-04-05 11:56:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-05 11:56:36,750 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:36,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:36,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID004]=== [2019-04-05 11:56:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -684869700, now seen corresponding path program 1 times [2019-04-05 11:56:36,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:36,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:36,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:36,929 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:36,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:36,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:36,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:36,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:36,931 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:37,064 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-04-05 11:56:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:37,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-04-05 11:56:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:37,066 INFO L225 Difference]: With dead ends: 63 [2019-04-05 11:56:37,066 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:37,067 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 11:56:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2019-04-05 11:56:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-04-05 11:56:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-04-05 11:56:37,071 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 8 [2019-04-05 11:56:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:37,071 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-04-05 11:56:37,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-04-05 11:56:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-04-05 11:56:37,072 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:37,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:37,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID004]=== [2019-04-05 11:56:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1815755832, now seen corresponding path program 1 times [2019-04-05 11:56:37,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:37,525 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-04-05 11:56:37,739 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-04-05 11:56:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:37,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:37,740 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:37,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:37,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2019-04-05 11:56:37,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-05 11:56:37,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:37,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2] total 3 [2019-04-05 11:56:37,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-04-05 11:56:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-04-05 11:56:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:37,851 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 5 states. [2019-04-05 11:56:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:37,919 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-04-05 11:56:37,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:37,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-04-05 11:56:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:37,921 INFO L225 Difference]: With dead ends: 28 [2019-04-05 11:56:37,921 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:37,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-04-05 11:56:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:37,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-04-05 11:56:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:37,922 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:37,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-04-05 11:56:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:37,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:37,923 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID004 was SAFE (10/19) [2019-04-05 11:56:37,924 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:37,924 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:37,924 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:37,925 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:37,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:37,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:37,925 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:37,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:37,925 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr14ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-05 11:56:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-05 11:56:37,927 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:37,927 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 11:56:37,927 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr14ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-05 11:56:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1907374706, now seen corresponding path program 1 times [2019-04-05 11:56:37,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:37,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:38,025 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:38,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:38,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:38,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-05 11:56:38,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-05 11:56:38,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-05 11:56:38,026 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-04-05 11:56:38,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:38,083 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-04-05 11:56:38,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-05 11:56:38,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-04-05 11:56:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:38,084 INFO L225 Difference]: With dead ends: 67 [2019-04-05 11:56:38,084 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:38,084 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:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-04-05 11:56:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-04-05 11:56:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-04-05 11:56:38,089 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 17 [2019-04-05 11:56:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:38,089 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-04-05 11:56:38,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-05 11:56:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-04-05 11:56:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-04-05 11:56:38,090 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,090 INFO L402 BasicCegarLoop]: trace histogram [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:38,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr14ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-05 11:56:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1154939878, now seen corresponding path program 1 times [2019-04-05 11:56:38,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-05 11:56:38,107 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-05 11:56:38,108 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr14ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (11/19) [2019-04-05 11:56:38,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:38,110 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:38,110 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:38,110 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:38,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:38,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:38,110 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:38,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:38,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID007======== [2019-04-05 11:56:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-05 11:56:38,112 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-05 11:56:38,112 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID007]=== [2019-04-05 11:56:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1594424, now seen corresponding path program 1 times [2019-04-05 11:56:38,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:38,121 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:38,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:38,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:38,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:38,123 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-04-05 11:56:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:38,123 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-04-05 11:56:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:38,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-04-05 11:56:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:38,124 INFO L225 Difference]: With dead ends: 35 [2019-04-05 11:56:38,124 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:38,125 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:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:38,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-05 11:56:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:38,126 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:38,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:38,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:38,127 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID007 was SAFE (12/19) [2019-04-05 11:56:38,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:38,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:38,128 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:38,128 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:38,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:38,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:38,128 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:38,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:38,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID003_ID007======== [2019-04-05 11:56:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-05 11:56:38,129 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:38,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID003_ID007]=== [2019-04-05 11:56:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1029780098, now seen corresponding path program 1 times [2019-04-05 11:56:38,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:38,139 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:38,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:38,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:38,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:38,141 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-04-05 11:56:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:38,142 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-04-05 11:56:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:38,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-05 11:56:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:38,142 INFO L225 Difference]: With dead ends: 35 [2019-04-05 11:56:38,142 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:38,143 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:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:38,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-05 11:56:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:38,144 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:38,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:38,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:38,145 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID003_ID007 was SAFE (13/19) [2019-04-05 11:56:38,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:38,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:38,146 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:38,146 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:38,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:38,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:38,147 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:38,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:38,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-05 11:56:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-05 11:56:38,148 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,148 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:38,148 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-05 11:56:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 182723144, now seen corresponding path program 1 times [2019-04-05 11:56:38,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:38,250 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:38,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:38,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:38,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:38,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:38,251 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:38,289 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-04-05 11:56:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:38,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-04-05 11:56:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:38,291 INFO L225 Difference]: With dead ends: 63 [2019-04-05 11:56:38,291 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:38,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-04-05 11:56:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-04-05 11:56:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-04-05 11:56:38,297 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 20 [2019-04-05 11:56:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:38,297 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-04-05 11:56:38,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-04-05 11:56:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-04-05 11:56:38,298 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:38,298 INFO L402 BasicCegarLoop]: trace histogram [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 11:56:38,298 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr17ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-05 11:56:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -168919980, now seen corresponding path program 1 times [2019-04-05 11:56:38,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:38,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:38,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:38,657 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-04-05 11:56:39,043 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-04-05 11:56:39,270 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-04-05 11:56:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:39,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:39,279 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 11:56:39,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-04-05 11:56:39,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:39,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:39,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-04-05 11:56:39,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-04-05 11:56:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-04-05 11:56:39,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-04-05 11:56:39,484 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 7 states. [2019-04-05 11:56:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:39,531 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-04-05 11:56:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-04-05 11:56:39,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-04-05 11:56:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:39,532 INFO L225 Difference]: With dead ends: 41 [2019-04-05 11:56:39,533 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:39,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-04-05 11:56:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:39,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-04-05 11:56:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:39,534 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:39,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-04-05 11:56:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:39,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:39,535 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONVACUOUSforID004 was SAFE (14/19) [2019-04-05 11:56:39,536 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:39,536 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:39,536 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:39,536 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:39,536 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:39,536 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:39,536 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:39,536 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:39,537 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004======== [2019-04-05 11:56:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-05 11:56:39,538 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:39,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:39,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004]=== [2019-04-05 11:56:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1858411796, now seen corresponding path program 1 times [2019-04-05 11:56:39,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:39,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:39,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:39,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:39,759 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-04-05 11:56:39,760 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:39,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:39,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:39,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:39,762 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:39,959 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-04-05 11:56:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,067 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-04-05 11:56:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:40,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-04-05 11:56:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,069 INFO L225 Difference]: With dead ends: 30 [2019-04-05 11:56:40,069 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,070 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:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-04-05 11:56:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,071 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,072 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004 was SAFE (15/19) [2019-04-05 11:56:40,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,074 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,074 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,074 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,074 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,074 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007======== [2019-04-05 11:56:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-05 11:56:40,076 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007]=== [2019-04-05 11:56:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash 255002088, now seen corresponding path program 1 times [2019-04-05 11:56:40,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,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:40,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-05 11:56:40,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-05 11:56:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-05 11:56:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-05 11:56:40,091 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-04-05 11:56:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,092 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-04-05 11:56:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-05 11:56:40,092 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-04-05 11:56:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,093 INFO L225 Difference]: With dead ends: 35 [2019-04-05 11:56:40,093 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,093 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:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-05 11:56:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,094 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-05 11:56:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,096 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007 was SAFE (16/19) [2019-04-05 11:56:40,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,097 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,097 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,097 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,097 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,098 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID007_ID004======== [2019-04-05 11:56:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-04-05 11:56:40,100 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,100 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID007_ID004]=== [2019-04-05 11:56:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1817198334, now seen corresponding path program 1 times [2019-04-05 11:56:40,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,324 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-04-05 11:56:40,325 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:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:40,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:40,326 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,419 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-04-05 11:56:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:40,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-04-05 11:56:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,419 INFO L225 Difference]: With dead ends: 30 [2019-04-05 11:56:40,419 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-04-05 11:56:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-04-05 11:56:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,421 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,422 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID007_ID004 was SAFE (17/19) [2019-04-05 11:56:40,422 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,423 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,423 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,423 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004======== [2019-04-05 11:56:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-05 11:56:40,425 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-05 11:56:40,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004]=== [2019-04-05 11:56:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 49427302, now seen corresponding path program 1 times [2019-04-05 11:56:40,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,606 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:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:40,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:40,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:40,607 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,634 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-04-05 11:56:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:40,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-04-05 11:56:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,635 INFO L225 Difference]: With dead ends: 30 [2019-04-05 11:56:40,635 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:40,635 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 11:56:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:40,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-05 11:56:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,636 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:40,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:40,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:40,637 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004 was SAFE (18/19) [2019-04-05 11:56:40,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-05 11:56:40,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-05 11:56:40,638 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-05 11:56:40,638 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-05 11:56:40,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-05 11:56:40,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-05 11:56:40,638 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-05 11:56:40,638 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-05 11:56:40,638 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr15ASSERT_VIOLATIONVACUOUSforID005======== [2019-04-05 11:56:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-04-05 11:56:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-04-05 11:56:40,639 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,640 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:40,640 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr15ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-05 11:56:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1000926074, now seen corresponding path program 1 times [2019-04-05 11:56:40,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,689 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:40,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-05 11:56:40,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-05 11:56:40,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-05 11:56:40,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-05 11:56:40,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:40,690 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2019-04-05 11:56:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:40,751 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-04-05 11:56:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-04-05 11:56:40,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-04-05 11:56:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:40,753 INFO L225 Difference]: With dead ends: 68 [2019-04-05 11:56:40,753 INFO L226 Difference]: Without dead ends: 42 [2019-04-05 11:56:40,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-05 11:56:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-04-05 11:56:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-04-05 11:56:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-04-05 11:56:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-04-05 11:56:40,756 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 18 [2019-04-05 11:56:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:40,757 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-04-05 11:56:40,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-05 11:56:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-04-05 11:56:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-04-05 11:56:40,757 INFO L394 BasicCegarLoop]: Found error trace [2019-04-05 11:56:40,757 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-04-05 11:56:40,758 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr15ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-05 11:56:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-05 11:56:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1443398034, now seen corresponding path program 1 times [2019-04-05 11:56:40,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-05 11:56:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-05 11:56:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-05 11:56:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:40,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-04-05 11:56:40,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-04-05 11:56:40,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-05 11:56:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-05 11:56:40,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-04-05 11:56:40,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-05 11:56:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-05 11:56:41,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-04-05 11:56:41,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-04-05 11:56:41,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-04-05 11:56:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-04-05 11:56:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-04-05 11:56:41,117 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 6 states. [2019-04-05 11:56:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-05 11:56:41,171 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-04-05 11:56:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-04-05 11:56:41,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-04-05 11:56:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-05 11:56:41,172 INFO L225 Difference]: With dead ends: 41 [2019-04-05 11:56:41,172 INFO L226 Difference]: Without dead ends: 0 [2019-04-05 11:56:41,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-04-05 11:56:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-05 11:56:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-05 11:56:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-05 11:56:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-05 11:56:41,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2019-04-05 11:56:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-05 11:56:41,176 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-05 11:56:41,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-04-05 11:56:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-05 11:56:41,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-05 11:56:41,177 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr15ASSERT_VIOLATIONVACUOUSforID005 was SAFE (19/19) [2019-04-05 11:56:41,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 11:56:41 BoogieIcfgContainer [2019-04-05 11:56:41,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-05 11:56:41,179 INFO L168 Benchmark]: Toolchain (without parser) took 11357.38 ms. Allocated memory was 135.3 MB in the beginning and 254.3 MB in the end (delta: 119.0 MB). Free memory was 107.4 MB in the beginning and 111.2 MB in the end (delta: -3.8 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,180 INFO L168 Benchmark]: ReqParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,181 INFO L168 Benchmark]: PEA to Boogie took 590.24 ms. Allocated memory is still 135.3 MB. Free memory was 107.4 MB in the beginning and 86.7 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,181 INFO L168 Benchmark]: Boogie Printer took 11.34 ms. Allocated memory is still 135.3 MB. Free memory was 86.7 MB in the beginning and 85.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,182 INFO L168 Benchmark]: Boogie Preprocessor took 79.59 ms. Allocated memory is still 135.3 MB. Free memory was 85.8 MB in the beginning and 83.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,183 INFO L168 Benchmark]: RCFGBuilder took 3109.90 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 83.2 MB in the beginning and 163.2 MB in the end (delta: -79.9 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,184 INFO L168 Benchmark]: TraceAbstraction took 7562.25 ms. Allocated memory was 198.2 MB in the beginning and 254.3 MB in the end (delta: 56.1 MB). Free memory was 161.7 MB in the beginning and 111.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. [2019-04-05 11:56:41,189 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.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * PEA to Boogie took 590.24 ms. Allocated memory is still 135.3 MB. Free memory was 107.4 MB in the beginning and 86.7 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Printer took 11.34 ms. Allocated memory is still 135.3 MB. Free memory was 86.7 MB in the beginning and 85.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.59 ms. Allocated memory is still 135.3 MB. Free memory was 85.8 MB in the beginning and 83.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3109.90 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 83.2 MB in the beginning and 163.2 MB in the end (delta: -79.9 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7562.25 ms. Allocated memory was 198.2 MB in the beginning and 254.3 MB in the end (delta: 56.1 MB). Free memory was 161.7 MB in the beginning and 111.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckFailResult [Line: -1]: Requirement ID001 is vacuous Requirement ID001 is vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr13ASSERT_VIOLATIONVACUOUSforID001 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 1.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 73 SDslu, 31 SDs, 0 SdLazy, 14 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 7 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/30 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: myProcedureErr18ASSERT_VIOLATIONCONSISTENCYforallrequirements CFG has 1 procedures, 41 locations, 19 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=41occurred 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, 21 NumberOfCodeBlocks, 21 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 - ReqCheckFailResult [Line: -1]: Requirements ID002, ID003 are rt-inconsistent Requirements ID002, ID003 are rt-inconsistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID002_ID003 CFG has 1 procedures, 41 locations, 19 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 31 SDslu, 58 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 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 ID005, ID007 are rt-consistent Requirements ID005, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID005_ID007 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=41occurred 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, 12 NumberOfCodeBlocks, 12 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, ID004 are rt-consistent Requirements ID005, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID005_ID004 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 44 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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]: Requirement ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr12ASSERT_VIOLATIONVACUOUSforID002 CFG has 1 procedures, 41 locations, 19 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=41occurred 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, 15 NumberOfCodeBlocks, 15 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, ID003 are rt-consistent Requirements ID001, ID003 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID001_ID003 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=41occurred 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 - ReqCheckFailResult [Line: -1]: Requirement ID007 is vacuous Requirement ID007 is vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr16ASSERT_VIOLATIONVACUOUSforID007 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.7s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 34 SDslu, 30 SDs, 0 SdLazy, 11 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 2 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID003, ID005 are rt-consistent Requirements ID003, ID005 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID003_ID005 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=41occurred 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 ID001, ID004 are rt-consistent Requirements ID001, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID001_ID004 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 1.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 79 SDslu, 55 SDs, 0 SdLazy, 21 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 8 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/14 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: myProcedureErr14ASSERT_VIOLATIONVACUOUSforID003 CFG has 1 procedures, 41 locations, 19 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 16 SDslu, 29 SDs, 0 SdLazy, 8 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 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 ID002, ID007 are rt-consistent Requirements ID002, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID002_ID007 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=41occurred 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, 4 NumberOfCodeBlocks, 4 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, ID007 are rt-consistent Requirements ID003, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID003_ID007 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=41occurred 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 - ReqCheckFailResult [Line: -1]: Requirement ID004 is vacuous Requirement ID004 is vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr17ASSERT_VIOLATIONVACUOUSforID004 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 1.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 132 SDslu, 45 SDs, 0 SdLazy, 17 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 9 NumberOfNonLiveVariables, 107 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/38 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: myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID003_ID004 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 46 SDslu, 1 SDs, 0 SdLazy, 5 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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.2s 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]: Requirements ID001, ID007 are rt-consistent Requirements ID001, ID007 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID001_ID007 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 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=41occurred 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]: Requirements ID007, ID004 are rt-consistent Requirements ID007, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID007_ID004 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 43 SDslu, 1 SDs, 0 SdLazy, 5 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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.2s 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 ID002, ID004 are rt-consistent Requirements ID002, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID002_ID004 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 52 SDslu, 1 SDs, 0 SdLazy, 5 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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.1s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 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 - ReqCheckFailResult [Line: -1]: Requirement ID005 is vacuous Requirement ID005 is vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr15ASSERT_VIOLATIONVACUOUSforID005 CFG has 1 procedures, 41 locations, 19 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 72 SDslu, 67 SDs, 0 SdLazy, 17 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 3 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...