java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:46:21,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:46:21,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:46:21,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:46:21,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:46:21,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:46:21,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:46:21,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:46:21,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:46:21,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:46:21,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:46:21,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:46:21,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:46:21,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:46:21,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:46:21,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:46:21,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:46:21,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:46:21,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:46:21,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:46:21,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:46:21,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:46:21,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:46:21,865 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:46:21,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:46:21,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:46:21,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:46:21,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:46:21,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:46:21,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:46:21,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:46:21,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:46:21,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:46:21,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:46:21,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:46:21,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:46:21,880 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:46:21,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:46:21,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:46:21,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:46:21,904 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:46:21,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:46:21,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:46:21,905 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:46:21,905 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:46:21,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:46:21,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:46:21,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:46:21,978 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:46:21,978 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:46:21,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-07-23 13:46:21,979 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-07-23 13:46:22,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:46:22,061 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:46:22,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:46:22,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:46:22,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:46:22,089 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,092 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,104 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,105 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,110 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,113 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,115 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 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:46:22,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:46:22,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:46:22,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:46:22,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:46:22" (1/1) ... [2018-07-23 13:46:22,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:46:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:46:22,361 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:46:22,362 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:46:22 BoogieIcfgContainer [2018-07-23 13:46:22,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:46:22,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:46:22,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:46:22,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:46:22,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:46:22" (1/2) ... [2018-07-23 13:46:22,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502868f2 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:46:22, skipping insertion in model container [2018-07-23 13:46:22,369 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 23.07 01:46:22" (2/2) ... [2018-07-23 13:46:22,373 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-07-23 13:46:22,383 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:46:22,392 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:46:22,440 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:46:22,441 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:46:22,441 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:46:22,441 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:46:22,441 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:46:22,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:46:22,442 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:46:22,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:46:22,442 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:46:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:46:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:46:22,464 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:22,465 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:46:22,465 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 13:46:22,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,558 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:46:22,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:46:22,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,561 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))] [2018-07-23 13:46:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,562 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:46:22,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:46:22,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:46:22,577 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:46:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:22,605 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 13:46:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:46:22,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:46:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:22,617 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:46:22,617 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:46:22,621 INFO L575 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 [2018-07-23 13:46:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:46:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:46:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:46:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:46:22,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:46:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:22,661 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:46:22,661 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:46:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:46:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:46:22,662 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:22,662 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:46:22,663 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-23 13:46:22,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:22,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:46:22,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,728 INFO L185 omatonBuilderFactory]: Interpolants [48#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 49#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 46#true, 47#false] [2018-07-23 13:46:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:46:22,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:46:22,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:46:22,732 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 13:46:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:22,775 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:46:22,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:46:22,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:46:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:22,777 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:46:22,777 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:46:22,779 INFO L575 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 [2018-07-23 13:46:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:46:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:46:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:46:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:46:22,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:46:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:22,782 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:46:22,783 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:46:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:46:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:46:22,783 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:22,783 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:46:22,784 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-23 13:46:22,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:22,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:46:22,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,828 INFO L185 omatonBuilderFactory]: Interpolants [90#true, 91#false, 92#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 93#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 94#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2))] [2018-07-23 13:46:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,829 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:46:22,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:46:22,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:46:22,830 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 13:46:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:22,865 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:46:22,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:46:22,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:46:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:22,867 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:46:22,867 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:46:22,868 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:46:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:46:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:46:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:46:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:46:22,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:46:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:22,873 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:46:22,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:46:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:46:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:46:22,874 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:22,874 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:46:22,875 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-23 13:46:22,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:22,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:46:22,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,943 INFO L185 omatonBuilderFactory]: Interpolants [144#false, 145#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 146#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 147#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 148#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 143#true] [2018-07-23 13:46:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:22,944 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:46:22,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:46:22,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:46:22,945 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 13:46:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:22,992 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:46:22,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:46:22,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:46:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:22,996 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:46:22,996 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:46:22,997 INFO L575 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 [2018-07-23 13:46:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:46:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:46:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:46:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:46:23,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:46:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,009 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:46:23,010 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:46:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:46:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:46:23,010 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,011 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:46:23,011 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-23 13:46:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:46:23,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,100 INFO L185 omatonBuilderFactory]: Interpolants [208#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 209#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 210#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 211#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 205#true, 206#false, 207#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))] [2018-07-23 13:46:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,100 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:46:23,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:46:23,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:46:23,102 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 13:46:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:23,162 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:46:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:46:23,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:46:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:23,164 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:46:23,164 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:46:23,165 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:46:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:46:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:46:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:46:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:46:23,170 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:46:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,171 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:46:23,171 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:46:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:46:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:46:23,172 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,172 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:46:23,172 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-23 13:46:23,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:46:23,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,269 INFO L185 omatonBuilderFactory]: Interpolants [276#true, 277#false, 278#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 279#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 280#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 281#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 282#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 283#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5))] [2018-07-23 13:46:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,270 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:46:23,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:46:23,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:46:23,272 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 13:46:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:23,340 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:46:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:46:23,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:46:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:23,342 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:46:23,342 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:46:23,343 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:46:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:46:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:46:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:46:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 13:46:23,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 13:46:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,352 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 13:46:23,352 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:46:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 13:46:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:46:23,353 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,353 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 13:46:23,353 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-23 13:46:23,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:46:23,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,429 INFO L185 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 359#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 360#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 361#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 362#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 363#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 364#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6))] [2018-07-23 13:46:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:46:23,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:46:23,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:46:23,431 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 13:46:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:23,490 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 13:46:23,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:46:23,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:46:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:23,492 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:46:23,492 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:46:23,493 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:46:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:46:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:46:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:46:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:46:23,502 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 13:46:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,502 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:46:23,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:46:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:46:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:46:23,503 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,504 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:46:23,504 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-23 13:46:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:46:23,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,554 INFO L185 omatonBuilderFactory]: Interpolants [448#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 449#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 450#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 451#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 452#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 453#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 454#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 445#true, 446#false, 447#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0))] [2018-07-23 13:46:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,555 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:46:23,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:46:23,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:46:23,556 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 13:46:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:23,603 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 13:46:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:46:23,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:46:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:23,605 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:46:23,605 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:46:23,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:46:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:46:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:46:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:46:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 13:46:23,621 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 13:46:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,622 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 13:46:23,622 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:46:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 13:46:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:46:23,625 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,625 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 13:46:23,626 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-23 13:46:23,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:46:23,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,692 INFO L185 omatonBuilderFactory]: Interpolants [544#false, 545#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 546#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 547#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 548#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 549#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 550#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 551#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 552#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 553#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 543#true] [2018-07-23 13:46:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,693 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:46:23,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:46:23,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:46:23,695 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-23 13:46:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:23,742 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 13:46:23,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:46:23,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:46:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:23,744 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:46:23,744 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:46:23,745 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:46:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:46:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:46:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:46:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 13:46:23,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 13:46:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 13:46:23,754 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:46:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 13:46:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:46:23,757 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,757 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 13:46:23,758 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-23 13:46:23,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:46:23,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,838 INFO L185 omatonBuilderFactory]: Interpolants [656#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 657#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 658#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 659#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 660#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 661#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 650#true, 651#false, 652#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 653#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 654#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 655#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5))] [2018-07-23 13:46:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,839 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:46:23,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:46:23,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:46:23,840 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-23 13:46:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:23,886 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 13:46:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:46:23,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 13:46:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:23,888 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:46:23,888 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:46:23,888 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:46:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:46:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:46:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:46:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 13:46:23,894 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 13:46:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:23,894 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 13:46:23,895 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:46:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 13:46:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:46:23,896 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:23,896 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 13:46:23,896 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-23 13:46:23,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:23,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:46:23,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,964 INFO L185 omatonBuilderFactory]: Interpolants [768#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 769#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 770#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 771#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 772#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 773#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 774#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 775#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 776#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 777#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 778#(and (<= 10 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 10)), 766#true, 767#false] [2018-07-23 13:46:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:23,965 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:46:23,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:46:23,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:46:23,966 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-23 13:46:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,009 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 13:46:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:46:24,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 13:46:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,013 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:46:24,013 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:46:24,014 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:46:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:46:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:46:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:46:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 13:46:24,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 13:46:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,024 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 13:46:24,024 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:46:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 13:46:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:46:24,025 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,026 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 13:46:24,026 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-23 13:46:24,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:24,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:46:24,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,098 INFO L185 omatonBuilderFactory]: Interpolants [896#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 897#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 898#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 899#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 900#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 901#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 902#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 903#(and (<= 10 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 10)), 904#(and (<= 11 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 11)), 891#true, 892#false, 893#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 894#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 895#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2))] [2018-07-23 13:46:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:46:24,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:46:24,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:46:24,100 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-23 13:46:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,151 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 13:46:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:46:24,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 13:46:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,152 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:46:24,153 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:46:24,153 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:46:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:46:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:46:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:46:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 13:46:24,159 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 13:46:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,161 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 13:46:24,161 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:46:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 13:46:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:46:24,165 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,166 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 13:46:24,166 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-23 13:46:24,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:24,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:46:24,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,266 INFO L185 omatonBuilderFactory]: Interpolants [1025#true, 1026#false, 1027#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 1028#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 1029#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1030#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1031#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1032#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1033#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1034#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1035#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 1036#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 1037#(and (<= 10 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 10)), 1038#(and (<= 11 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 11)), 1039#(and (<= 12 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 12))] [2018-07-23 13:46:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,267 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:46:24,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:46:24,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:46:24,268 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-23 13:46:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,342 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 13:46:24,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:46:24,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 13:46:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,343 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:46:24,343 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:46:24,344 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:46:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:46:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:46:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:46:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 13:46:24,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 13:46:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,353 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 13:46:24,353 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:46:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 13:46:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:46:24,355 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,355 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 13:46:24,355 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-23 13:46:24,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:24,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:46:24,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,448 INFO L185 omatonBuilderFactory]: Interpolants [1168#true, 1169#false, 1170#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 1171#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 1172#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1173#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1174#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1175#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1176#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1177#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1178#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 1179#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 1180#(and (<= 10 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 10)), 1181#(and (<= 11 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 11)), 1182#(and (<= 12 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 12)), 1183#(and (<= ULTIMATE.start_main_~i~5 13) (<= 13 ULTIMATE.start_main_~i~5))] [2018-07-23 13:46:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,449 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:46:24,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:46:24,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:46:24,450 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-23 13:46:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,512 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 13:46:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:46:24,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 13:46:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,514 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:46:24,514 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:46:24,514 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:46:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:46:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:46:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:46:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 13:46:24,520 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 13:46:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,521 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 13:46:24,521 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:46:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 13:46:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:46:24,522 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,522 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 13:46:24,522 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-23 13:46:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:24,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:46:24,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,622 INFO L185 omatonBuilderFactory]: Interpolants [1320#true, 1321#false, 1322#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 1323#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 1324#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1325#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1326#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1327#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1328#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1329#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1330#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 1331#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 1332#(and (<= 10 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 10)), 1333#(and (<= 11 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 11)), 1334#(and (<= 12 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 12)), 1335#(and (<= ULTIMATE.start_main_~i~5 13) (<= 13 ULTIMATE.start_main_~i~5)), 1336#(and (<= ULTIMATE.start_main_~i~5 14) (<= 14 ULTIMATE.start_main_~i~5))] [2018-07-23 13:46:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,625 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:46:24,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:46:24,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:46:24,626 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-23 13:46:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,699 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 13:46:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:46:24,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 13:46:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,700 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:46:24,702 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:46:24,703 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:46:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:46:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:46:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:46:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 13:46:24,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 13:46:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,712 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 13:46:24,712 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:46:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 13:46:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:46:24,716 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,716 INFO L357 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 13:46:24,716 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-23 13:46:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:46:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:46:24,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:46:24,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:46:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,838 INFO L185 omatonBuilderFactory]: Interpolants [1481#true, 1482#false, 1483#(and (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)), 1484#(and (<= ULTIMATE.start_main_~i~5 1) (<= 1 ULTIMATE.start_main_~i~5)), 1485#(and (<= 2 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 2)), 1486#(and (<= ULTIMATE.start_main_~i~5 3) (<= 3 ULTIMATE.start_main_~i~5)), 1487#(and (<= ULTIMATE.start_main_~i~5 4) (<= 4 ULTIMATE.start_main_~i~5)), 1488#(and (<= 5 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 5)), 1489#(and (<= 6 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 6)), 1490#(and (<= 7 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 7)), 1491#(and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~i~5)), 1492#(and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~i~5)), 1493#(and (<= 10 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 10)), 1494#(and (<= 11 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 11)), 1495#(and (<= 12 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 12)), 1496#(and (<= ULTIMATE.start_main_~i~5 13) (<= 13 ULTIMATE.start_main_~i~5)), 1497#(and (<= ULTIMATE.start_main_~i~5 14) (<= 14 ULTIMATE.start_main_~i~5)), 1498#(and (<= ULTIMATE.start_main_~i~5 15) (<= 15 ULTIMATE.start_main_~i~5))] [2018-07-23 13:46:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:46:24,842 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:46:24,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:46:24,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:46:24,843 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-23 13:46:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:46:24,931 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 13:46:24,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:46:24,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 13:46:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:46:24,933 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:46:24,933 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:46:24,937 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:46:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:46:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:46:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:46:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 13:46:24,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 13:46:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:46:24,946 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 13:46:24,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:46:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 13:46:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:46:24,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:46:24,947 INFO L357 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 13:46:24,947 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:46:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-23 13:46:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:46:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:46:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 13:46:24,999 INFO L423 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 13:46:25,040 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:46:25 BoogieIcfgContainer [2018-07-23 13:46:25,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:46:25,041 INFO L168 Benchmark]: Toolchain (without parser) took 2981.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 264.3 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:46:25,044 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:46:25,044 INFO L168 Benchmark]: Boogie Preprocessor took 61.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:46:25,046 INFO L168 Benchmark]: RCFGBuilder took 238.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:46:25,047 INFO L168 Benchmark]: TraceAbstraction took 2677.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:46:25,052 INFO L336 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 238.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2677.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 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_~z~5=0] [L32] assume true; VAL [main_~i~5=0, 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] [L32] assume true; VAL [main_~i~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] [L32] assume true; VAL [main_~i~5=2] [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] [L32] assume true; VAL [main_~i~5=3] [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] [L32] assume true; VAL [main_~i~5=4] [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] [L32] assume true; VAL [main_~i~5=5] [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] [L32] assume true; VAL [main_~i~5=6] [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] [L32] assume true; VAL [main_~i~5=7] [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] [L32] assume true; VAL [main_~i~5=8] [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] [L32] assume true; VAL [main_~i~5=9] [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] [L32] assume true; VAL [main_~i~5=10] [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] [L32] assume true; VAL [main_~i~5=11] [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] [L32] assume true; VAL [main_~i~5=12] [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] [L32] assume true; VAL [main_~i~5=13] [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] [L32] assume true; VAL [main_~i~5=14] [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] [L32] assume true; VAL [main_~i~5=15] [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] [L32] assume true; VAL [main_~i~5=16] [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_~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_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 2.5s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 0 SDslu, 1497 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/1360 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 44080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 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 Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-46-25-066.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-46-25-066.csv Received shutdown request...