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/hybrid1_extended.new.req -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a613b84 [2019-04-04 14:49:31,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-04 14:49:31,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-04 14:49:31,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-04 14:49:31,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-04 14:49:31,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-04 14:49:31,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-04 14:49:31,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-04 14:49:31,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-04 14:49:31,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-04 14:49:31,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-04 14:49:31,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-04 14:49:31,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-04 14:49:31,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-04 14:49:31,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-04 14:49:31,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-04 14:49:31,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-04 14:49:31,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-04 14:49:31,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-04 14:49:31,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-04 14:49:31,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-04 14:49:31,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-04 14:49:31,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-04 14:49:31,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-04 14:49:31,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-04 14:49:31,238 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-04 14:49:31,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-04 14:49:31,239 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-04 14:49:31,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-04 14:49:31,240 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-04 14:49:31,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-04 14:49:31,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-04 14:49:31,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-04 14:49:31,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-04 14:49:31,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-04 14:49:31,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-04 14:49:31,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-04 14:49:31,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-04 14:49:31,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-04-04 14:49:31,246 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/trunk/examples/settings/reqanalyzer/reqanalyzer-nonlin.epf [2019-04-04 14:49:31,261 INFO L110 SettingsManager]: Loading preferences was successful [2019-04-04 14:49:31,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-04-04 14:49:31,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-04-04 14:49:31,262 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2019-04-04 14:49:31,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 14:49:31,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:12000 [2019-04-04 14:49:31,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-04-04 14:49:31,264 INFO L133 SettingsManager]: * Trace refinement exception blacklist=UNKNOWN [2019-04-04 14:49:31,264 INFO L133 SettingsManager]: * Stop after first violation was found=false [2019-04-04 14:49:31,264 INFO L133 SettingsManager]: * Compute statistics for interpolant sequences=false [2019-04-04 14:49:31,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2019-04-04 14:49:31,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-04-04 14:49:31,265 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-04 14:49:31,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-04 14:49:31,317 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-04 14:49:31,323 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-04 14:49:31,325 INFO L271 PluginConnector]: Initializing ReqParser... [2019-04-04 14:49:31,326 INFO L276 PluginConnector]: ReqParser initialized [2019-04-04 14:49:31,327 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/re2019-exp/hybrid1_extended.new.req [2019-04-04 14:49:31,327 INFO L94 ReqParser]: Parsing file /storage/repos/re2019-exp/hybrid1_extended.new.req [2019-04-04 14:49:31,401 INFO L134 ReqParser]: 23 requirements (12 non-initialization) in total [2019-04-04 14:49:31,407 INFO L134 ReqParser]: 23 requirements (12 non-initialization) after unification [2019-04-04 14:49:31,414 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-04 14:49:31,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-04 14:49:31,417 INFO L113 PluginConnector]: ------------------------PEA to Boogie---------------------------- [2019-04-04 14:49:31,417 INFO L271 PluginConnector]: Initializing PEA to Boogie... [2019-04-04 14:49:31,418 INFO L276 PluginConnector]: PEA to Boogie initialized [2019-04-04 14:49:31,419 INFO L185 PluginConnector]: Executing the observer PEAtoBoogieObserver from plugin PEA to Boogie for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 02:49:31" (1/1) ... [2019-04-04 14:49:31,432 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-04 14:49:31,445 INFO L59 ReqToPEA]: Transforming 12 requirements to PEAs [2019-04-04 14:49:31,481 INFO L87 ReqToPEA]: Following types of requirements were processed [2019-04-04 14:49:31,481 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MinDurationPattern : 2 [2019-04-04 14:49:31,482 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndResponsePatternUT : 4 [2019-04-04 14:49:31,482 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.BndInvariancePattern : 3 [2019-04-04 14:49:31,482 INFO L89 ReqToPEA]: class de.uni_freiburg.informatik.ultimate.lib.srparse.pattern.MaxDurationPattern : 3 [2019-04-04 14:49:31,482 INFO L92 ReqToPEA]: Finished transforming 12 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-04 14:49:31,722 INFO L154 cyConditionGenerator]: Finished generating primed state invariant of size 1 [2019-04-04 14:49:31,754 INFO L769 Req2BoogieTranslator]: 0 of 12 requirements are invariant [2019-04-04 14:49:31,756 INFO L786 Req2BoogieTranslator]: Computing rt-inconsistency assertions for 66 subsets [2019-04-04 14:49:32,399 INFO L284 cyConditionGenerator]: 66 checks, 48 trivial consistent, 18 non-trivial [2019-04-04 14:49:32,400 INFO L290 cyConditionGenerator]: Of 693 formulas, 0 were quantified, 693 were plain. Needed 269 quantifier elimination runs, 0 quantified solver queries. [2019-04-04 14:49:32,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32 Unit [2019-04-04 14:49:32,417 INFO L132 PluginConnector]: ------------------------ END PEA to Boogie---------------------------- [2019-04-04 14:49:32,417 INFO L113 PluginConnector]: ------------------------Boogie Printer---------------------------- [2019-04-04 14:49:32,418 INFO L271 PluginConnector]: Initializing Boogie Printer... [2019-04-04 14:49:32,423 INFO L276 PluginConnector]: Boogie Printer initialized [2019-04-04 14:49:32,424 INFO L185 PluginConnector]: Executing the observer BoogiePrinterObserver from plugin Boogie Printer for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,424 INFO L116 oogiePrinterObserver]: File already exists and will be overwritten: /tmp/boogiePrinter.bpl [2019-04-04 14:49:32,425 INFO L120 oogiePrinterObserver]: Writing to file /tmp/boogiePrinter.bpl [2019-04-04 14:49:32,447 INFO L132 PluginConnector]: ------------------------ END Boogie Printer---------------------------- [2019-04-04 14:49:32,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-04 14:49:32,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-04 14:49:32,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-04 14:49:32,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (1/1) ... [2019-04-04 14:49:32,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-04 14:49:32,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-04 14:49:32,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-04 14:49:32,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-04 14:49:32,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (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-04 14:49:32,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-04-04 14:49:32,578 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-04-04 14:49:32,578 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-04 14:49:36,855 INFO L278 CfgBuilder]: Using library mode [2019-04-04 14:49:36,855 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-04-04 14:49:36,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 02:49:36 BoogieIcfgContainer [2019-04-04 14:49:36,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-04 14:49:36,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-04 14:49:36,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-04 14:49:36,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-04 14:49:36,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.reqparser OTHER 04.04 02:49:31" (1/3) ... [2019-04-04 14:49:36,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5ea360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 04.04 02:49:36, skipping insertion in model container [2019-04-04 14:49:36,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.pea2boogie AST 04.04 02:49:32" (2/3) ... [2019-04-04 14:49:36,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5ea360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 02:49:36, skipping insertion in model container [2019-04-04 14:49:36,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 02:49:36" (3/3) ... [2019-04-04 14:49:36,864 INFO L112 eAbstractionObserver]: Analyzing ICFG [2019-04-04 14:49:36,874 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-04 14:49:36,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-04-04 14:49:36,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:36,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:36,926 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:36,926 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:36,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:36,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:36,928 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:36,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:36,929 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011======== [2019-04-04 14:49:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-04 14:49:36,962 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:36,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-04 14:49:36,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011]=== [2019-04-04 14:49:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2081616, now seen corresponding path program 1 times [2019-04-04 14:49:36,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:36,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,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-04 14:49:37,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:37,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:37,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:37,165 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,179 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:37,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:37,180 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-04-04 14:49:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,188 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:37,189 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,190 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-04 14:49:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-04-04 14:49:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,214 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,219 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011 was SAFE (1/31) [2019-04-04 14:49:37,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,221 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,221 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,221 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,222 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,222 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,222 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,222 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001======== [2019-04-04 14:49:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-04-04 14:49:37,225 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-04-04 14:49:37,226 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001]=== [2019-04-04 14:49:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 64530343, now seen corresponding path program 1 times [2019-04-04 14:49:37,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,305 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-04 14:49:37,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:37,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:37,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:37,309 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,315 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:37,316 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-04-04 14:49:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,317 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:37,317 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,318 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-04 14:49:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-04-04 14:49:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,319 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,320 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001 was SAFE (2/31) [2019-04-04 14:49:37,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,321 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,321 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,322 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,323 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements======== [2019-04-04 14:49:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-04-04 14:49:37,330 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,331 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements]=== [2019-04-04 14:49:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1169675517, now seen corresponding path program 1 times [2019-04-04 14:49:37,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:37,370 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:37,376 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements was UNSAFE (3/31) [2019-04-04 14:49:37,377 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,377 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,377 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,378 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001======== [2019-04-04 14:49:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-04-04 14:49:37,381 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001]=== [2019-04-04 14:49:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1067933683, now seen corresponding path program 1 times [2019-04-04 14:49:37,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,422 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-04 14:49:37,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:37,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:37,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:37,424 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,428 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:37,428 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-04-04 14:49:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,429 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:37,429 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,429 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-04 14:49:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-04-04 14:49:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,431 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,432 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001 was SAFE (4/31) [2019-04-04 14:49:37,433 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,433 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,433 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,433 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,434 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,434 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr23ASSERT_VIOLATIONVACUOUSforID004======== [2019-04-04 14:49:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-04-04 14:49:37,437 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,438 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr23ASSERT_VIOLATIONVACUOUSforID004]=== [2019-04-04 14:49:37,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1811573510, now seen corresponding path program 1 times [2019-04-04 14:49:37,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:37,465 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:37,466 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr23ASSERT_VIOLATIONVACUOUSforID004 was UNSAFE (5/31) [2019-04-04 14:49:37,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,468 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,470 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,471 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,471 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001======== [2019-04-04 14:49:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-04-04 14:49:37,476 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,477 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001]=== [2019-04-04 14:49:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash -946088970, now seen corresponding path program 1 times [2019-04-04 14:49:37,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,538 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-04 14:49:37,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:37,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:37,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:37,540 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,549 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:37,549 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-04-04 14:49:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,550 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:37,550 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,550 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-04 14:49:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-04-04 14:49:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,555 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,556 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001 was SAFE (6/31) [2019-04-04 14:49:37,556 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,559 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,559 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,559 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,560 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,560 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005======== [2019-04-04 14:49:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-04-04 14:49:37,565 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,566 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005]=== [2019-04-04 14:49:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash -935381860, now seen corresponding path program 1 times [2019-04-04 14:49:37,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,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-04 14:49:37,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:37,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:37,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:37,612 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,619 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:37,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-04-04 14:49:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,620 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:37,620 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,621 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-04 14:49:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-04-04 14:49:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,622 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,623 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005 was SAFE (7/31) [2019-04-04 14:49:37,624 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,625 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,627 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,627 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr27ASSERT_VIOLATIONVACUOUSforID002======== [2019-04-04 14:49:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-04-04 14:49:37,636 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr27ASSERT_VIOLATIONVACUOUSforID002]=== [2019-04-04 14:49:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1012256566, now seen corresponding path program 1 times [2019-04-04 14:49:37,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:37,678 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:37,678 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr27ASSERT_VIOLATIONVACUOUSforID002 was UNSAFE (8/31) [2019-04-04 14:49:37,682 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,682 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,682 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,682 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,683 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,683 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,683 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,683 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr20ASSERT_VIOLATIONVACUOUSforID006======== [2019-04-04 14:49:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-04-04 14:49:37,686 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,686 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr20ASSERT_VIOLATIONVACUOUSforID006]=== [2019-04-04 14:49:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 779011097, now seen corresponding path program 1 times [2019-04-04 14:49:37,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:37,710 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:37,711 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr20ASSERT_VIOLATIONVACUOUSforID006 was UNSAFE (9/31) [2019-04-04 14:49:37,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,712 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,712 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,713 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008======== [2019-04-04 14:49:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-04 14:49:37,714 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-04 14:49:37,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008]=== [2019-04-04 14:49:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash 67141, now seen corresponding path program 1 times [2019-04-04 14:49:37,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,738 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-04 14:49:37,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:37,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:37,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:37,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:37,740 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,743 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:37,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:37,743 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-04-04 14:49:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,744 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:37,744 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,744 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-04 14:49:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-04-04 14:49:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,745 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,746 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008 was SAFE (10/31) [2019-04-04 14:49:37,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,748 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,748 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,748 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,748 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,748 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,748 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,748 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,749 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010======== [2019-04-04 14:49:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-04-04 14:49:37,751 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,751 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-04 14:49:37,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010]=== [2019-04-04 14:49:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1253793922, now seen corresponding path program 1 times [2019-04-04 14:49:37,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:37,860 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-04 14:49:37,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:37,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 14:49:37,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 14:49:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 14:49:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:37,861 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 14:49:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:37,929 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-04-04 14:49:37,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 14:49:37,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-04-04 14:49:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:37,930 INFO L225 Difference]: With dead ends: 48 [2019-04-04 14:49:37,930 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:37,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:37,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-04-04 14:49:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:37,932 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:37,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 14:49:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:37,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:37,933 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 was SAFE (11/31) [2019-04-04 14:49:37,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:37,934 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:37,934 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:37,934 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:37,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:37,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:37,934 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:37,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:37,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr21ASSERT_VIOLATIONVACUOUSforID008======== [2019-04-04 14:49:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-04-04 14:49:37,937 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:37,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:37,937 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr21ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-04 14:49:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1620459484, now seen corresponding path program 1 times [2019-04-04 14:49:37,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:37,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:37,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:37,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,058 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-04 14:49:38,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:38,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 14:49:38,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 14:49:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:38,060 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 14:49:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,130 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-04 14:49:38,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 14:49:38,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-04-04 14:49:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,136 INFO L225 Difference]: With dead ends: 96 [2019-04-04 14:49:38,136 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 14:49:38,137 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-04 14:49:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 14:49:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-04-04 14:49:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-04-04 14:49:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-04-04 14:49:38,150 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 24 [2019-04-04 14:49:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,150 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-04-04 14:49:38,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 14:49:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-04-04 14:49:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-04-04 14:49:38,152 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,153 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr21ASSERT_VIOLATIONVACUOUSforID008]=== [2019-04-04 14:49:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -592564332, now seen corresponding path program 1 times [2019-04-04 14:49:38,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:38,236 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:38,238 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr21ASSERT_VIOLATIONVACUOUSforID008 was UNSAFE (12/31) [2019-04-04 14:49:38,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,241 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,241 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,241 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010======== [2019-04-04 14:49:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-04-04 14:49:38,243 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,244 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-04 14:49:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1360851665, now seen corresponding path program 1 times [2019-04-04 14:49:38,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,474 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-04 14:49:38,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 14:49:38,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-04-04 14:49:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-04-04 14:49:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-04-04 14:49:38,476 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2019-04-04 14:49:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,551 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-04-04 14:49:38,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 14:49:38,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-04-04 14:49:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,553 INFO L225 Difference]: With dead ends: 95 [2019-04-04 14:49:38,553 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 14:49:38,553 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-04 14:49:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 14:49:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-04-04 14:49:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-04-04 14:49:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-04-04 14:49:38,558 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 13 [2019-04-04 14:49:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,558 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-04-04 14:49:38,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-04-04 14:49:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-04-04 14:49:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-04-04 14:49:38,560 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,560 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010]=== [2019-04-04 14:49:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash -234232897, now seen corresponding path program 1 times [2019-04-04 14:49:38,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-04-04 14:49:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-04 14:49:38,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 14:49:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 14:49:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:38,720 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 3 states. [2019-04-04 14:49:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,775 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-04-04 14:49:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 14:49:38,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-04-04 14:49:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,776 INFO L225 Difference]: With dead ends: 45 [2019-04-04 14:49:38,777 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:38,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:38,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-04-04 14:49:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,779 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:38,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 14:49:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:38,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:38,779 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 was SAFE (13/31) [2019-04-04 14:49:38,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,781 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,781 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,781 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,781 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000======== [2019-04-04 14:49:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-04-04 14:49:38,782 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000]=== [2019-04-04 14:49:38,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1831634325, now seen corresponding path program 1 times [2019-04-04 14:49:38,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,798 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-04 14:49:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:38,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:38,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:38,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:38,800 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,801 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:38,801 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-04-04 14:49:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,802 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:38,802 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:38,802 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-04 14:49:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:38,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-04-04 14:49:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:38,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:38,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:38,804 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000 was SAFE (14/31) [2019-04-04 14:49:38,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,805 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,805 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,805 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,805 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000======== [2019-04-04 14:49:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-04-04 14:49:38,807 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000]=== [2019-04-04 14:49:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash 763271610, now seen corresponding path program 1 times [2019-04-04 14:49:38,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,822 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-04 14:49:38,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:38,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:38,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:38,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:38,823 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,824 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:38,825 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-04-04 14:49:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,825 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:38,825 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:38,825 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-04 14:49:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:38,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-04-04 14:49:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:38,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:38,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:38,827 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000 was SAFE (15/31) [2019-04-04 14:49:38,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,828 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,828 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,829 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr24ASSERT_VIOLATIONVACUOUSforID009======== [2019-04-04 14:49:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-04-04 14:49:38,830 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr24ASSERT_VIOLATIONVACUOUSforID009]=== [2019-04-04 14:49:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash 324204253, now seen corresponding path program 1 times [2019-04-04 14:49:38,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:38,840 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:38,841 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr24ASSERT_VIOLATIONVACUOUSforID009 was UNSAFE (16/31) [2019-04-04 14:49:38,842 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,842 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,842 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,842 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,843 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID003_ID011======== [2019-04-04 14:49:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-04-04 14:49:38,844 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,844 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID003_ID011]=== [2019-04-04 14:49:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2000440882, now seen corresponding path program 1 times [2019-04-04 14:49:38,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,859 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-04 14:49:38,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:38,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:38,860 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,861 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:38,861 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-04-04 14:49:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,862 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:38,862 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:38,862 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-04 14:49:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:38,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-04-04 14:49:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,863 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:38,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:38,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:38,864 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID003_ID011 was SAFE (17/31) [2019-04-04 14:49:38,864 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,865 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,865 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,865 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr26ASSERT_VIOLATIONVACUOUSforID000======== [2019-04-04 14:49:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-04-04 14:49:38,867 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,867 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr26ASSERT_VIOLATIONVACUOUSforID000]=== [2019-04-04 14:49:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1972316097, now seen corresponding path program 1 times [2019-04-04 14:49:38,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:38,877 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:38,878 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr26ASSERT_VIOLATIONVACUOUSforID000 was UNSAFE (18/31) [2019-04-04 14:49:38,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,879 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,879 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,879 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,879 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,879 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,879 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,880 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007======== [2019-04-04 14:49:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-04-04 14:49:38,881 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,881 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-04 14:49:38,881 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007]=== [2019-04-04 14:49:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1556116151, now seen corresponding path program 1 times [2019-04-04 14:49:38,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:38,890 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:38,891 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007 was UNSAFE (19/31) [2019-04-04 14:49:38,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,892 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,892 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,892 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,892 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,892 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,892 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr25ASSERT_VIOLATIONVACUOUSforID010======== [2019-04-04 14:49:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-04-04 14:49:38,894 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,894 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr25ASSERT_VIOLATIONVACUOUSforID010]=== [2019-04-04 14:49:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1460397544, now seen corresponding path program 1 times [2019-04-04 14:49:38,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:38,904 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:38,907 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr25ASSERT_VIOLATIONVACUOUSforID010 was UNSAFE (20/31) [2019-04-04 14:49:38,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,908 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,908 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,908 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,908 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID000_ID001======== [2019-04-04 14:49:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-04-04 14:49:38,913 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,913 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-04 14:49:38,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID000_ID001]=== [2019-04-04 14:49:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1989859936, now seen corresponding path program 1 times [2019-04-04 14:49:38,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:38,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-04 14:49:38,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:38,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:38,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:38,931 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:38,932 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:38,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-04-04 14:49:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:38,933 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:38,933 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:38,933 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-04 14:49:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:38,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-04-04 14:49:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:38,934 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:38,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:38,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:38,935 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID000_ID001 was SAFE (21/31) [2019-04-04 14:49:38,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:38,937 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:38,938 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:38,938 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:38,938 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:38,938 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:38,938 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:38,938 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:38,938 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr22ASSERT_VIOLATIONVACUOUSforID011======== [2019-04-04 14:49:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-04-04 14:49:38,940 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:38,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:38,940 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr22ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-04 14:49:38,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1305363835, now seen corresponding path program 1 times [2019-04-04 14:49:38,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:38,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,054 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-04 14:49:39,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 14:49:39,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 14:49:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:39,055 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 14:49:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,164 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-04-04 14:49:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 14:49:39,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-04-04 14:49:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,166 INFO L225 Difference]: With dead ends: 95 [2019-04-04 14:49:39,166 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 14:49:39,166 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-04 14:49:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 14:49:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-04-04 14:49:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-04-04 14:49:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-04-04 14:49:39,177 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 25 [2019-04-04 14:49:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,177 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-04-04 14:49:39,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 14:49:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-04-04 14:49:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-04-04 14:49:39,178 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,179 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr22ASSERT_VIOLATIONVACUOUSforID011]=== [2019-04-04 14:49:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1189624821, now seen corresponding path program 1 times [2019-04-04 14:49:39,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:39,229 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:39,232 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr22ASSERT_VIOLATIONVACUOUSforID011 was UNSAFE (22/31) [2019-04-04 14:49:39,233 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,233 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,234 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,234 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,234 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,234 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,234 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,234 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID006_ID011======== [2019-04-04 14:49:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-04-04 14:49:39,236 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID006_ID011]=== [2019-04-04 14:49:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1884125449, now seen corresponding path program 1 times [2019-04-04 14:49:39,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,251 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-04 14:49:39,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,252 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,256 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:39,256 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-04-04 14:49:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,256 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:39,256 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:39,257 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-04 14:49:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:39,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-04-04 14:49:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,258 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:39,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:39,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:39,259 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID006_ID011 was SAFE (23/31) [2019-04-04 14:49:39,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,260 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,260 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,260 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002======== [2019-04-04 14:49:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-04-04 14:49:39,261 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,262 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-04 14:49:39,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002]=== [2019-04-04 14:49:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash -212905643, now seen corresponding path program 1 times [2019-04-04 14:49:39,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,276 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-04 14:49:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,278 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,279 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:39,279 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-04-04 14:49:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,280 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:39,280 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:39,281 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-04 14:49:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:39,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-04-04 14:49:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,282 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:39,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:39,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:39,283 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002 was SAFE (24/31) [2019-04-04 14:49:39,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,283 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,284 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,284 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,284 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,284 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,284 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,284 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,284 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002======== [2019-04-04 14:49:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-04-04 14:49:39,285 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,285 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002]=== [2019-04-04 14:49:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2108383599, now seen corresponding path program 1 times [2019-04-04 14:49:39,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,307 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-04 14:49:39,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,309 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,309 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:39,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:39,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-04-04 14:49:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,311 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:39,311 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:39,312 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-04 14:49:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:39,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-04-04 14:49:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,314 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:39,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:39,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:39,315 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 was SAFE (25/31) [2019-04-04 14:49:39,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,316 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,316 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,316 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr29ASSERT_VIOLATIONVACUOUSforID001======== [2019-04-04 14:49:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-04-04 14:49:39,318 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,318 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr29ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-04 14:49:39,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2115941460, now seen corresponding path program 1 times [2019-04-04 14:49:39,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,442 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-04 14:49:39,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-04 14:49:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-04 14:49:39,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-04 14:49:39,445 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-04-04 14:49:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,516 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-04-04 14:49:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-04 14:49:39,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-04-04 14:49:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,518 INFO L225 Difference]: With dead ends: 96 [2019-04-04 14:49:39,518 INFO L226 Difference]: Without dead ends: 66 [2019-04-04 14:49:39,518 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-04 14:49:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-04-04 14:49:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-04-04 14:49:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-04-04 14:49:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-04-04 14:49:39,528 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 32 [2019-04-04 14:49:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,528 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-04-04 14:49:39,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-04 14:49:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-04-04 14:49:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-04-04 14:49:39,529 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,529 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-04-04 14:49:39,529 INFO L423 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr29ASSERT_VIOLATIONVACUOUSforID001]=== [2019-04-04 14:49:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash -986232036, now seen corresponding path program 1 times [2019-04-04 14:49:39,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:39,566 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:39,567 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr29ASSERT_VIOLATIONVACUOUSforID001 was UNSAFE (26/31) [2019-04-04 14:49:39,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,569 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,570 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,570 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,570 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011======== [2019-04-04 14:49:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-04-04 14:49:39,571 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011]=== [2019-04-04 14:49:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1721652972, now seen corresponding path program 1 times [2019-04-04 14:49:39,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,586 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-04 14:49:39,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,587 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,588 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:39,588 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-04-04 14:49:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,588 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:39,588 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:39,589 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-04 14:49:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:39,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-04-04 14:49:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,590 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:39,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:39,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:39,591 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011 was SAFE (27/31) [2019-04-04 14:49:39,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,592 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,592 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,592 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,592 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,592 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,592 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009======== [2019-04-04 14:49:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-04-04 14:49:39,594 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009]=== [2019-04-04 14:49:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1341574872, now seen corresponding path program 1 times [2019-04-04 14:49:39,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,609 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-04 14:49:39,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,610 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,611 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:39,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:39,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-04-04 14:49:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,611 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:39,611 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:39,612 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-04 14:49:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:39,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-04-04 14:49:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,613 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:39,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:39,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:39,614 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009 was SAFE (28/31) [2019-04-04 14:49:39,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,615 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,615 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,615 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,615 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,615 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,615 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,615 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr19ASSERT_VIOLATIONVACUOUSforID003======== [2019-04-04 14:49:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-04-04 14:49:39,616 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr19ASSERT_VIOLATIONVACUOUSforID003]=== [2019-04-04 14:49:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash 994960706, now seen corresponding path program 1 times [2019-04-04 14:49:39,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:39,629 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:39,629 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr19ASSERT_VIOLATIONVACUOUSforID003 was UNSAFE (29/31) [2019-04-04 14:49:39,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,630 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,630 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,631 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,631 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr28ASSERT_VIOLATIONVACUOUSforID005======== [2019-04-04 14:49:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-04-04 14:49:39,633 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,634 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr28ASSERT_VIOLATIONVACUOUSforID005]=== [2019-04-04 14:49:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1315182175, now seen corresponding path program 1 times [2019-04-04 14:49:39,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-04 14:49:39,644 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-04 14:49:39,644 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr28ASSERT_VIOLATIONVACUOUSforID005 was UNSAFE (30/31) [2019-04-04 14:49:39,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-04 14:49:39,645 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-04 14:49:39,645 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-04 14:49:39,645 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-04 14:49:39,645 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-04 14:49:39,646 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-04 14:49:39,646 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-04 14:49:39,646 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-04 14:49:39,646 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004======== [2019-04-04 14:49:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-04-04 14:49:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-04-04 14:49:39,648 INFO L394 BasicCegarLoop]: Found error trace [2019-04-04 14:49:39,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-04-04 14:49:39,648 INFO L423 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004]=== [2019-04-04 14:49:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-04 14:49:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash 736013261, now seen corresponding path program 1 times [2019-04-04 14:49:39,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-04-04 14:49:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-04-04 14:49:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-04-04 14:49:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-04-04 14:49:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-04 14:49:39,795 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-04 14:49:39,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-04 14:49:39,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-04 14:49:39,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-04-04 14:49:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-04-04 14:49:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,796 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-04-04 14:49:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-04 14:49:39,797 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-04-04 14:49:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-04-04 14:49:39,797 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-04-04 14:49:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-04 14:49:39,797 INFO L225 Difference]: With dead ends: 49 [2019-04-04 14:49:39,797 INFO L226 Difference]: Without dead ends: 0 [2019-04-04 14:49:39,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-04-04 14:49:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-04-04 14:49:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-04-04 14:49:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-04-04 14:49:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-04-04 14:49:39,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-04-04 14:49:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-04 14:49:39,799 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-04-04 14:49:39,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-04-04 14:49:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-04-04 14:49:39,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-04 14:49:39,799 INFO L190 ceAbstractionStarter]: Result for error location myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004 was SAFE (31/31) [2019-04-04 14:49:39,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 02:49:39 BoogieIcfgContainer [2019-04-04 14:49:39,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-04 14:49:39,801 INFO L168 Benchmark]: Toolchain (without parser) took 8386.57 ms. Allocated memory was 141.0 MB in the beginning and 318.2 MB in the end (delta: 177.2 MB). Free memory was 108.5 MB in the beginning and 291.6 MB in the end (delta: -183.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-04-04 14:49:39,803 INFO L168 Benchmark]: ReqParser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-04-04 14:49:39,804 INFO L168 Benchmark]: PEA to Boogie took 1000.00 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 108.5 MB in the beginning and 130.8 MB in the end (delta: -22.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2019-04-04 14:49:39,804 INFO L168 Benchmark]: Boogie Printer took 29.63 ms. Allocated memory is still 177.2 MB. Free memory was 130.8 MB in the beginning and 130.0 MB in the end (delta: 814.6 kB). Peak memory consumption was 814.6 kB. Max. memory is 7.1 GB. [2019-04-04 14:49:39,805 INFO L168 Benchmark]: Boogie Preprocessor took 94.45 ms. Allocated memory is still 177.2 MB. Free memory was 130.0 MB in the beginning and 127.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-04-04 14:49:39,806 INFO L168 Benchmark]: RCFGBuilder took 4314.12 ms. Allocated memory was 177.2 MB in the beginning and 240.1 MB in the end (delta: 62.9 MB). Free memory was 127.1 MB in the beginning and 166.4 MB in the end (delta: -39.3 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. [2019-04-04 14:49:39,807 INFO L168 Benchmark]: TraceAbstraction took 2943.38 ms. Allocated memory was 240.1 MB in the beginning and 318.2 MB in the end (delta: 78.1 MB). Free memory was 166.4 MB in the beginning and 291.6 MB in the end (delta: -125.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-04-04 14:49:39,811 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.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * PEA to Boogie took 1000.00 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 108.5 MB in the beginning and 130.8 MB in the end (delta: -22.3 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. * Boogie Printer took 29.63 ms. Allocated memory is still 177.2 MB. Free memory was 130.8 MB in the beginning and 130.0 MB in the end (delta: 814.6 kB). Peak memory consumption was 814.6 kB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.45 ms. Allocated memory is still 177.2 MB. Free memory was 130.0 MB in the beginning and 127.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4314.12 ms. Allocated memory was 177.2 MB in the beginning and 240.1 MB in the end (delta: 62.9 MB). Free memory was 127.1 MB in the beginning and 166.4 MB in the end (delta: -39.3 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2943.38 ms. Allocated memory was 240.1 MB in the beginning and 318.2 MB in the end (delta: 78.1 MB). Free memory was 166.4 MB in the beginning and 291.6 MB in the end (delta: -125.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ReqCheckSuccessResult [Line: -1]: Requirements ID007, ID011 are rt-consistent Requirements ID007, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr1ASSERT_VIOLATIONRTINCONSISTENTforID007_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID007, ID001 are rt-consistent Requirements ID007, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr2ASSERT_VIOLATIONRTINCONSISTENTforID007_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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, 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 - ReqCheckSuccessResult [UNKNOWN] : All requirements are consistent All requirements are consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr30ASSERT_VIOLATIONCONSISTENCYforallrequirements CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 33 NumberOfCodeBlocks, 33 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 ID011, ID001 are rt-consistent Requirements ID011, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr14ASSERT_VIOLATIONRTINCONSISTENTforID011_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID004 is non-vacuous Requirement ID004 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr23ASSERT_VIOLATIONVACUOUSforID004 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 26 NumberOfCodeBlocks, 26 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 ID008, ID001 are rt-consistent Requirements ID008, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr7ASSERT_VIOLATIONRTINCONSISTENTforID008_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID005 are rt-consistent Requirements ID011, ID005 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr13ASSERT_VIOLATIONRTINCONSISTENTforID011_ID005 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID002 is non-vacuous Requirement ID002 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr27ASSERT_VIOLATIONVACUOUSforID002 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID006 is non-vacuous Requirement ID006 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr20ASSERT_VIOLATIONVACUOUSforID006 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID007, ID008 are rt-consistent Requirements ID007, ID008 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr0ASSERT_VIOLATIONRTINCONSISTENTforID007_ID008 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID009, ID010 are rt-consistent Requirements ID009, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr15ASSERT_VIOLATIONRTINCONSISTENTforID009_ID010 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 SDtfs, 29 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID008 is non-vacuous Requirement ID008 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr21ASSERT_VIOLATIONVACUOUSforID008 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 24 SDslu, 45 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 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 ID011, ID010 are rt-consistent Requirements ID011, ID010 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr10ASSERT_VIOLATIONRTINCONSISTENTforID011_ID010 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 65 SDslu, 88 SDs, 0 SdLazy, 12 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID008, ID000 are rt-consistent Requirements ID008, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr6ASSERT_VIOLATIONRTINCONSISTENTforID008_ID000 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID011, ID000 are rt-consistent Requirements ID011, ID000 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr11ASSERT_VIOLATIONRTINCONSISTENTforID011_ID000 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID009 is non-vacuous Requirement ID009 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr24ASSERT_VIOLATIONVACUOUSforID009 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 27 NumberOfCodeBlocks, 27 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 ID003, ID011 are rt-consistent Requirements ID003, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr3ASSERT_VIOLATIONRTINCONSISTENTforID003_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID000 is non-vacuous Requirement ID000 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr26ASSERT_VIOLATIONVACUOUSforID000 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID007 is non-vacuous Requirement ID007 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr18ASSERT_VIOLATIONVACUOUSforID007 CFG has 1 procedures, 65 locations, 31 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=65occurred 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 - ReqCheckSuccessResult [Line: -1]: Requirement ID010 is non-vacuous Requirement ID010 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr25ASSERT_VIOLATIONVACUOUSforID010 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 28 NumberOfCodeBlocks, 28 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 ID000, ID001 are rt-consistent Requirements ID000, ID001 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr17ASSERT_VIOLATIONRTINCONSISTENTforID000_ID001 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID011 is non-vacuous Requirement ID011 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr22ASSERT_VIOLATIONVACUOUSforID011 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 22 SDslu, 44 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=65occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 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 ID006, ID011 are rt-consistent Requirements ID006, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr4ASSERT_VIOLATIONRTINCONSISTENTforID006_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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 ID000, ID002 are rt-consistent Requirements ID000, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr16ASSERT_VIOLATIONRTINCONSISTENTforID000_ID002 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID002 are rt-consistent Requirements ID011, ID002 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr12ASSERT_VIOLATIONRTINCONSISTENTforID011_ID002 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID001 is non-vacuous Requirement ID001 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr29ASSERT_VIOLATIONVACUOUSforID001 CFG has 1 procedures, 65 locations, 31 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 16 SDslu, 45 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 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 ID008, ID011 are rt-consistent Requirements ID008, ID011 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr5ASSERT_VIOLATIONRTINCONSISTENTforID008_ID011 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirements ID011, ID009 are rt-consistent Requirements ID011, ID009 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr9ASSERT_VIOLATIONRTINCONSISTENTforID011_ID009 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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]: Requirement ID003 is non-vacuous Requirement ID003 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr19ASSERT_VIOLATIONVACUOUSforID003 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - ReqCheckSuccessResult [Line: -1]: Requirement ID005 is non-vacuous Requirement ID005 is non-vacuous - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr28ASSERT_VIOLATIONVACUOUSforID005 CFG has 1 procedures, 65 locations, 31 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=65occurred 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, 31 NumberOfCodeBlocks, 31 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 ID011, ID004 are rt-consistent Requirements ID011, ID004 are rt-consistent - StatisticsResult: Ultimate Automizer benchmark data for error location: myProcedureErr8ASSERT_VIOLATIONRTINCONSISTENTforID011_ID004 CFG has 1 procedures, 65 locations, 31 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=65occurred 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.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...