java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:34:14,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:34:14,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:34:14,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:34:14,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:34:14,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:34:14,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:34:14,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:34:14,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:34:14,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:34:14,147 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:34:14,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:34:14,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:34:14,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:34:14,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:34:14,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:34:14,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:34:14,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:34:14,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:34:14,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:34:14,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:34:14,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:34:14,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:34:14,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:34:14,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:34:14,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:34:14,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:34:14,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:34:14,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:34:14,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:34:14,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:34:14,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:34:14,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:34:14,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:34:14,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:34:14,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:34:14,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:34:14,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:34:14,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:34:14,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:34:14,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:34:14,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:34:14,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:34:14,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:34:14,233 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:34:14,234 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:34:14,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2019-08-04 21:34:14,235 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2019-08-04 21:34:14,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:34:14,280 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:34:14,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:34:14,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:34:14,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:34:14,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:34:14,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:34:14,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:34:14,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:34:14,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... [2019-08-04 21:34:14,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:34:14,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:34:14,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:34:14,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:34:14,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:34:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:34:14,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:34:14,623 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:34:14,624 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:34:14,625 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:34:14 BoogieIcfgContainer [2019-08-04 21:34:14,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:34:14,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:34:14,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:34:14,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:34:14,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:34:14" (1/2) ... [2019-08-04 21:34:14,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cfbf1f and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:34:14, skipping insertion in model container [2019-08-04 21:34:14,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:34:14" (2/2) ... [2019-08-04 21:34:14,633 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2019-08-04 21:34:14,642 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:34:14,650 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:34:14,663 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:34:14,686 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:34:14,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:34:14,687 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:34:14,688 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:34:14,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:34:14,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:34:14,688 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:34:14,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:34:14,689 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:34:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:34:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:34:14,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:14,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:34:14,714 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:34:14,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:14,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:34:14,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:14,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:34:14,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:34:14,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:34:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:34:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:34:14,897 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:34:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:14,954 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:34:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:34:14,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:34:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:14,992 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:34:14,992 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:34:14,995 INFO L628 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-08-04 21:34:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:34:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:34:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:34:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:34:15,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:34:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,070 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:34:15,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:34:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:34:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:34:15,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:15,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:34:15,075 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:15,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:34:15,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:15,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:34:15,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:15,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:15,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:34:15,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:34:15,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:34:15,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:34:15,151 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:34:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:15,192 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:34:15,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:34:15,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:34:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:15,193 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:34:15,193 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:34:15,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:34:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:34:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:34:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:34:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:34:15,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:34:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,197 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:34:15,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:34:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:34:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:34:15,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:15,198 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:34:15,198 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:34:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:15,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:34:15,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:15,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:34:15,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:34:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:34:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:34:15,335 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:34:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:15,399 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:34:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:34:15,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:34:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:15,401 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:34:15,401 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:34:15,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:34:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:34:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:34:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:34:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:34:15,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:34:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,405 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:34:15,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:34:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:34:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:34:15,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:15,406 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:34:15,406 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:34:15,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:15,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:34:15,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:15,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:15,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:34:15,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:34:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:34:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:34:15,533 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:34:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:15,623 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:34:15,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:34:15,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:34:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:15,625 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:34:15,625 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:34:15,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:34:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:34:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:34:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:34:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:34:15,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:34:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,629 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:34:15,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:34:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:34:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:34:15,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:15,629 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:34:15,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:34:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:15,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:34:15,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:15,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:15,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:34:15,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:34:15,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:34:15,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:34:15,769 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:34:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:15,961 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:34:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:34:15,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:34:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:15,963 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:34:15,963 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:34:15,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:34:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:34:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:34:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:34:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:34:15,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:34:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:15,966 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:34:15,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:34:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:34:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:34:15,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:15,967 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:34:15,967 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:15,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:15,967 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:34:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:15,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:34:15,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:34:16,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:34:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:34:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:34:16,122 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:34:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:16,285 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:34:16,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:34:16,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:34:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:16,287 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:34:16,287 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:34:16,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:34:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:34:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:34:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:34:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:34:16,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:34:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:16,291 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:34:16,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:34:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:34:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:34:16,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:16,292 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:34:16,292 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:34:16,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:16,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:34:16,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:34:16,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:34:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:34:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:34:16,474 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:34:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:16,556 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:34:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:34:16,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:34:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:16,558 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:34:16,558 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:34:16,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:34:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:34:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:34:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:34:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:34:16,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:34:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:16,562 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:34:16,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:34:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:34:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:34:16,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:16,563 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:34:16,563 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:34:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:16,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:34:16,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:17,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:17,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:34:17,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:34:17,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:34:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:34:17,021 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:34:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:17,106 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:34:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:34:17,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:34:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:17,108 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:34:17,108 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:34:17,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:34:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:34:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:34:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:34:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:34:17,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:34:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:17,112 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:34:17,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:34:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:34:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:34:17,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:17,113 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:34:17,113 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:34:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:17,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:34:17,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:17,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:17,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:34:17,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:34:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:34:17,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:34:17,386 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:34:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:17,511 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:34:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:34:17,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:34:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:17,513 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:34:17,513 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:34:17,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:34:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:34:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:34:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:34:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:34:17,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:34:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:17,516 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:34:17,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:34:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:34:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:34:17,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:17,517 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:34:17,518 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:34:17,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:17,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:34:17,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:17,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:17,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:34:17,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:34:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:34:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:34:17,710 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:34:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:17,904 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:34:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:34:17,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:34:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:17,906 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:34:17,906 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:34:17,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:34:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:34:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:34:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:34:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:34:17,910 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:34:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:17,910 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:34:17,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:34:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:34:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:34:17,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:17,911 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:34:17,911 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:34:17,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:17,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:34:17,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:18,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:18,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:34:18,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:34:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:34:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:34:18,123 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:34:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:18,293 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:34:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:34:18,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:34:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:18,295 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:34:18,295 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:34:18,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:34:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:34:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:34:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:34:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:34:18,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:34:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:18,299 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:34:18,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:34:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:34:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:34:18,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:18,299 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:34:18,300 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:18,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:34:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:18,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:34:18,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:18,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:18,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:34:18,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:34:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:34:18,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:34:18,533 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:34:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:18,680 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:34:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:34:18,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:34:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:18,681 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:34:18,682 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:34:18,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:34:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:34:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:34:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:34:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:34:18,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:34:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:18,686 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:34:18,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:34:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:34:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:34:18,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:18,686 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:34:18,687 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:34:18,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:18,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:34:18,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:18,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:18,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:34:18,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:34:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:34:18,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:34:18,901 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:34:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:19,088 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:34:19,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:34:19,096 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:34:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:19,097 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:34:19,097 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:34:19,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:34:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:34:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:34:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:34:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:34:19,104 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:34:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:19,105 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:34:19,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:34:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:34:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:34:19,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:19,106 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:34:19,107 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:34:19,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:19,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:34:19,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:19,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:19,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:34:19,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:34:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:34:19,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:34:19,474 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:34:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:19,724 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:34:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:34:19,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:34:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:19,726 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:34:19,726 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:34:19,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:34:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:34:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:34:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:34:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:34:19,730 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:34:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:19,730 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:34:19,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:34:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:34:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:34:19,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:19,731 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:34:19,732 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:34:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:19,750 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:34:19,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:20,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:20,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:34:20,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:34:20,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:34:20,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:34:20,029 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:34:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:20,241 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:34:20,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:34:20,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:34:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:20,243 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:34:20,243 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:34:20,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:34:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:34:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:34:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:34:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:34:20,249 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:34:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:20,249 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:34:20,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:34:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:34:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:34:20,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:20,250 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:34:20,250 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:34:20,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:34:20,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:34:20,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:34:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:34:20,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:34:20,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:34:20,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:34:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:34:20,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:34:20,888 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:34:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:34:21,211 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:34:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:34:21,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:34:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:34:21,213 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:34:21,213 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:34:21,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:34:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:34:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:34:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:34:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:34:21,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:34:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:34:21,218 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:34:21,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:34:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:34:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:34:21,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:34:21,220 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:34:21,220 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:34:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:34:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:34:21,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:34:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:34:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:34:21,283 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:34:21,308 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:34:21 BoogieIcfgContainer [2019-08-04 21:34:21,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:34:21,311 INFO L168 Benchmark]: Toolchain (without parser) took 7029.41 ms. Allocated memory was 140.0 MB in the beginning and 243.3 MB in the end (delta: 103.3 MB). Free memory was 109.4 MB in the beginning and 77.3 MB in the end (delta: 32.1 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:34:21,312 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.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-08-04 21:34:21,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:34:21,318 INFO L168 Benchmark]: Boogie Preprocessor took 33.81 ms. Allocated memory is still 140.0 MB. Free memory was 107.7 MB in the beginning and 106.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:34:21,318 INFO L168 Benchmark]: RCFGBuilder took 271.78 ms. Allocated memory is still 140.0 MB. Free memory was 106.4 MB in the beginning and 96.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:34:21,322 INFO L168 Benchmark]: TraceAbstraction took 6682.10 ms. Allocated memory was 140.0 MB in the beginning and 243.3 MB in the end (delta: 103.3 MB). Free memory was 96.3 MB in the beginning and 77.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:34:21,330 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.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. * Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.81 ms. Allocated memory is still 140.0 MB. Free memory was 107.7 MB in the beginning and 106.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 271.78 ms. Allocated memory is still 140.0 MB. Free memory was 106.4 MB in the beginning and 96.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6682.10 ms. Allocated memory was 140.0 MB in the beginning and 243.3 MB in the end (delta: 103.3 MB). Free memory was 96.3 MB in the beginning and 77.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~x~5=2, main_~y~5=1, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16, main_~x~5=2, main_~y~5=1] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=2, main_~y~5=1, main_~zz~5=0, main_~z~5=1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=2, main_~y~5=1, main_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 6.6s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 136 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 16 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...