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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:56:24,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:56:24,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:56:24,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:56:24,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:56:24,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:56:24,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:56:24,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:56:24,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:56:24,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:56:24,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:56:24,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:56:24,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:56:24,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:56:24,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:56:24,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:56:24,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:56:24,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:56:24,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:56:24,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:56:24,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:56:24,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:56:24,743 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:56:24,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:56:24,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:56:24,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:56:24,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:56:24,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:56:24,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:56:24,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:56:24,751 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:56:24,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:56:24,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:56:24,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:56:24,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:56:24,755 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:56:24,755 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 12:56:24,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:56:24,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:56:24,776 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:56:24,776 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:56:24,777 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:56:24,778 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:56:24,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:56:24,779 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:56:24,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:56:24,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:56:24,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:56:24,779 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:56:24,780 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:56:24,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:56:24,781 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:56:24,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:56:24,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:56:24,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:56:24,851 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:56:24,852 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:56:24,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_false-unreach-call1.i_3.bpl [2018-10-15 12:56:24,853 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_false-unreach-call1.i_3.bpl' [2018-10-15 12:56:24,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:56:24,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:56:24,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:56:24,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:56:24,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:56:24,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/1) ... [2018-10-15 12:56:24,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:56:24,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:56:24,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:56:24,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:56:24,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (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 12:56:25,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:56:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:56:25,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:56:25,353 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:56:25,354 INFO L202 PluginConnector]: Adding new model diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:56:25 BoogieIcfgContainer [2018-10-15 12:56:25,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:56:25,355 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:56:25,355 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:56:25,356 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:56:25,359 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:56:25" (1/1) ... [2018-10-15 12:56:25,364 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 12:56:25,377 INFO L202 PluginConnector]: Adding new model diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:56:25 BasicIcfg [2018-10-15 12:56:25,378 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:56:25,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:56:25,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:56:25,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:56:25,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:56:24" (1/3) ... [2018-10-15 12:56:25,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a39e791 and model type diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:56:25, skipping insertion in model container [2018-10-15 12:56:25,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:56:25" (2/3) ... [2018-10-15 12:56:25,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a39e791 and model type diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:56:25, skipping insertion in model container [2018-10-15 12:56:25,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:56:25" (3/3) ... [2018-10-15 12:56:25,386 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 12:56:25,397 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:56:25,406 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:56:25,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:56:25,452 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:56:25,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:56:25,453 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:56:25,453 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:56:25,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:56:25,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:56:25,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:56:25,454 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:56:25,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:56:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 12:56:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 12:56:25,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:25,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:25,478 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1912306728, now seen corresponding path program 1 times [2018-10-15 12:56:25,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:25,779 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 12:56:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:56:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:56:25,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:56:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:56:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:56:25,814 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 12:56:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:25,913 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 12:56:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:56:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 12:56:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:25,928 INFO L225 Difference]: With dead ends: 18 [2018-10-15 12:56:25,928 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 12:56:25,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:56:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 12:56:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-10-15 12:56:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 12:56:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 12:56:25,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-10-15 12:56:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:25,971 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 12:56:25,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:56:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 12:56:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 12:56:25,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:25,973 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:25,973 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:25,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:25,974 INFO L82 PathProgramCache]: Analyzing trace with hash -354587143, now seen corresponding path program 1 times [2018-10-15 12:56:25,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:26,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:26,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 12:56:26,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:56:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:56:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:56:26,155 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-10-15 12:56:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:26,246 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 12:56:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:56:26,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-15 12:56:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:26,248 INFO L225 Difference]: With dead ends: 21 [2018-10-15 12:56:26,248 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 12:56:26,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:56:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 12:56:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-10-15 12:56:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 12:56:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 12:56:26,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-10-15 12:56:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:26,254 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 12:56:26,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:56:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 12:56:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 12:56:26,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:26,255 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:26,256 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:26,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 675864200, now seen corresponding path program 2 times [2018-10-15 12:56:26,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:26,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:26,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:56:26,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:56:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:56:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:56:26,446 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-10-15 12:56:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:26,573 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 12:56:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:56:26,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 12:56:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:26,575 INFO L225 Difference]: With dead ends: 24 [2018-10-15 12:56:26,575 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:56:26,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 12:56:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:56:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-15 12:56:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 12:56:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-15 12:56:26,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-10-15 12:56:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:26,581 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-15 12:56:26,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:56:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-15 12:56:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 12:56:26,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:26,583 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:26,583 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:26,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1574408295, now seen corresponding path program 3 times [2018-10-15 12:56:26,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:26,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:56:26,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:56:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:56:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:56:26,929 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 6 states. [2018-10-15 12:56:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:27,183 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 12:56:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:56:27,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-15 12:56:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:27,184 INFO L225 Difference]: With dead ends: 27 [2018-10-15 12:56:27,185 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 12:56:27,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:56:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 12:56:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-15 12:56:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 12:56:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 12:56:27,190 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-10-15 12:56:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:27,191 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 12:56:27,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:56:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 12:56:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:56:27,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:27,192 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:27,193 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:27,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 702216424, now seen corresponding path program 4 times [2018-10-15 12:56:27,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:27,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:27,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:56:27,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:56:27,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:56:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:56:27,736 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 7 states. [2018-10-15 12:56:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:27,923 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 12:56:27,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:56:27,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 12:56:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:27,928 INFO L225 Difference]: With dead ends: 30 [2018-10-15 12:56:27,928 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 12:56:27,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:56:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 12:56:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-10-15 12:56:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 12:56:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-15 12:56:27,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-10-15 12:56:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:27,934 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-15 12:56:27,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:56:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-15 12:56:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 12:56:27,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:27,936 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:27,936 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:27,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1800649017, now seen corresponding path program 5 times [2018-10-15 12:56:27,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:28,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:56:28,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:56:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:56:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:56:28,268 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2018-10-15 12:56:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:28,691 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 12:56:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:56:28,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-15 12:56:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:28,693 INFO L225 Difference]: With dead ends: 33 [2018-10-15 12:56:28,693 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 12:56:28,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:56:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 12:56:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-15 12:56:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:56:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:56:28,698 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-10-15 12:56:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:28,698 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:56:28,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:56:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:56:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:56:28,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:28,700 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:28,700 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:28,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1850198856, now seen corresponding path program 6 times [2018-10-15 12:56:28,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:28,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:28,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:56:28,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:56:28,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:56:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:56:28,942 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-10-15 12:56:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:29,144 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 12:56:29,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:56:29,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-15 12:56:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:29,147 INFO L225 Difference]: With dead ends: 36 [2018-10-15 12:56:29,148 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:56:29,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:56:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:56:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-15 12:56:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 12:56:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-15 12:56:29,153 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-10-15 12:56:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:29,153 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-15 12:56:29,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:56:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-15 12:56:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 12:56:29,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:29,154 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:29,155 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:29,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash 520702681, now seen corresponding path program 7 times [2018-10-15 12:56:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:30,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:30,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:56:30,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:56:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:56:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:56:30,065 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 10 states. [2018-10-15 12:56:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:30,345 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 12:56:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:56:30,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-10-15 12:56:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:30,347 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:56:30,348 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:56:30,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:56:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:56:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-15 12:56:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 12:56:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 12:56:30,353 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-10-15 12:56:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:30,353 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 12:56:30,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:56:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 12:56:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 12:56:30,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:30,355 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:30,355 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:30,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1688556968, now seen corresponding path program 8 times [2018-10-15 12:56:30,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:30,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:56:30,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:56:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:56:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:56:30,706 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-10-15 12:56:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:31,093 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 12:56:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:56:31,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-10-15 12:56:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:31,100 INFO L225 Difference]: With dead ends: 42 [2018-10-15 12:56:31,100 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 12:56:31,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:56:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 12:56:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-15 12:56:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:56:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:56:31,109 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-10-15 12:56:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:31,110 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:56:31,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:56:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:56:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:56:31,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:31,111 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:31,111 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:31,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash -294443911, now seen corresponding path program 9 times [2018-10-15 12:56:31,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:31,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:56:31,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:56:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:56:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:56:31,432 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2018-10-15 12:56:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:31,690 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 12:56:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:56:31,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-15 12:56:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:31,692 INFO L225 Difference]: With dead ends: 45 [2018-10-15 12:56:31,692 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:56:31,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:56:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:56:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-15 12:56:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:56:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:56:31,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-10-15 12:56:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:31,698 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:56:31,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:56:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:56:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:56:31,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:31,700 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:31,700 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:31,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1401526280, now seen corresponding path program 10 times [2018-10-15 12:56:31,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:31,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:31,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:56:31,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:56:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:56:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:56:31,998 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-10-15 12:56:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:32,409 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 12:56:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:56:32,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-10-15 12:56:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:32,411 INFO L225 Difference]: With dead ends: 48 [2018-10-15 12:56:32,411 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:56:32,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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 12:56:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:56:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-15 12:56:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 12:56:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 12:56:32,416 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-10-15 12:56:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:32,417 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 12:56:32,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:56:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 12:56:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 12:56:32,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:32,418 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:32,419 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:32,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash 54216217, now seen corresponding path program 11 times [2018-10-15 12:56:32,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:32,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:32,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:56:32,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:56:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:56:32,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:56:32,760 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 14 states. [2018-10-15 12:56:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:33,244 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-15 12:56:33,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:56:33,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-10-15 12:56:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:33,246 INFO L225 Difference]: With dead ends: 51 [2018-10-15 12:56:33,246 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 12:56:33,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:56:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 12:56:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-15 12:56:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:56:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 12:56:33,251 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-10-15 12:56:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:33,252 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 12:56:33,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:56:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 12:56:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 12:56:33,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:33,253 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:33,253 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1190489496, now seen corresponding path program 12 times [2018-10-15 12:56:33,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:33,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:33,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:56:33,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:56:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:56:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:56:33,586 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 15 states. [2018-10-15 12:56:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:33,922 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:56:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:56:33,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-10-15 12:56:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:33,925 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:56:33,925 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:56:33,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 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 12:56:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:56:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-15 12:56:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 12:56:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-15 12:56:33,931 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-10-15 12:56:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:33,931 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-15 12:56:33,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:56:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-15 12:56:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 12:56:33,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:33,932 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:33,933 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:33,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 529248185, now seen corresponding path program 13 times [2018-10-15 12:56:33,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:35,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:35,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:56:35,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:56:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:56:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:56:35,416 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 16 states. [2018-10-15 12:56:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:35,874 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:56:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:56:35,874 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-10-15 12:56:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:35,875 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:56:35,875 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:56:35,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:56:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:56:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-15 12:56:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:56:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 12:56:35,881 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-10-15 12:56:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:35,881 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 12:56:35,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:56:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 12:56:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 12:56:35,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:35,883 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:35,883 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:35,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1430371128, now seen corresponding path program 14 times [2018-10-15 12:56:35,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:36,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:36,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:56:36,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:56:36,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:56:36,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:56:36,239 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2018-10-15 12:56:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:37,017 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 12:56:37,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:56:37,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-15 12:56:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:37,019 INFO L225 Difference]: With dead ends: 60 [2018-10-15 12:56:37,019 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 12:56:37,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:56:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 12:56:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-15 12:56:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 12:56:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 12:56:37,024 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-10-15 12:56:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:37,025 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 12:56:37,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:56:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 12:56:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 12:56:37,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:37,026 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:37,026 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:37,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1041129817, now seen corresponding path program 15 times [2018-10-15 12:56:37,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:37,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:37,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:56:37,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:56:37,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:56:37,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:56:37,664 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 18 states. [2018-10-15 12:56:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:38,548 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 12:56:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:56:38,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-10-15 12:56:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:38,550 INFO L225 Difference]: With dead ends: 63 [2018-10-15 12:56:38,550 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:56:38,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:56:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:56:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-15 12:56:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:56:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 12:56:38,555 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-15 12:56:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:38,556 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 12:56:38,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:56:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 12:56:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:56:38,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:38,557 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:38,557 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:38,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 901426984, now seen corresponding path program 16 times [2018-10-15 12:56:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:38,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:38,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:56:38,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:56:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:56:38,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:56:38,974 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 19 states. [2018-10-15 12:56:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:39,509 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 12:56:39,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:56:39,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-15 12:56:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:39,511 INFO L225 Difference]: With dead ends: 66 [2018-10-15 12:56:39,511 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 12:56:39,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:56:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 12:56:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-15 12:56:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-15 12:56:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-15 12:56:39,515 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-15 12:56:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:39,515 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-15 12:56:39,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:56:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-15 12:56:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-15 12:56:39,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:39,517 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:39,517 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:39,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:39,517 INFO L82 PathProgramCache]: Analyzing trace with hash 837638905, now seen corresponding path program 17 times [2018-10-15 12:56:39,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:56:40,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:56:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:56:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:56:40,920 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 20 states. [2018-10-15 12:56:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:41,477 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 12:56:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:56:41,477 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-10-15 12:56:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:41,478 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:56:41,479 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:56:41,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:56:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:56:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-15 12:56:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:56:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:56:41,483 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-10-15 12:56:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:41,483 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:56:41,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:56:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:56:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:56:41,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:41,485 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:41,485 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:41,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1097477752, now seen corresponding path program 18 times [2018-10-15 12:56:41,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:42,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:42,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:56:42,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:56:42,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:56:42,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:56:42,676 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 21 states. [2018-10-15 12:56:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:43,371 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 12:56:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:56:43,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-15 12:56:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:43,373 INFO L225 Difference]: With dead ends: 72 [2018-10-15 12:56:43,373 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:56:43,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:56:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:56:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-15 12:56:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:56:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 12:56:43,377 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-10-15 12:56:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:43,378 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 12:56:43,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:56:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 12:56:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:56:43,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:43,379 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:43,379 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:43,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1188207769, now seen corresponding path program 19 times [2018-10-15 12:56:43,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:43,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:56:43,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:56:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:56:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:56:43,880 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-10-15 12:56:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:44,519 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-15 12:56:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:56:44,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-10-15 12:56:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:44,520 INFO L225 Difference]: With dead ends: 75 [2018-10-15 12:56:44,521 INFO L226 Difference]: Without dead ends: 75 [2018-10-15 12:56:44,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:56:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-15 12:56:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-10-15 12:56:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:56:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:56:44,525 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-10-15 12:56:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:44,525 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:56:44,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:56:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:56:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:56:44,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:44,526 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:44,527 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:44,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1634053096, now seen corresponding path program 20 times [2018-10-15 12:56:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:56:45,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:56:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:56:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:56:45,205 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 23 states. [2018-10-15 12:56:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:45,917 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:56:45,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:56:45,917 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-10-15 12:56:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:45,918 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:56:45,918 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:56:45,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:56:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:56:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-15 12:56:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 12:56:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 12:56:45,921 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-10-15 12:56:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:45,921 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 12:56:45,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:56:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 12:56:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 12:56:45,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:45,922 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:45,923 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:45,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash -521656775, now seen corresponding path program 21 times [2018-10-15 12:56:45,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:47,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:47,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:56:47,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:56:47,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:56:47,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:56:47,778 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-15 12:56:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:48,682 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:56:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:56:48,684 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-15 12:56:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:48,685 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:56:48,685 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:56:48,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:56:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:56:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-15 12:56:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 12:56:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 12:56:48,687 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-10-15 12:56:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:48,688 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 12:56:48,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:56:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 12:56:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:56:48,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:48,688 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:48,688 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:48,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1371553352, now seen corresponding path program 22 times [2018-10-15 12:56:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:50,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:50,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:56:50,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:56:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:56:50,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:56:50,437 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 25 states. [2018-10-15 12:56:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:51,325 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 12:56:51,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:56:51,326 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-10-15 12:56:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:51,327 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:56:51,327 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:56:51,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:56:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:56:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-15 12:56:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-15 12:56:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-15 12:56:51,331 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-10-15 12:56:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:51,332 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-15 12:56:51,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:56:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-15 12:56:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-15 12:56:51,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:51,333 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:51,333 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:51,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 483915737, now seen corresponding path program 23 times [2018-10-15 12:56:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:52,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:52,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:56:52,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:56:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:56:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:56:52,184 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 26 states. [2018-10-15 12:56:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:53,079 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-15 12:56:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:56:53,079 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-10-15 12:56:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:53,080 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:56:53,080 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 12:56:53,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:56:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 12:56:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-15 12:56:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 12:56:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 12:56:53,083 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-15 12:56:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:53,083 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 12:56:53,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:56:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 12:56:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 12:56:53,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:53,084 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:53,084 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:53,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:53,085 INFO L82 PathProgramCache]: Analyzing trace with hash 985368744, now seen corresponding path program 24 times [2018-10-15 12:56:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:54,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:54,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:56:54,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:56:54,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:56:54,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:56:54,134 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 27 states. [2018-10-15 12:56:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:55,103 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 12:56:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:56:55,103 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-10-15 12:56:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:55,105 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:56:55,105 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:56:55,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:56:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:56:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-15 12:56:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 12:56:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-15 12:56:55,109 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-15 12:56:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:55,109 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-15 12:56:55,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:56:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-15 12:56:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 12:56:55,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:55,110 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:55,110 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:55,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1875644793, now seen corresponding path program 25 times [2018-10-15 12:56:55,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:56,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:56,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:56:56,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:56:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:56:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:56:56,452 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 28 states. [2018-10-15 12:56:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:57,507 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 12:56:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:56:57,508 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2018-10-15 12:56:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:57,509 INFO L225 Difference]: With dead ends: 93 [2018-10-15 12:56:57,509 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 12:56:57,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:56:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 12:56:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-15 12:56:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:56:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:56:57,513 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-15 12:56:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:57,514 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:56:57,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:56:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:56:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:56:57,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:57,515 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:57,515 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:57,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1628599544, now seen corresponding path program 26 times [2018-10-15 12:56:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:58,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:58,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:56:58,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:56:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:56:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:56:58,808 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 29 states. [2018-10-15 12:57:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:00,045 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 12:57:00,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:57:00,046 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-10-15 12:57:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:00,047 INFO L225 Difference]: With dead ends: 96 [2018-10-15 12:57:00,047 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 12:57:00,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:57:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 12:57:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-15 12:57:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 12:57:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-15 12:57:00,051 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-15 12:57:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:00,051 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-15 12:57:00,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:57:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-15 12:57:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 12:57:00,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:00,052 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:00,052 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:00,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1198420761, now seen corresponding path program 27 times [2018-10-15 12:57:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:00,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:00,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:57:00,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:57:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:57:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:57:00,889 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 30 states. [2018-10-15 12:57:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:02,064 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:57:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:57:02,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-10-15 12:57:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:02,066 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:57:02,066 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:57:02,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:57:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:57:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-15 12:57:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 12:57:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 12:57:02,070 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-15 12:57:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:02,070 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 12:57:02,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:57:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 12:57:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 12:57:02,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:02,071 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:02,071 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:02,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 946619752, now seen corresponding path program 28 times [2018-10-15 12:57:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:02,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:02,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:57:02,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:57:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:57:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:57:02,871 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-10-15 12:57:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:04,319 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 12:57:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:57:04,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2018-10-15 12:57:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:04,320 INFO L225 Difference]: With dead ends: 102 [2018-10-15 12:57:04,320 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:57:04,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:57:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:57:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-15 12:57:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 12:57:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 12:57:04,325 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-15 12:57:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:04,325 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 12:57:04,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:57:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 12:57:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:57:04,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:04,326 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:04,326 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:04,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1444340551, now seen corresponding path program 29 times [2018-10-15 12:57:04,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:04,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:04,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:57:04,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:57:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:57:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:57:04,937 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 32 states. [2018-10-15 12:57:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:06,360 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 12:57:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:57:06,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-10-15 12:57:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:06,361 INFO L225 Difference]: With dead ends: 105 [2018-10-15 12:57:06,362 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 12:57:06,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:57:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 12:57:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-15 12:57:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 12:57:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 12:57:06,366 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-15 12:57:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:06,366 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 12:57:06,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:57:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 12:57:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 12:57:06,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:06,367 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:06,367 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:06,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1489876936, now seen corresponding path program 30 times [2018-10-15 12:57:06,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:57:07,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:57:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:57:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:57:07,318 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 33 states. [2018-10-15 12:57:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:08,865 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:57:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:57:08,865 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2018-10-15 12:57:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:08,867 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:57:08,867 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:57:08,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:57:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:57:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-15 12:57:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 12:57:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 12:57:08,870 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-15 12:57:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:08,871 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 12:57:08,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:57:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 12:57:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 12:57:08,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:08,872 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:08,872 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:08,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash -706343335, now seen corresponding path program 31 times [2018-10-15 12:57:08,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:09,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 12:57:09,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 12:57:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 12:57:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:57:09,733 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 34 states. [2018-10-15 12:57:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:11,283 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-15 12:57:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:57:11,284 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2018-10-15 12:57:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:11,285 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:57:11,285 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 12:57:11,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:57:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 12:57:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-15 12:57:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 12:57:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 12:57:11,289 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-15 12:57:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:11,290 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 12:57:11,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 12:57:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 12:57:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 12:57:11,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:11,291 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:11,291 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:11,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1227350568, now seen corresponding path program 32 times [2018-10-15 12:57:11,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:11,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:11,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:57:11,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:57:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:57:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:57:11,994 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 35 states. [2018-10-15 12:57:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:13,649 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 12:57:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:57:13,650 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2018-10-15 12:57:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:13,651 INFO L225 Difference]: With dead ends: 114 [2018-10-15 12:57:13,651 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:57:13,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:57:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:57:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-15 12:57:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-15 12:57:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-15 12:57:13,655 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-15 12:57:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:13,656 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-15 12:57:13,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:57:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-15 12:57:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-15 12:57:13,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:13,657 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:13,657 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -493926407, now seen corresponding path program 33 times [2018-10-15 12:57:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:14,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:57:14,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:57:14,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:57:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:57:14,608 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 36 states. [2018-10-15 12:57:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:16,327 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:57:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:57:16,328 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2018-10-15 12:57:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:16,329 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:57:16,329 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:57:16,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:57:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:57:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-15 12:57:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:57:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:57:16,333 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-15 12:57:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:16,333 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:57:16,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:57:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:57:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:57:16,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:16,334 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:16,334 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:16,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1441741688, now seen corresponding path program 34 times [2018-10-15 12:57:16,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:17,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:17,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:57:17,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:57:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:57:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:57:17,210 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 37 states. [2018-10-15 12:57:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:19,015 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 12:57:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:57:19,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-10-15 12:57:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:19,017 INFO L225 Difference]: With dead ends: 120 [2018-10-15 12:57:19,017 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 12:57:19,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:57:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 12:57:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-15 12:57:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 12:57:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-15 12:57:19,021 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-15 12:57:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:19,021 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-15 12:57:19,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:57:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-15 12:57:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-15 12:57:19,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:19,022 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:19,022 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:19,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1603193241, now seen corresponding path program 35 times [2018-10-15 12:57:19,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:20,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:57:20,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:57:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:57:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:57:20,233 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 38 states. [2018-10-15 12:57:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:22,153 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-15 12:57:22,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:57:22,154 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-10-15 12:57:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:22,155 INFO L225 Difference]: With dead ends: 123 [2018-10-15 12:57:22,155 INFO L226 Difference]: Without dead ends: 123 [2018-10-15 12:57:22,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:57:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-15 12:57:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-15 12:57:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:57:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 12:57:22,159 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-15 12:57:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:22,159 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 12:57:22,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:57:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 12:57:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:57:22,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:22,160 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:22,160 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:22,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -744595736, now seen corresponding path program 36 times [2018-10-15 12:57:22,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:23,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:23,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:57:23,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:57:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:57:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:57:23,553 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-15 12:57:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:25,721 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:57:25,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:57:25,721 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-15 12:57:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:25,723 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:57:25,723 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:57:25,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:57:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:57:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-15 12:57:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 12:57:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-15 12:57:25,728 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-15 12:57:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:25,728 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-15 12:57:25,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:57:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-15 12:57:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-15 12:57:25,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:25,729 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:25,730 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:25,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash -183594183, now seen corresponding path program 37 times [2018-10-15 12:57:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:26,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:26,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 12:57:26,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 12:57:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 12:57:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:57:26,805 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 40 states. [2018-10-15 12:57:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:29,022 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:57:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:57:29,023 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 123 [2018-10-15 12:57:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:29,024 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:57:29,024 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:57:29,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:57:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:57:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-15 12:57:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 12:57:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 12:57:29,028 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-15 12:57:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:29,029 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 12:57:29,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 12:57:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 12:57:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 12:57:29,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:29,030 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:29,030 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:29,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash 895922504, now seen corresponding path program 38 times [2018-10-15 12:57:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:30,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:30,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:57:30,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:57:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:57:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:57:30,378 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 41 states. [2018-10-15 12:57:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:32,598 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 12:57:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:57:32,599 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 126 [2018-10-15 12:57:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:32,601 INFO L225 Difference]: With dead ends: 132 [2018-10-15 12:57:32,601 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:57:32,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:57:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:57:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-15 12:57:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 12:57:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 12:57:32,605 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-15 12:57:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:32,605 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 12:57:32,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:57:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 12:57:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:57:32,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:32,606 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:32,607 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:32,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:32,607 INFO L82 PathProgramCache]: Analyzing trace with hash 62432473, now seen corresponding path program 39 times [2018-10-15 12:57:32,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:33,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:33,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:57:33,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:57:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:57:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:57:33,587 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 42 states. [2018-10-15 12:57:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:36,106 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 12:57:36,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:57:36,107 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 129 [2018-10-15 12:57:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:36,108 INFO L225 Difference]: With dead ends: 135 [2018-10-15 12:57:36,108 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:57:36,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:57:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:57:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-15 12:57:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:57:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 12:57:36,112 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-15 12:57:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:36,113 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 12:57:36,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:57:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 12:57:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 12:57:36,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:36,114 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:36,114 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:36,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1233142872, now seen corresponding path program 40 times [2018-10-15 12:57:36,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:37,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:37,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:57:37,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:57:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:57:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:57:37,806 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-15 12:57:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:40,394 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 12:57:40,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:57:40,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-15 12:57:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:40,395 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:57:40,396 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:57:40,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:57:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:57:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-15 12:57:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 12:57:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 12:57:40,401 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-15 12:57:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:40,401 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 12:57:40,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:57:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 12:57:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:57:40,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:40,402 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:40,402 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:40,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1152843385, now seen corresponding path program 41 times [2018-10-15 12:57:40,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:57:41,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:57:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:57:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:57:41,880 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 44 states. [2018-10-15 12:57:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:44,485 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 12:57:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:57:44,485 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 135 [2018-10-15 12:57:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:44,486 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:57:44,487 INFO L226 Difference]: Without dead ends: 141 [2018-10-15 12:57:44,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:57:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-15 12:57:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-15 12:57:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:57:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:57:44,491 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-15 12:57:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:44,491 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:57:44,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:57:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:57:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:57:44,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:44,492 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:44,493 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:44,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:44,493 INFO L82 PathProgramCache]: Analyzing trace with hash 360676872, now seen corresponding path program 42 times [2018-10-15 12:57:44,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:57:45,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:57:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:57:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:57:45,798 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 45 states. [2018-10-15 12:57:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:49,186 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:57:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:57:49,187 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 138 [2018-10-15 12:57:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:49,188 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:57:49,188 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:57:49,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:57:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:57:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-15 12:57:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-15 12:57:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-15 12:57:49,192 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-15 12:57:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:49,193 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-15 12:57:49,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:57:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-15 12:57:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-15 12:57:49,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:49,194 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:49,194 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:49,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1773379609, now seen corresponding path program 43 times [2018-10-15 12:57:49,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:57:50,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:57:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:57:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:57:50,738 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 46 states. [2018-10-15 12:57:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:53,614 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-15 12:57:53,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:57:53,614 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-10-15 12:57:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:53,616 INFO L225 Difference]: With dead ends: 147 [2018-10-15 12:57:53,616 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 12:57:53,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:57:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 12:57:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-15 12:57:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:57:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 12:57:53,620 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-15 12:57:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:53,620 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 12:57:53,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:57:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 12:57:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 12:57:53,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:53,621 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:53,621 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:53,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1216084072, now seen corresponding path program 44 times [2018-10-15 12:57:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:55,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:55,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:57:55,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:57:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:57:55,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:57:55,332 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 47 states. [2018-10-15 12:57:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:58,304 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 12:57:58,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:57:58,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 144 [2018-10-15 12:57:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:58,306 INFO L225 Difference]: With dead ends: 150 [2018-10-15 12:57:58,306 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 12:57:58,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:57:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 12:57:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-15 12:57:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 12:57:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-15 12:57:58,310 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-15 12:57:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:58,310 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-15 12:57:58,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:57:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-15 12:57:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 12:57:58,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:58,311 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:58,311 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:58,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1126659655, now seen corresponding path program 45 times [2018-10-15 12:57:58,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:59,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:59,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:57:59,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:57:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:57:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:57:59,661 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 48 states. [2018-10-15 12:58:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:03,037 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:58:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:58:03,038 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-10-15 12:58:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:03,039 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:58:03,039 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:58:03,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:58:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:58:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-15 12:58:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:58:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:58:03,043 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-15 12:58:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:03,043 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:58:03,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:58:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:58:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:58:03,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:03,044 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:03,044 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:03,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -586470712, now seen corresponding path program 46 times [2018-10-15 12:58:03,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:04,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:04,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:58:04,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:58:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:58:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:58:04,299 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 49 states. [2018-10-15 12:58:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:07,688 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 12:58:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:58:07,691 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-10-15 12:58:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:07,692 INFO L225 Difference]: With dead ends: 156 [2018-10-15 12:58:07,692 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 12:58:07,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:58:07,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 12:58:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-15 12:58:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 12:58:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-15 12:58:07,694 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-15 12:58:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:07,694 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-15 12:58:07,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:58:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-15 12:58:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-15 12:58:07,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:07,695 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:07,695 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:07,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1060127911, now seen corresponding path program 47 times [2018-10-15 12:58:07,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:10,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:10,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:58:10,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:58:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:58:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:58:10,193 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 50 states. [2018-10-15 12:58:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:13,686 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 12:58:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:58:13,686 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 153 [2018-10-15 12:58:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:13,687 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:58:13,687 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:58:13,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:58:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:58:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-15 12:58:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 12:58:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 12:58:13,691 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-15 12:58:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:13,691 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 12:58:13,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:58:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 12:58:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:58:13,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:13,692 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:13,692 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:13,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:13,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1480791336, now seen corresponding path program 48 times [2018-10-15 12:58:13,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:16,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:16,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:58:16,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:58:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:58:16,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:58:16,113 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 51 states. [2018-10-15 12:58:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:19,597 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:58:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:58:19,598 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 156 [2018-10-15 12:58:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:19,598 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:58:19,598 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:58:19,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:58:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:58:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-15 12:58:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 12:58:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 12:58:19,602 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-15 12:58:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:19,602 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 12:58:19,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:58:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 12:58:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:58:19,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:19,603 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:19,603 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:19,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:19,604 INFO L82 PathProgramCache]: Analyzing trace with hash -792513287, now seen corresponding path program 49 times [2018-10-15 12:58:19,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:21,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:21,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:58:21,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:58:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:58:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:58:21,456 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 52 states. [2018-10-15 12:58:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:25,057 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-15 12:58:25,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:58:25,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 159 [2018-10-15 12:58:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:25,058 INFO L225 Difference]: With dead ends: 165 [2018-10-15 12:58:25,058 INFO L226 Difference]: Without dead ends: 165 [2018-10-15 12:58:25,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:58:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-15 12:58:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-15 12:58:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:58:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:58:25,062 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-15 12:58:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:25,062 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:58:25,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:58:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:58:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:58:25,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:25,063 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:25,063 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:25,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1766213752, now seen corresponding path program 50 times [2018-10-15 12:58:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 12:58:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 12:58:25,584 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 12:58:25,619 INFO L202 PluginConnector]: Adding new model diamond_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:58:25 BasicIcfg [2018-10-15 12:58:25,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 12:58:25,620 INFO L168 Benchmark]: Toolchain (without parser) took 120707.71 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 304.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 415.0 MB). Peak memory consumption was 719.6 MB. Max. memory is 7.1 GB. [2018-10-15 12:58:25,622 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-10-15 12:58:25,623 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 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-10-15 12:58:25,623 INFO L168 Benchmark]: RCFGBuilder took 394.04 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 12:58:25,624 INFO L168 Benchmark]: IcfgTransformer took 23.24 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-10-15 12:58:25,624 INFO L168 Benchmark]: TraceAbstraction took 120240.28 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 304.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 393.8 MB). Peak memory consumption was 698.4 MB. Max. memory is 7.1 GB. [2018-10-15 12:58:25,627 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.16 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 45.30 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 394.04 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 23.24 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. * TraceAbstraction took 120240.28 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 304.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 393.8 MB). Peak memory consumption was 698.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: assertion can be violated assertion can be violated We found a FailurePath: [L13] havoc main_#res; [L14] havoc main_#t~nondet0, main_~y~0, main_#t~post1, main_~x~0; [L15] main_~x~0 := 0; VAL [main_~x~0=0] [L16] main_~y~0 := main_#t~nondet0; VAL [main_#t~nondet0=3, main_~x~0=0, main_~y~0=3] [L17] havoc main_#t~nondet0; VAL [main_~x~0=0, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=0, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=0, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=2, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=2, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=2, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=4, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=4, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=4, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=6, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=6, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=6, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=8, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=8, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=8, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=10, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=10, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=10, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=12, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=12, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=12, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=14, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=14, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=14, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=16, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=16, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=16, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=18, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=18, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=18, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=20, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=20, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=20, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=22, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=22, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=22, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=24, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=24, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=24, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=26, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=26, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=26, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=28, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=28, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=28, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=30, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=30, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=30, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=32, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=32, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=32, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=34, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=34, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=34, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=36, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=36, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=36, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=38, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=38, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=38, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=40, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=40, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=40, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=42, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=42, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=42, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=44, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=44, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=44, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=46, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=46, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=46, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=48, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=48, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=48, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=50, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=50, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=50, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=52, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=52, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=52, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=54, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=54, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=54, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=56, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=56, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=56, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=58, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=58, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=58, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=60, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=60, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=60, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=62, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=62, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=62, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=64, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=64, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=64, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=66, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=66, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=66, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=68, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=68, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=68, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=70, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=70, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=70, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=72, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=72, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=72, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=74, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=74, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=74, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=76, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=76, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=76, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=78, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=78, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=78, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=80, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=80, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=80, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=82, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=82, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=82, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=84, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=84, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=84, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=86, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=86, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=86, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=88, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=88, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=88, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=90, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=90, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=90, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=92, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=92, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=92, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=94, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=94, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=94, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=96, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=96, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=96, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=98, main_~y~0=3] [L32] assume main_~x~0 % 4294967296 < 99; VAL [main_~x~0=98, main_~y~0=3] [L33] assume !(0 == (if main_~y~0 % 4294967296 < 0 && !(0 == main_~y~0 % 2) then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296); VAL [main_~x~0=98, main_~y~0=3] [L34] main_~x~0 := main_~x~0 + 2; VAL [main_~x~0=100, main_~y~0=3] [L24] assume !(main_~x~0 % 4294967296 < 99); VAL [main_~x~0=100, main_~y~0=3] [L25] assume ((0 == main_~x~0 % 2 || !(main_~x~0 % 4294967296 < 0)) && ((!((main_~y~0 % 2 + 4294967294) % 4294967296 == main_~x~0 % 2) && ((!(main_~y~0 % 2 == main_~x~0 % 2) && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || (main_~y~0 % 2 == main_~x~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)))) || ((main_~y~0 % 2 + 4294967294) % 4294967296 == main_~x~0 % 2 && ((!(main_~y~0 % 2 == main_~x~0 % 2) && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || (main_~y~0 % 2 == main_~x~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)))))) || (((((((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || ((((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2) && !((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2))) && (main_~x~0 % 2 + 4294967294) % 4294967296 == (main_~y~0 % 2 + 4294967294) % 4294967296) || ((((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2 && (((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2)) || ((((!(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0) || !(main_~y~0 % 4294967296 < 0)) || 0 == main_~y~0 % 2) && !((main_~x~0 % 2 + 4294967294) % 4294967296 == main_~y~0 % 2))) && !((main_~x~0 % 2 + 4294967294) % 4294967296 == (main_~y~0 % 2 + 4294967294) % 4294967296))) && main_~x~0 % 4294967296 < 0) && !(0 == main_~x~0 % 2)); VAL [main_~x~0=100, main_~y~0=3] [L26] __VERIFIER_assert_#in~cond := (if (if !(0 == main_~y~0 % 2) && main_~y~0 % 4294967296 < 0 then main_~y~0 % 2 + -2 else main_~y~0 % 2) % 4294967296 == (if main_~x~0 % 4294967296 < 0 && !(0 == main_~x~0 % 2) then main_~x~0 % 2 + -2 else main_~x~0 % 2) % 4294967296 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~x~0=100, main_~y~0=3] [L27] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~x~0=100, main_~y~0=3] [L28] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=100, main_~y~0=3] [L29] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=100, main_~y~0=3] [L37] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=100, main_~y~0=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 120.1s OverallTime, 51 OverallIterations, 50 TraceHistogramMax, 70.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1875 SDtfs, 100 SDslu, 50476 SDs, 0 SdLazy, 92226 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 57.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 100 SyntacticMatches, 50 SemanticMatches, 1275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=50, 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, 50 MinimizatonAttempts, 100 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 4437 NumberOfCodeBlocks, 4437 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4225 ConstructedInterpolants, 0 QuantifiedInterpolants, 2952275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 1 PerfectInterpolantSequences, 0/60025 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_false-unreach-call1.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_12-58-25-638.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_false-unreach-call1.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_12-58-25-638.csv Received shutdown request...