java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:05:58,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:05:58,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:05:58,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:05:58,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:05:58,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:05:58,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:05:58,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:05:58,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:05:58,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:05:58,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:05:58,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:05:58,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:05:58,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:05:58,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:05:58,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:05:58,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:05:58,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:05:58,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:05:58,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:05:58,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:05:58,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:05:58,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:05:58,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:05:58,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:05:58,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:05:58,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:05:58,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:05:58,697 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:05:58,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:05:58,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:05:58,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:05:58,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:05:58,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:05:58,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:05:58,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:05:58,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:05:58,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:05:58,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:05:58,722 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:05:58,722 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:05:58,722 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:05:58,722 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:05:58,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:05:58,724 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:05:58,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:05:58,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:05:58,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:05:58,724 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:05:58,724 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:05:58,725 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:05:58,726 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:05:58,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:05:58,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:05:58,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:05:58,791 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:05:58,791 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:05:58,792 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-10-15 15:05:58,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-10-15 15:05:58,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:05:58,847 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:05:58,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:05:58,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:05:58,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:05:58,875 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,877 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,888 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,889 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,892 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,895 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,896 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 15.10 03:05:58" (1/1) ... [2018-10-15 15:05:58,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:05:58,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:05:58,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:05:58,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:05:58,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:05:58,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:05:58,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:05:59,373 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:05:59,374 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:59 BoogieIcfgContainer [2018-10-15 15:05:59,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:05:59,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:05:59,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:05:59,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:05:59,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:05:58" (1/2) ... [2018-10-15 15:05:59,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bb6155 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:59, skipping insertion in model container [2018-10-15 15:05:59,380 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 15.10 03:05:59" (2/2) ... [2018-10-15 15:05:59,382 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-10-15 15:05:59,392 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:05:59,401 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:05:59,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:05:59,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:05:59,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:05:59,450 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:05:59,450 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:05:59,451 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:05:59,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:05:59,451 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:05:59,451 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:05:59,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:05:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-15 15:05:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 15:05:59,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:59,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:59,480 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:59,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash -849259882, now seen corresponding path program 1 times [2018-10-15 15:05:59,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:59,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:05:59,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:05:59,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:05:59,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:05:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:05:59,718 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-10-15 15:05:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:59,760 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-15 15:05:59,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:05:59,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-15 15:05:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:59,773 INFO L225 Difference]: With dead ends: 37 [2018-10-15 15:05:59,773 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 15:05:59,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:05:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 15:05:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-15 15:05:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 15:05:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 15:05:59,814 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-10-15 15:05:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:59,815 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 15:05:59,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:05:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 15:05:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 15:05:59,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:59,817 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:59,817 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:59,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash 795927231, now seen corresponding path program 1 times [2018-10-15 15:05:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:05:59,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:05:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:05:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:05:59,944 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 4 states. [2018-10-15 15:06:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:00,078 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 15:06:00,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:06:00,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-15 15:06:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:00,081 INFO L225 Difference]: With dead ends: 41 [2018-10-15 15:06:00,081 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 15:06:00,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-15 15:06:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 15:06:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-10-15 15:06:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 15:06:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 15:06:00,088 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-10-15 15:06:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:00,089 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 15:06:00,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:06:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 15:06:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 15:06:00,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:00,091 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:00,091 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:00,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash -512084376, now seen corresponding path program 2 times [2018-10-15 15:06:00,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:00,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:00,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:06:00,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:06:00,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:06:00,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:06:00,263 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 5 states. [2018-10-15 15:06:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:00,404 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 15:06:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:06:00,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-15 15:06:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:00,407 INFO L225 Difference]: With dead ends: 45 [2018-10-15 15:06:00,407 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 15:06:00,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:06:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 15:06:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-15 15:06:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 15:06:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 15:06:00,413 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-10-15 15:06:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:00,413 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 15:06:00,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:06:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 15:06:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 15:06:00,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:00,416 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:00,416 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:00,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 32476561, now seen corresponding path program 3 times [2018-10-15 15:06:00,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:06:00,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:06:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:06:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:06:00,667 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 6 states. [2018-10-15 15:06:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:00,798 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 15:06:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:06:00,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-10-15 15:06:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:00,803 INFO L225 Difference]: With dead ends: 49 [2018-10-15 15:06:00,803 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 15:06:00,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:06:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 15:06:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-10-15 15:06:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 15:06:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 15:06:00,809 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-10-15 15:06:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:00,810 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 15:06:00,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:06:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 15:06:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 15:06:00,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:00,812 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:00,813 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:00,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1406982086, now seen corresponding path program 4 times [2018-10-15 15:06:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:06:01,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:06:01,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:06:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:06:01,070 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2018-10-15 15:06:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:01,180 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 15:06:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:06:01,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-10-15 15:06:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:01,181 INFO L225 Difference]: With dead ends: 53 [2018-10-15 15:06:01,182 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 15:06:01,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:06:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 15:06:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-15 15:06:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 15:06:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 15:06:01,188 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-10-15 15:06:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:01,189 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 15:06:01,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:06:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 15:06:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 15:06:01,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:01,190 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:01,191 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:01,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2008594845, now seen corresponding path program 5 times [2018-10-15 15:06:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:01,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:01,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:06:01,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:06:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:06:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:06:01,374 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 8 states. [2018-10-15 15:06:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:01,947 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 15:06:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:06:01,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-10-15 15:06:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:01,951 INFO L225 Difference]: With dead ends: 57 [2018-10-15 15:06:01,951 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 15:06:01,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:06:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 15:06:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-15 15:06:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 15:06:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 15:06:01,957 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-10-15 15:06:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:01,958 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 15:06:01,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:06:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 15:06:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 15:06:01,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:01,959 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:01,960 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:01,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1533945868, now seen corresponding path program 6 times [2018-10-15 15:06:01,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:02,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:02,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:06:02,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:06:02,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:06:02,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:06:02,563 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 9 states. [2018-10-15 15:06:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:02,743 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-15 15:06:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:06:02,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-15 15:06:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:02,746 INFO L225 Difference]: With dead ends: 61 [2018-10-15 15:06:02,746 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 15:06:02,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:06:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 15:06:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-15 15:06:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 15:06:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 15:06:02,752 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-10-15 15:06:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:02,753 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 15:06:02,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:06:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 15:06:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 15:06:02,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:02,754 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:02,754 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:02,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1752560331, now seen corresponding path program 7 times [2018-10-15 15:06:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:03,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:03,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:06:03,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:06:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:06:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:06:03,100 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 10 states. [2018-10-15 15:06:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:03,444 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 15:06:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:06:03,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-10-15 15:06:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:03,447 INFO L225 Difference]: With dead ends: 65 [2018-10-15 15:06:03,447 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 15:06:03,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:06:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 15:06:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-15 15:06:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 15:06:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 15:06:03,461 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-10-15 15:06:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:03,462 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 15:06:03,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:06:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 15:06:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 15:06:03,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:03,466 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:03,467 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:03,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:03,467 INFO L82 PathProgramCache]: Analyzing trace with hash -345164322, now seen corresponding path program 8 times [2018-10-15 15:06:03,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:03,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:03,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:06:03,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:06:03,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:06:03,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:06:03,731 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 11 states. [2018-10-15 15:06:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:03,929 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 15:06:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:06:03,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-15 15:06:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:03,931 INFO L225 Difference]: With dead ends: 69 [2018-10-15 15:06:03,931 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 15:06:03,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:06:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 15:06:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-15 15:06:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 15:06:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 15:06:03,937 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-10-15 15:06:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:03,938 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 15:06:03,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:06:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 15:06:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 15:06:03,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:03,939 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:03,940 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:03,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash -758521337, now seen corresponding path program 9 times [2018-10-15 15:06:03,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:04,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:04,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:06:04,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:06:04,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:06:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:06:04,223 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 12 states. [2018-10-15 15:06:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:04,449 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 15:06:04,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:06:04,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-10-15 15:06:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:04,450 INFO L225 Difference]: With dead ends: 73 [2018-10-15 15:06:04,450 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 15:06:04,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:06:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 15:06:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-15 15:06:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 15:06:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 15:06:04,456 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-10-15 15:06:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:04,456 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 15:06:04,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:06:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 15:06:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 15:06:04,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:04,458 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:04,458 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:04,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash 640831920, now seen corresponding path program 10 times [2018-10-15 15:06:04,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:04,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:04,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:06:04,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:06:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:06:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:06:04,713 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 13 states. [2018-10-15 15:06:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:05,067 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 15:06:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:06:05,068 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-10-15 15:06:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:05,069 INFO L225 Difference]: With dead ends: 77 [2018-10-15 15:06:05,069 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 15:06:05,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:06:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 15:06:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-10-15 15:06:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 15:06:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 15:06:05,077 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-10-15 15:06:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:05,078 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 15:06:05,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:06:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 15:06:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 15:06:05,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:05,081 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:05,082 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:05,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1424440103, now seen corresponding path program 11 times [2018-10-15 15:06:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:05,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:05,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:06:05,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:06:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:06:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:06:05,532 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 14 states. [2018-10-15 15:06:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:05,864 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 15:06:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:06:05,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-10-15 15:06:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:05,869 INFO L225 Difference]: With dead ends: 81 [2018-10-15 15:06:05,869 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 15:06:05,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:06:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 15:06:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-15 15:06:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 15:06:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 15:06:05,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-10-15 15:06:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:05,885 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 15:06:05,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:06:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 15:06:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 15:06:05,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:05,887 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:05,887 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1546683518, now seen corresponding path program 12 times [2018-10-15 15:06:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:06,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:06,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:06:06,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:06:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:06:06,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:06:06,191 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 15 states. [2018-10-15 15:06:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:07,238 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 15:06:07,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:06:07,241 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-10-15 15:06:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:07,241 INFO L225 Difference]: With dead ends: 85 [2018-10-15 15:06:07,242 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 15:06:07,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:06:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 15:06:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-15 15:06:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 15:06:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 15:06:07,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-10-15 15:06:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:07,248 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 15:06:07,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:06:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 15:06:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 15:06:07,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:07,250 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:07,250 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:07,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1602794923, now seen corresponding path program 13 times [2018-10-15 15:06:07,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:07,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:07,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:06:07,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:06:07,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:06:07,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:06:07,656 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 16 states. [2018-10-15 15:06:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:08,209 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 15:06:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:06:08,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2018-10-15 15:06:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:08,211 INFO L225 Difference]: With dead ends: 89 [2018-10-15 15:06:08,211 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 15:06:08,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:06:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 15:06:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-10-15 15:06:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 15:06:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 15:06:08,216 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-10-15 15:06:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:08,216 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 15:06:08,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:06:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 15:06:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 15:06:08,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:08,218 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:08,218 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:08,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -900287660, now seen corresponding path program 14 times [2018-10-15 15:06:08,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:08,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:06:08,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:06:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:06:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:06:08,501 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 17 states. [2018-10-15 15:06:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:08,888 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 15:06:08,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:06:08,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2018-10-15 15:06:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:08,890 INFO L225 Difference]: With dead ends: 93 [2018-10-15 15:06:08,890 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 15:06:08,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:06:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 15:06:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-15 15:06:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 15:06:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 15:06:08,894 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-10-15 15:06:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:08,894 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 15:06:08,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:06:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 15:06:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 15:06:08,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:08,896 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:08,896 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:08,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -47467395, now seen corresponding path program 15 times [2018-10-15 15:06:08,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:06:09,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:06:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:06:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:06:09,308 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 18 states. [2018-10-15 15:06:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:09,732 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 15:06:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:06:09,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 90 [2018-10-15 15:06:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:09,734 INFO L225 Difference]: With dead ends: 97 [2018-10-15 15:06:09,734 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 15:06:09,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:06:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 15:06:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-15 15:06:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 15:06:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 15:06:09,738 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-10-15 15:06:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:09,738 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 15:06:09,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:06:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 15:06:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 15:06:09,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:09,740 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:09,740 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:09,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash -841352922, now seen corresponding path program 16 times [2018-10-15 15:06:09,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 15:06:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 15:06:09,795 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 15:06:09,824 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:06:09 BoogieIcfgContainer [2018-10-15 15:06:09,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:06:09,826 INFO L168 Benchmark]: Toolchain (without parser) took 10981.95 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 40.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 227.2 MB). Peak memory consumption was 267.6 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:09,828 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:06:09,828 INFO L168 Benchmark]: Boogie Preprocessor took 50.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:06:09,829 INFO L168 Benchmark]: RCFGBuilder took 475.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:09,829 INFO L168 Benchmark]: TraceAbstraction took 10449.94 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 40.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 206.1 MB). Peak memory consumption was 246.5 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:09,837 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 475.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10449.94 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 40.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 206.1 MB). Peak memory consumption was 246.5 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 47. 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; VAL [main_#t~nondet0=0, main_~x~5=0] [L22] havoc main_#t~nondet0; VAL [main_~x~5=0] [L23] main_~y~5 := main_#t~nondet1; VAL [main_#t~nondet1=0, main_~x~5=0, main_~y~5=0] [L24] havoc main_#t~nondet1; VAL [main_~x~5=0, main_~y~5=0] [L25] havoc main_~xx~5; VAL [main_~x~5=0, main_~y~5=0] [L26] havoc main_~yy~5; VAL [main_~x~5=0, main_~y~5=0] [L27] havoc main_~zz~5; VAL [main_~x~5=0, main_~y~5=0] [L28] main_~z~5 := 0; VAL [main_~x~5=0, main_~y~5=0, main_~z~5=0] [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~x~5=0, main_~y~5=0, main_~z~5=0] [L32] assume true; VAL [main_~i~5=0, main_~x~5=0, main_~y~5=0, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=0, main_~x~5=0, main_~y~5=0, main_~z~5=0] [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))); VAL [main_~i~5=0, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=1, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=1, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=1, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=2, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=2, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=2, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=3, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=3, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=3, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=4, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=4, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=4, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=5, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=5, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=5, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=6, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=6, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=6, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=7, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=7, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=7, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=8, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=8, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=8, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=9, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=9, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=9, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=10, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=10, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=10, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=11, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=11, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=11, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=12, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=12, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=12, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=13, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=13, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=13, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=14, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=14, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=14, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=15, main_~x~5=0, main_~y~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=15, main_~x~5=0, main_~y~5=0] [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))); VAL [main_~i~5=15, main_~x~5=0, main_~y~5=0] [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L32] assume true; VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L37] assume !(main_~i~5 % 4294967296 < 16); VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L38] main_~xx~5 := main_~x~5 % 65536; VAL [main_~i~5=16, main_~xx~5=0, main_~x~5=0, main_~y~5=0] [L39] main_~yy~5 := main_~y~5 % 65536; VAL [main_~i~5=16, main_~xx~5=0, main_~x~5=0, main_~yy~5=0, main_~y~5=0] [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); VAL [main_~i~5=16, main_~x~5=0, main_~yy~5=0, main_~y~5=0] [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); VAL [main_~i~5=16, main_~x~5=0, main_~yy~5=0, main_~y~5=0] [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); VAL [main_~i~5=16, main_~x~5=0, main_~yy~5=0, main_~y~5=0] [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); VAL [main_~i~5=16, main_~x~5=0, main_~yy~5=0, main_~y~5=0] [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); VAL [main_~i~5=16, main_~x~5=0, main_~y~5=0] [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~i~5=16, main_~x~5=0, main_~y~5=0, main_~zz~5=0, main_~z~5=1] [L50] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~i~5=16, main_~x~5=0, main_~y~5=0, main_~zz~5=0, main_~z~5=1] [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=0, main_~y~5=0, main_~zz~5=0, main_~z~5=1] [L52] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=0, main_~y~5=0, main_~zz~5=0, main_~z~5=1] [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=0, main_~y~5=0, main_~zz~5=0, main_~z~5=1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=0, main_~y~5=0, main_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. UNSAFE Result, 10.3s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 736 SDtfs, 32 SDslu, 6258 SDs, 0 SdLazy, 3401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 32 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 275024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2480 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_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-06-09-858.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-06-09-858.csv Received shutdown request...