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/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:42:40,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:42:40,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:42:40,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:42:40,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:42:40,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:42:40,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:42:40,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:42:40,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:42:40,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:42:40,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:42:40,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:42:40,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:42:40,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:42:40,577 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:42:40,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:42:40,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:42:40,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:42:40,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:42:40,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:42:40,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:42:40,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:42:40,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:42:40,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:42:40,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:42:40,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:42:40,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:42:40,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:42:40,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:42:40,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:42:40,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:42:40,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:42:40,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:42:40,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:42:40,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:42:40,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:42:40,610 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 10:42:40,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:42:40,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:42:40,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:42:40,641 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:42:40,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:42:40,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:42:40,642 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:42:40,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:42:40,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:42:40,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:42:40,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:42:40,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:42:40,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:42:40,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:42:40,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:42:40,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:42:40,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:42:40,645 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:42:40,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:42:40,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:42:40,646 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:42:40,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:42:40,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:40,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:42:40,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:42:40,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:42:40,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:42:40,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:42:40,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:42:40,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:42:40,649 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:42:40,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:42:40,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:42:40,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:42:40,728 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:42:40,729 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:42:40,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-30 10:42:40,730 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-30 10:42:40,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:42:40,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:42:40,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:40,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:42:40,820 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:42:40,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,862 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:42:40,862 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:42:40,862 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:42:40,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:40,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:42:40,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:42:40,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:42:40,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:40,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:42:40,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:42:40,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:42:40,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:42:40,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:40,998 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:42:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:42:40,999 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:42:41,938 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:42:41,938 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:41 BoogieIcfgContainer [2018-09-30 10:42:41,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:42:41,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:42:41,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:42:41,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:42:41,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/2) ... [2018-09-30 10:42:41,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f0022 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:42:41, skipping insertion in model container [2018-09-30 10:42:41,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:41" (2/2) ... [2018-09-30 10:42:41,947 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-30 10:42:41,958 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:42:41,967 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 10:42:42,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:42:42,024 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:42:42,024 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:42:42,024 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:42:42,024 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:42:42,025 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:42:42,025 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:42:42,025 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:42:42,025 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:42:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 10:42:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:42:42,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:42,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:42,060 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:42,069 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 10:42:42,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:42,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:42,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:42,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:42,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:42,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:42:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:42:42,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:42,341 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 10:42:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:45,760 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 10:42:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:42:45,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:42:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:45,781 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:42:45,781 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:42:45,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:42:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 10:42:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:42:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 10:42:45,848 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 10:42:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:45,849 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 10:42:45,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:42:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 10:42:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:42:45,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:45,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:45,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:45,852 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:45,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 10:42:45,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:45,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:45,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:45,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:45,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:42:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:42:45,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:45,935 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 10:42:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:48,423 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 10:42:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:42:48,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:42:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:48,426 INFO L225 Difference]: With dead ends: 188 [2018-09-30 10:42:48,427 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 10:42:48,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 10:42:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 10:42:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 10:42:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 10:42:48,450 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 10:42:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:48,451 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 10:42:48,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:42:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 10:42:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:42:48,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:48,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:48,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:48,453 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 10:42:48,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:48,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:48,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:48,569 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:48,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:42:48,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:48,571 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:48,571 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 10:42:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:52,601 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-30 10:42:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:42:52,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:42:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:52,606 INFO L225 Difference]: With dead ends: 361 [2018-09-30 10:42:52,606 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 10:42:52,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 10:42:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-30 10:42:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-30 10:42:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-30 10:42:52,647 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-30 10:42:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:52,647 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-30 10:42:52,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-30 10:42:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:42:52,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:52,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:52,649 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:52,650 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 10:42:52,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:52,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:52,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:52,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:52,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:53,073 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:53,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:42:53,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:53,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:53,074 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-30 10:42:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:56,338 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-30 10:42:56,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:42:56,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:42:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:56,344 INFO L225 Difference]: With dead ends: 307 [2018-09-30 10:42:56,344 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 10:42:56,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 10:42:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-30 10:42:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 10:42:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 10:42:56,393 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 10:42:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:56,394 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 10:42:56,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 10:42:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:42:56,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:56,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:56,398 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:56,398 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 10:42:56,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:56,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:56,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:56,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:56,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:42:56,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:42:56,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:42:56,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:56,527 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-30 10:43:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:04,563 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-30 10:43:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:43:04,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:04,571 INFO L225 Difference]: With dead ends: 741 [2018-09-30 10:43:04,571 INFO L226 Difference]: Without dead ends: 733 [2018-09-30 10:43:04,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-30 10:43:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-30 10:43:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-30 10:43:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-30 10:43:04,631 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-30 10:43:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:04,632 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-30 10:43:04,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-30 10:43:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:04,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:04,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:04,635 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:04,635 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 10:43:04,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:04,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:04,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:04,748 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:04,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:04,749 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:04,749 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-30 10:43:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:18,606 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-30 10:43:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:43:18,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:18,613 INFO L225 Difference]: With dead ends: 797 [2018-09-30 10:43:18,613 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 10:43:18,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 10:43:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-30 10:43:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-30 10:43:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-30 10:43:18,674 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-30 10:43:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:18,674 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-30 10:43:18,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-30 10:43:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:18,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:18,676 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:18,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:18,677 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 10:43:18,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:18,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:18,892 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:18,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:18,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:18,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:18,894 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-30 10:43:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:25,492 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-30 10:43:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:43:25,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:25,498 INFO L225 Difference]: With dead ends: 684 [2018-09-30 10:43:25,498 INFO L226 Difference]: Without dead ends: 676 [2018-09-30 10:43:25,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-30 10:43:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-30 10:43:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-30 10:43:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-30 10:43:25,563 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-30 10:43:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:25,563 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-30 10:43:25,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-30 10:43:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:25,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:25,565 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:25,565 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:25,565 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 10:43:25,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:25,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:25,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:25,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:25,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:25,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:25,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:25,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:25,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:25,822 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-30 10:43:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:30,843 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-30 10:43:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:43:30,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:30,849 INFO L225 Difference]: With dead ends: 605 [2018-09-30 10:43:30,849 INFO L226 Difference]: Without dead ends: 597 [2018-09-30 10:43:30,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-30 10:43:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-30 10:43:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-30 10:43:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-30 10:43:30,927 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-30 10:43:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:30,927 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-30 10:43:30,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-30 10:43:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:30,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:30,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:30,929 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:30,929 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-30 10:43:30,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:30,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:31,032 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:31,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:31,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:31,033 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:31,034 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-30 10:43:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:38,337 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-30 10:43:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:43:38,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:38,345 INFO L225 Difference]: With dead ends: 935 [2018-09-30 10:43:38,346 INFO L226 Difference]: Without dead ends: 927 [2018-09-30 10:43:38,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-30 10:43:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-30 10:43:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-30 10:43:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-30 10:43:38,444 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-30 10:43:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:38,445 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-30 10:43:38,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-30 10:43:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:38,446 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:38,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:38,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:38,447 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-30 10:43:38,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:38,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:38,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:39,212 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:39,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:39,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:39,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:39,214 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-30 10:43:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:46,723 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-30 10:43:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:43:46,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:46,729 INFO L225 Difference]: With dead ends: 923 [2018-09-30 10:43:46,730 INFO L226 Difference]: Without dead ends: 915 [2018-09-30 10:43:46,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-30 10:43:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-30 10:43:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 10:43:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-30 10:43:46,828 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-30 10:43:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:46,829 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-30 10:43:46,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-30 10:43:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:46,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:46,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:46,831 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:46,831 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-30 10:43:46,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:46,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:46,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:46,924 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:46,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:46,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:46,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:46,925 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-30 10:43:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:52,436 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-30 10:43:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:43:52,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:43:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:52,441 INFO L225 Difference]: With dead ends: 837 [2018-09-30 10:43:52,441 INFO L226 Difference]: Without dead ends: 829 [2018-09-30 10:43:52,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-30 10:43:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-30 10:43:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-30 10:43:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-30 10:43:52,546 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-30 10:43:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:52,546 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-30 10:43:52,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-30 10:43:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:52,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:52,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:52,548 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:52,548 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:52,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-30 10:43:52,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:52,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:52,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:52,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:52,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:52,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:52,638 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:52,638 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-30 10:44:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:01,048 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-30 10:44:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:44:01,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:01,054 INFO L225 Difference]: With dead ends: 996 [2018-09-30 10:44:01,055 INFO L226 Difference]: Without dead ends: 988 [2018-09-30 10:44:01,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-30 10:44:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-30 10:44:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 10:44:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 10:44:01,207 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 10:44:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:01,208 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 10:44:01,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 10:44:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:01,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:01,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:01,210 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:01,210 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-30 10:44:01,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:01,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:01,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:01,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:01,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:01,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:01,413 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:01,413 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 10:44:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:08,559 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-30 10:44:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:44:08,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:08,566 INFO L225 Difference]: With dead ends: 913 [2018-09-30 10:44:08,566 INFO L226 Difference]: Without dead ends: 905 [2018-09-30 10:44:08,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-30 10:44:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-30 10:44:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-30 10:44:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-30 10:44:08,707 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-30 10:44:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:08,707 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-30 10:44:08,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-30 10:44:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:08,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:08,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:08,709 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:08,709 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-30 10:44:08,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:08,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:08,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:08,790 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:08,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:08,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:08,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:08,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:08,791 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-30 10:44:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:14,873 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-30 10:44:14,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:44:14,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:14,877 INFO L225 Difference]: With dead ends: 886 [2018-09-30 10:44:14,877 INFO L226 Difference]: Without dead ends: 878 [2018-09-30 10:44:14,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-30 10:44:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-30 10:44:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-30 10:44:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-30 10:44:15,014 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-30 10:44:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:15,014 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-30 10:44:15,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-30 10:44:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:15,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:15,015 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:15,015 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:15,016 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 10:44:15,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:15,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:15,114 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:15,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:15,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:15,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:15,115 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-30 10:44:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:21,186 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-30 10:44:21,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:44:21,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:21,190 INFO L225 Difference]: With dead ends: 801 [2018-09-30 10:44:21,190 INFO L226 Difference]: Without dead ends: 793 [2018-09-30 10:44:21,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-30 10:44:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-30 10:44:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-30 10:44:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-30 10:44:21,342 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-30 10:44:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:21,343 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-30 10:44:21,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-30 10:44:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:21,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:21,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:21,344 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:21,344 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-30 10:44:21,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:21,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:21,440 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:21,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:21,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:21,441 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:21,441 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-30 10:44:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:29,533 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-30 10:44:29,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:44:29,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:29,539 INFO L225 Difference]: With dead ends: 962 [2018-09-30 10:44:29,539 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 10:44:29,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 10:44:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-30 10:44:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-30 10:44:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-30 10:44:29,698 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-30 10:44:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:29,698 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-30 10:44:29,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-30 10:44:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:29,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:29,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:29,700 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:29,700 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 10:44:29,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:29,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:29,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:29,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:29,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:29,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:29,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:29,841 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-30 10:44:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:37,808 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-30 10:44:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:44:37,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:37,815 INFO L225 Difference]: With dead ends: 1000 [2018-09-30 10:44:37,815 INFO L226 Difference]: Without dead ends: 992 [2018-09-30 10:44:37,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-30 10:44:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-30 10:44:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-30 10:44:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-30 10:44:37,998 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-30 10:44:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:37,999 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-30 10:44:37,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-30 10:44:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:37,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:37,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:38,000 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:38,000 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-30 10:44:38,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:38,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:38,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:38,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:38,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:38,089 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:38,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:38,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:38,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:38,091 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-30 10:44:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:47,211 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-30 10:44:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:44:47,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:47,217 INFO L225 Difference]: With dead ends: 1065 [2018-09-30 10:44:47,217 INFO L226 Difference]: Without dead ends: 1057 [2018-09-30 10:44:47,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-30 10:44:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-30 10:44:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-30 10:44:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-30 10:44:47,443 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-30 10:44:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:47,444 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-30 10:44:47,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-30 10:44:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:47,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:47,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:47,445 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:47,445 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-30 10:44:47,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:47,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:47,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:47,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:47,554 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:47,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:47,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:47,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:47,555 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-30 10:44:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:57,727 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-30 10:44:57,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:44:57,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:57,736 INFO L225 Difference]: With dead ends: 1227 [2018-09-30 10:44:57,736 INFO L226 Difference]: Without dead ends: 1219 [2018-09-30 10:44:57,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-30 10:44:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-30 10:44:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-30 10:44:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-30 10:44:57,968 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-30 10:44:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:57,968 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-30 10:44:57,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-30 10:44:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:57,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:57,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:57,969 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:57,970 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 10:44:57,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:57,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:57,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:57,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:58,068 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:58,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:58,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:58,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:58,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:58,070 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-30 10:45:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:06,948 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-30 10:45:06,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:45:06,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:45:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:06,953 INFO L225 Difference]: With dead ends: 1076 [2018-09-30 10:45:06,954 INFO L226 Difference]: Without dead ends: 1068 [2018-09-30 10:45:06,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-30 10:45:07,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-30 10:45:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 10:45:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-30 10:45:07,214 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-30 10:45:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:07,214 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-30 10:45:07,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:45:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-30 10:45:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:07,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:07,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:07,215 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:07,216 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-30 10:45:07,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:07,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:07,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:07,295 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:07,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:07,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:45:07,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:45:07,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:07,296 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-30 10:45:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:14,811 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-30 10:45:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:45:14,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:45:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:14,817 INFO L225 Difference]: With dead ends: 1111 [2018-09-30 10:45:14,817 INFO L226 Difference]: Without dead ends: 1103 [2018-09-30 10:45:14,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-30 10:45:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-30 10:45:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-30 10:45:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-30 10:45:15,160 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-30 10:45:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:15,160 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-30 10:45:15,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:45:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-30 10:45:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:15,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:15,161 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:15,161 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:15,161 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-30 10:45:15,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:15,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:15,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:15,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:15,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:15,491 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:15,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:15,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:45:15,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:45:15,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:15,492 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-30 10:45:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:25,732 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-30 10:45:25,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:45:25,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:45:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:25,740 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 10:45:25,740 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 10:45:25,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 10:45:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-30 10:45:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-30 10:45:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-30 10:45:26,086 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-30 10:45:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:26,086 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-30 10:45:26,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:45:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-30 10:45:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:26,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:26,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:26,088 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:26,088 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:26,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-30 10:45:26,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:26,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:26,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:26,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:26,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:26,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:45:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:45:26,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:26,204 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-30 10:45:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:37,647 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-30 10:45:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:45:37,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:45:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:37,655 INFO L225 Difference]: With dead ends: 1370 [2018-09-30 10:45:37,655 INFO L226 Difference]: Without dead ends: 1362 [2018-09-30 10:45:37,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-30 10:45:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-30 10:45:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-30 10:45:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-30 10:45:38,012 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-30 10:45:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:38,013 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-30 10:45:38,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:45:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-30 10:45:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:38,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:38,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:38,014 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:38,014 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 10:45:38,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:38,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:38,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:38,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:38,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:38,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:38,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:38,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:45:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:45:38,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:38,114 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-30 10:45:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:45,119 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-30 10:45:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:45:45,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:45:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:45,124 INFO L225 Difference]: With dead ends: 1298 [2018-09-30 10:45:45,124 INFO L226 Difference]: Without dead ends: 1290 [2018-09-30 10:45:45,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-30 10:45:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-30 10:45:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 10:45:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 10:45:45,614 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 10:45:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:45,614 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 10:45:45,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:45:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 10:45:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:45:45,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:45,615 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:45,615 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:45,616 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:45,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-30 10:45:45,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:45,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:45,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:45,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:45,668 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:45,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:45:45,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:45:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:45:45,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:45,669 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 10:45:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:46,794 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-30 10:45:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:45:46,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:45:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:46,797 INFO L225 Difference]: With dead ends: 1242 [2018-09-30 10:45:46,797 INFO L226 Difference]: Without dead ends: 673 [2018-09-30 10:45:46,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-30 10:45:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-30 10:45:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-30 10:45:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-30 10:45:47,267 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-30 10:45:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:47,267 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-30 10:45:47,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:45:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-30 10:45:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:45:47,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:47,268 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:47,268 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:47,268 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-30 10:45:47,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:47,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:47,372 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:47,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:45:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:47,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:48,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:48,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 10:45:48,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:45:48,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:45:48,626 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:48,626 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-30 10:45:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:57,033 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-30 10:45:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:45:57,034 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 10:45:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:57,036 INFO L225 Difference]: With dead ends: 854 [2018-09-30 10:45:57,036 INFO L226 Difference]: Without dead ends: 849 [2018-09-30 10:45:57,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-30 10:45:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-30 10:45:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 10:45:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-30 10:45:57,729 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-30 10:45:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:57,729 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-30 10:45:57,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:45:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-30 10:45:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:45:57,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:57,730 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:57,731 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:57,731 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-30 10:45:57,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:57,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:57,933 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:57,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:45:57,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:45:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:45:57,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:57,934 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-30 10:46:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:00,023 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-30 10:46:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:46:00,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:46:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:00,026 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 10:46:00,026 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 10:46:00,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 10:46:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-30 10:46:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 10:46:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 10:46:01,096 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 10:46:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:01,096 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 10:46:01,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:46:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 10:46:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:01,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:01,098 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:01,098 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:01,098 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-30 10:46:01,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:01,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:01,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:01,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:46:01,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:01,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:02,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:02,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:46:02,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:46:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:46:02,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:02,803 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. Received shutdown request... [2018-09-30 10:46:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-30 10:46:44,120 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:46:44,126 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:46:44,126 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:46:44 BoogieIcfgContainer [2018-09-30 10:46:44,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:46:44,127 INFO L168 Benchmark]: Toolchain (without parser) took 243310.81 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -93.8 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 118.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:44,130 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-09-30 10:46:44,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.88 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-09-30 10:46:44,133 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 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-09-30 10:46:44,135 INFO L168 Benchmark]: RCFGBuilder took 1037.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:44,136 INFO L168 Benchmark]: TraceAbstraction took 242186.93 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -93.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 86.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:44,141 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.22 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 Procedure Inliner took 44.88 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 35.79 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 1037.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242186.93 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -93.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 86.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (690states) and FLOYD_HOARE automaton (currently 117 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (1047 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 242.1s OverallTime, 28 OverallIterations, 2 TraceHistogramMax, 228.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7866 SDtfs, 21083 SDslu, 22924 SDs, 0 SdLazy, 47770 SolverSat, 4783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 680 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=26, 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: 6.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 11879 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 326 ConstructedInterpolants, 14 QuantifiedInterpolants, 17016 SizeOfPredicates, 12 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 12/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-46-44-160.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-46-44-160.csv Completed graceful shutdown