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.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:35:24,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:35:24,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:35:24,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:35:24,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:35:24,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:35:24,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:35:24,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:35:24,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:35:24,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:35:24,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:35:24,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:35:24,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:35:24,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:35:24,948 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:35:24,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:35:24,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:35:24,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:35:24,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:35:24,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:35:24,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:35:24,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:35:24,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:35:24,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:35:24,960 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:35:24,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:35:24,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:35:24,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:35:24,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:35:24,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:35:24,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:35:24,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:35:24,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:35:24,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:35:24,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:35:24,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:35:24,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:35:24,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:35:24,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:35:24,989 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:35:24,989 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:35:24,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:35:24,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:35:24,991 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:35:24,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:35:24,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:35:24,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:35:24,993 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:35:24,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:35:24,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:35:24,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:35:24,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:35:24,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:35:24,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:35:24,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:35:24,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:35:24,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:35:24,996 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:35:24,996 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:35:24,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:24,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:35:24,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:35:24,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:35:24,996 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:35:24,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:35:24,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:35:24,997 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:35:25,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:35:25,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:35:25,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:35:25,067 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:35:25,068 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:35:25,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-10-02 11:35:25,069 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-10-02 11:35:25,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:35:25,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:35:25,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:25,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:35:25,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:35:25,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,176 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:35:25,177 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:35:25,177 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:35:25,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:25,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:35:25,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:35:25,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:35:25,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/1) ... [2018-10-02 11:35:25,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:35:25,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:35:25,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:35:25,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:35:25,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (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-10-02 11:35:25,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 11:35:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 11:35:25,284 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 11:35:25,617 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:35:25,618 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:25 BoogieIcfgContainer [2018-10-02 11:35:25,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:35:25,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:35:25,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:35:25,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:35:25,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:25" (1/2) ... [2018-10-02 11:35:25,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9eb6b7 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:25, skipping insertion in model container [2018-10-02 11:35:25,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:25" (2/2) ... [2018-10-02 11:35:25,644 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-10-02 11:35:25,661 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:35:25,676 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-02 11:35:25,752 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:35:25,753 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:35:25,753 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:35:25,754 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:35:25,754 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:35:25,754 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:35:25,754 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:35:25,754 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:35:25,755 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:35:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-02 11:35:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:35:25,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:25,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 11:35:25,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:25,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-10-02 11:35:25,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:25,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:26,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:26,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:26,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:26,036 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-10-02 11:35:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:26,582 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-10-02 11:35:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:35:26,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-02 11:35:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:26,598 INFO L225 Difference]: With dead ends: 32 [2018-10-02 11:35:26,598 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 11:35:26,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 11:35:26,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-10-02 11:35:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-02 11:35:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-02 11:35:26,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-10-02 11:35:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:26,644 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-02 11:35:26,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-02 11:35:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:35:26,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:26,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 11:35:26,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:26,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-10-02 11:35:26,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:26,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:26,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:26,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:26,723 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-10-02 11:35:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:27,066 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-10-02 11:35:27,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:35:27,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-02 11:35:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:27,068 INFO L225 Difference]: With dead ends: 38 [2018-10-02 11:35:27,069 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 11:35:27,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 11:35:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-10-02 11:35:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 11:35:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-10-02 11:35:27,078 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-10-02 11:35:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:27,079 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-10-02 11:35:27,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-10-02 11:35:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:27,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:27,080 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:27,081 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:27,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-10-02 11:35:27,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:27,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:27,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:27,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:27,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:27,175 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-10-02 11:35:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:27,866 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-10-02 11:35:27,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:35:27,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-02 11:35:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:27,868 INFO L225 Difference]: With dead ends: 43 [2018-10-02 11:35:27,869 INFO L226 Difference]: Without dead ends: 41 [2018-10-02 11:35:27,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:35:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-02 11:35:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-02 11:35:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:35:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-10-02 11:35:27,884 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-10-02 11:35:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:27,885 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-10-02 11:35:27,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-10-02 11:35:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:27,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:27,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:27,888 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:27,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-10-02 11:35:27,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:27,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:28,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:28,002 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-10-02 11:35:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:28,304 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-10-02 11:35:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:35:28,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-02 11:35:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:28,309 INFO L225 Difference]: With dead ends: 54 [2018-10-02 11:35:28,309 INFO L226 Difference]: Without dead ends: 52 [2018-10-02 11:35:28,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-02 11:35:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-10-02 11:35:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 11:35:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-10-02 11:35:28,322 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-10-02 11:35:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:28,323 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-10-02 11:35:28,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-10-02 11:35:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:28,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:28,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:28,325 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:28,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-10-02 11:35:28,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:28,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:28,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:28,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:28,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:28,516 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-10-02 11:35:28,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:28,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:28,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:35:28,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:28,800 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-10-02 11:35:29,635 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-10-02 11:35:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:30,025 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-10-02 11:35:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:35:30,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-10-02 11:35:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:30,029 INFO L225 Difference]: With dead ends: 107 [2018-10-02 11:35:30,029 INFO L226 Difference]: Without dead ends: 106 [2018-10-02 11:35:30,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-02 11:35:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-10-02 11:35:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-02 11:35:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-10-02 11:35:30,044 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-10-02 11:35:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:30,045 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-10-02 11:35:30,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-10-02 11:35:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:30,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:30,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:30,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:30,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-10-02 11:35:30,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:30,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:30,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:30,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:30,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:30,192 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-10-02 11:35:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:30,546 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-10-02 11:35:30,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:30,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:30,548 INFO L225 Difference]: With dead ends: 95 [2018-10-02 11:35:30,549 INFO L226 Difference]: Without dead ends: 93 [2018-10-02 11:35:30,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:35:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-02 11:35:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-02 11:35:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-02 11:35:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-10-02 11:35:30,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-10-02 11:35:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:30,573 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-10-02 11:35:30,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-10-02 11:35:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:30,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:30,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:30,577 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:30,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-10-02 11:35:30,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:30,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:30,663 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-10-02 11:35:30,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 11:35:30,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:30,859 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-10-02 11:35:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:32,830 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-10-02 11:35:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:35:32,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-02 11:35:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:32,837 INFO L225 Difference]: With dead ends: 150 [2018-10-02 11:35:32,837 INFO L226 Difference]: Without dead ends: 148 [2018-10-02 11:35:32,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:35:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-02 11:35:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-10-02 11:35:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-02 11:35:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-10-02 11:35:32,881 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-10-02 11:35:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:32,881 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-10-02 11:35:32,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-10-02 11:35:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:32,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:32,883 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:32,883 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:32,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-10-02 11:35:32,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:32,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:32,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:32,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:32,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:32,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-02 11:35:33,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:33,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:33,212 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-10-02 11:35:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:34,062 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-10-02 11:35:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:34,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-02 11:35:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:34,064 INFO L225 Difference]: With dead ends: 137 [2018-10-02 11:35:34,064 INFO L226 Difference]: Without dead ends: 135 [2018-10-02 11:35:34,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-02 11:35:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-10-02 11:35:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-02 11:35:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-10-02 11:35:34,089 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-10-02 11:35:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:34,089 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-10-02 11:35:34,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-10-02 11:35:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:34,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:34,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:34,091 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:34,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-10-02 11:35:34,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:34,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:34,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:34,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:34,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:34,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:34,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:34,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-10-02 11:35:34,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:35:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:35:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:34,518 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-10-02 11:35:34,886 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-10-02 11:35:35,453 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-02 11:35:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:36,521 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-10-02 11:35:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:36,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-10-02 11:35:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:36,523 INFO L225 Difference]: With dead ends: 211 [2018-10-02 11:35:36,523 INFO L226 Difference]: Without dead ends: 209 [2018-10-02 11:35:36,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:35:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-02 11:35:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-10-02 11:35:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-02 11:35:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-10-02 11:35:36,557 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-10-02 11:35:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:36,557 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-10-02 11:35:36,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:35:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-10-02 11:35:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:36,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:36,558 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:36,559 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:36,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-10-02 11:35:36,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:36,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:36,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:36,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:36,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:36,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:36,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:36,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:36,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 11:35:36,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:35:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:35:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:36,760 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 10 states. [2018-10-02 11:35:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:37,645 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-10-02 11:35:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:37,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-02 11:35:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:37,649 INFO L225 Difference]: With dead ends: 246 [2018-10-02 11:35:37,649 INFO L226 Difference]: Without dead ends: 245 [2018-10-02 11:35:37,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-02 11:35:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-10-02 11:35:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-02 11:35:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-10-02 11:35:37,684 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-10-02 11:35:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:37,685 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-10-02 11:35:37,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:35:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-10-02 11:35:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:37,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:37,686 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:37,686 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:37,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-10-02 11:35:37,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:37,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:37,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:37,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:37,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:37,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:37,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 11:35:37,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:37,829 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-10-02 11:35:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:38,411 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-10-02 11:35:38,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:35:38,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:38,413 INFO L225 Difference]: With dead ends: 252 [2018-10-02 11:35:38,414 INFO L226 Difference]: Without dead ends: 250 [2018-10-02 11:35:38,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-02 11:35:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-10-02 11:35:38,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-02 11:35:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-10-02 11:35:38,451 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-10-02 11:35:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:38,451 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-10-02 11:35:38,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-10-02 11:35:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:38,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:38,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:38,453 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:38,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-10-02 11:35:38,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:38,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:38,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:38,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:38,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:38,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:38,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:38,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:38,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 11:35:38,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:35:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:35:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:38,650 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-10-02 11:35:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:39,015 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-10-02 11:35:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:39,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-02 11:35:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:39,018 INFO L225 Difference]: With dead ends: 260 [2018-10-02 11:35:39,019 INFO L226 Difference]: Without dead ends: 259 [2018-10-02 11:35:39,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-02 11:35:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-10-02 11:35:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-02 11:35:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-10-02 11:35:39,055 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-10-02 11:35:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:39,055 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-10-02 11:35:39,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:35:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-10-02 11:35:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:39,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:39,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:39,057 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:39,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-10-02 11:35:39,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:39,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:39,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:39,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:39,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:39,144 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-10-02 11:35:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:39,787 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-10-02 11:35:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:39,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:39,790 INFO L225 Difference]: With dead ends: 316 [2018-10-02 11:35:39,790 INFO L226 Difference]: Without dead ends: 314 [2018-10-02 11:35:39,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:35:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-02 11:35:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-02 11:35:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-02 11:35:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-10-02 11:35:39,835 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-10-02 11:35:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:39,835 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-10-02 11:35:39,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-10-02 11:35:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:39,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:39,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:39,837 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:39,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-10-02 11:35:39,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:39,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:39,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:39,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:39,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:39,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:39,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:39,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 11:35:39,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:39,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:39,973 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-10-02 11:35:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:40,370 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-10-02 11:35:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:35:40,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:40,374 INFO L225 Difference]: With dead ends: 428 [2018-10-02 11:35:40,374 INFO L226 Difference]: Without dead ends: 426 [2018-10-02 11:35:40,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-02 11:35:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-10-02 11:35:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-02 11:35:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-10-02 11:35:40,440 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-10-02 11:35:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:40,440 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-10-02 11:35:40,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-10-02 11:35:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:40,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:40,441 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:40,442 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:40,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-10-02 11:35:40,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:40,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:40,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:40,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:40,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:40,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:40,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:40,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-02 11:35:40,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:35:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:35:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:40,634 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-10-02 11:35:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:41,870 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-10-02 11:35:41,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:41,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-02 11:35:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:41,874 INFO L225 Difference]: With dead ends: 466 [2018-10-02 11:35:41,874 INFO L226 Difference]: Without dead ends: 464 [2018-10-02 11:35:41,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:35:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-02 11:35:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-10-02 11:35:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-02 11:35:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-10-02 11:35:41,962 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-10-02 11:35:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:41,962 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-10-02 11:35:41,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:35:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-10-02 11:35:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:41,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:41,963 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:41,964 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:41,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:41,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-10-02 11:35:41,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:41,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:41,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:41,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:42,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:42,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:42,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:42,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:42,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-10-02 11:35:42,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:42,785 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-10-02 11:35:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:45,146 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-10-02 11:35:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 11:35:45,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-10-02 11:35:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:45,149 INFO L225 Difference]: With dead ends: 859 [2018-10-02 11:35:45,149 INFO L226 Difference]: Without dead ends: 509 [2018-10-02 11:35:45,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=375, Invalid=1881, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:35:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-02 11:35:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-10-02 11:35:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-02 11:35:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-10-02 11:35:45,240 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-10-02 11:35:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:45,241 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-10-02 11:35:45,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-10-02 11:35:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:45,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:45,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:45,242 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:45,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-10-02 11:35:45,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:45,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:45,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:45,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:45,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:45,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:45,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:45,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:45,507 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-10-02 11:35:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:46,075 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-10-02 11:35:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:35:46,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-02 11:35:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:46,077 INFO L225 Difference]: With dead ends: 481 [2018-10-02 11:35:46,077 INFO L226 Difference]: Without dead ends: 479 [2018-10-02 11:35:46,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:35:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-02 11:35:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-10-02 11:35:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-02 11:35:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-10-02 11:35:46,161 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-10-02 11:35:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:46,161 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-10-02 11:35:46,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-10-02 11:35:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:46,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:46,162 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:46,163 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:46,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:46,163 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-10-02 11:35:46,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:46,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:46,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:46,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:46,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:46,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:46,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:46,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:46,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:46,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:46,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-02 11:35:46,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:46,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:46,387 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-10-02 11:35:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:47,531 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-10-02 11:35:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:35:47,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-02 11:35:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:47,535 INFO L225 Difference]: With dead ends: 952 [2018-10-02 11:35:47,535 INFO L226 Difference]: Without dead ends: 559 [2018-10-02 11:35:47,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-02 11:35:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-10-02 11:35:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-02 11:35:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-10-02 11:35:47,613 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-10-02 11:35:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:47,613 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-10-02 11:35:47,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-10-02 11:35:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:47,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:47,614 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:47,614 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:47,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-10-02 11:35:47,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:47,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:47,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:47,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:47,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:47,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:47,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:47,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:47,768 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-10-02 11:35:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:48,274 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-10-02 11:35:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:48,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-02 11:35:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:48,283 INFO L225 Difference]: With dead ends: 524 [2018-10-02 11:35:48,283 INFO L226 Difference]: Without dead ends: 522 [2018-10-02 11:35:48,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:35:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-02 11:35:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-10-02 11:35:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-02 11:35:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-10-02 11:35:48,393 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-10-02 11:35:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:48,393 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-10-02 11:35:48,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-10-02 11:35:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:48,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:48,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:48,395 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:48,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-10-02 11:35:48,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:48,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:48,897 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:48,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:48,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:49,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:49,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-02 11:35:49,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:49,285 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-10-02 11:35:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:50,420 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-10-02 11:35:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:50,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-02 11:35:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:50,424 INFO L225 Difference]: With dead ends: 556 [2018-10-02 11:35:50,424 INFO L226 Difference]: Without dead ends: 554 [2018-10-02 11:35:50,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-02 11:35:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-10-02 11:35:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-02 11:35:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-10-02 11:35:50,530 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-10-02 11:35:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:50,530 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-10-02 11:35:50,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-10-02 11:35:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:50,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:50,531 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:50,531 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:50,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-10-02 11:35:50,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:50,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:50,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:50,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:50,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:50,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:50,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:50,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-10-02 11:35:50,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:50,800 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-10-02 11:35:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:51,878 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-10-02 11:35:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:51,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-02 11:35:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:51,881 INFO L225 Difference]: With dead ends: 631 [2018-10-02 11:35:51,881 INFO L226 Difference]: Without dead ends: 629 [2018-10-02 11:35:51,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:35:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-02 11:35:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-10-02 11:35:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-02 11:35:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-10-02 11:35:51,995 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-10-02 11:35:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:51,995 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-10-02 11:35:51,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-10-02 11:35:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:51,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:51,996 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:51,996 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:51,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-10-02 11:35:51,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:52,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:52,091 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:52,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:35:52,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:35:52,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:35:52,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:52,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:52,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:35:52,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:52,132 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-10-02 11:35:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:52,672 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-10-02 11:35:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:52,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 11:35:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:52,676 INFO L225 Difference]: With dead ends: 601 [2018-10-02 11:35:52,676 INFO L226 Difference]: Without dead ends: 599 [2018-10-02 11:35:52,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-02 11:35:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-10-02 11:35:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-02 11:35:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-10-02 11:35:52,807 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-10-02 11:35:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:52,807 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-10-02 11:35:52,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-10-02 11:35:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:52,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:52,808 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:52,808 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:52,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-10-02 11:35:52,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:52,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:35:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:53,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:53,026 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:53,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:53,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:53,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:35:53,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:53,077 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-10-02 11:35:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:53,592 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-10-02 11:35:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:35:53,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 11:35:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:53,594 INFO L225 Difference]: With dead ends: 624 [2018-10-02 11:35:53,595 INFO L226 Difference]: Without dead ends: 622 [2018-10-02 11:35:53,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-02 11:35:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-10-02 11:35:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-10-02 11:35:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-10-02 11:35:53,690 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-10-02 11:35:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:53,690 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-10-02 11:35:53,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-10-02 11:35:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:53,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:53,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:53,691 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:53,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-10-02 11:35:53,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:53,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:53,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:53,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:53,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:53,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:53,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:53,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:53,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:53,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:35:53,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:53,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:53,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:53,809 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-10-02 11:35:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:54,248 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-10-02 11:35:54,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:35:54,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 11:35:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:54,251 INFO L225 Difference]: With dead ends: 584 [2018-10-02 11:35:54,251 INFO L226 Difference]: Without dead ends: 582 [2018-10-02 11:35:54,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-02 11:35:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-10-02 11:35:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-02 11:35:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-10-02 11:35:54,340 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-10-02 11:35:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:54,340 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-10-02 11:35:54,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-10-02 11:35:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:54,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:54,341 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:54,341 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:54,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-10-02 11:35:54,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:54,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:54,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:54,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:54,442 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:54,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:54,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:35:54,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:54,482 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-10-02 11:35:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:54,910 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-10-02 11:35:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:54,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 11:35:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:54,913 INFO L225 Difference]: With dead ends: 618 [2018-10-02 11:35:54,913 INFO L226 Difference]: Without dead ends: 616 [2018-10-02 11:35:54,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-10-02 11:35:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-10-02 11:35:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-02 11:35:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-10-02 11:35:55,020 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-10-02 11:35:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:55,020 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-10-02 11:35:55,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-10-02 11:35:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:55,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:55,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:55,022 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:55,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-10-02 11:35:55,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:55,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:55,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:55,081 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:55,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:35:55,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:55,118 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-10-02 11:35:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:55,538 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-10-02 11:35:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:55,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-02 11:35:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:55,540 INFO L225 Difference]: With dead ends: 613 [2018-10-02 11:35:55,541 INFO L226 Difference]: Without dead ends: 611 [2018-10-02 11:35:55,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-02 11:35:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-10-02 11:35:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-02 11:35:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-10-02 11:35:55,637 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-10-02 11:35:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:55,637 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-10-02 11:35:55,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-10-02 11:35:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:55,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:55,638 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:55,638 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:55,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-10-02 11:35:55,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:55,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:55,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:55,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:56,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-02 11:35:56,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:35:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:35:56,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:56,167 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 12 states. [2018-10-02 11:35:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:57,143 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-10-02 11:35:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:57,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-02 11:35:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:57,147 INFO L225 Difference]: With dead ends: 875 [2018-10-02 11:35:57,147 INFO L226 Difference]: Without dead ends: 873 [2018-10-02 11:35:57,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:35:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-10-02 11:35:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-10-02 11:35:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-10-02 11:35:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-10-02 11:35:57,264 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-10-02 11:35:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:57,264 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-10-02 11:35:57,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:35:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-10-02 11:35:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:57,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:57,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:57,265 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:57,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-10-02 11:35:57,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:57,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:57,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:57,366 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:57,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:57,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:57,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:57,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-10-02 11:35:57,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:57,462 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-10-02 11:35:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:59,001 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-10-02 11:35:59,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:35:59,002 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-02 11:35:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:59,006 INFO L225 Difference]: With dead ends: 1281 [2018-10-02 11:35:59,006 INFO L226 Difference]: Without dead ends: 1279 [2018-10-02 11:35:59,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:35:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-02 11:35:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-10-02 11:35:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-02 11:35:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-02 11:35:59,179 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-10-02 11:35:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:59,179 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-02 11:35:59,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-02 11:35:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:59,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:59,180 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:59,180 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:59,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-10-02 11:35:59,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:59,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:59,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:59,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:59,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 11:35:59,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:35:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:35:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:35:59,338 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-10-02 11:36:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:00,022 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-10-02 11:36:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:00,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-02 11:36:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:00,026 INFO L225 Difference]: With dead ends: 1054 [2018-10-02 11:36:00,026 INFO L226 Difference]: Without dead ends: 1052 [2018-10-02 11:36:00,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-02 11:36:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-10-02 11:36:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-02 11:36:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-10-02 11:36:00,206 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-10-02 11:36:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:00,207 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-10-02 11:36:00,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-10-02 11:36:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:36:00,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:00,208 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:00,208 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:00,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-10-02 11:36:00,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:00,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:00,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:00,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:00,283 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:36:00,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:36:00,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:36:00,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:00,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:00,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-10-02 11:36:00,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:36:00,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:36:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:00,389 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 12 states. [2018-10-02 11:36:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:01,533 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-10-02 11:36:01,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:36:01,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-02 11:36:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:01,538 INFO L225 Difference]: With dead ends: 1125 [2018-10-02 11:36:01,538 INFO L226 Difference]: Without dead ends: 1123 [2018-10-02 11:36:01,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:36:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-02 11:36:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-10-02 11:36:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-02 11:36:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-02 11:36:01,713 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-10-02 11:36:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:01,713 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-02 11:36:01,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:36:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-02 11:36:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:36:01,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:01,714 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:01,714 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:01,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-10-02 11:36:01,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:01,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:01,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:36:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:01,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:01,847 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:01,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:01,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:01,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:01,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-02 11:36:01,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:36:01,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:36:01,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:36:01,974 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-10-02 11:36:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:03,427 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-10-02 11:36:03,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:36:03,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 11:36:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:03,431 INFO L225 Difference]: With dead ends: 1125 [2018-10-02 11:36:03,431 INFO L226 Difference]: Without dead ends: 1123 [2018-10-02 11:36:03,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:36:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-02 11:36:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-10-02 11:36:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-10-02 11:36:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-10-02 11:36:03,615 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-10-02 11:36:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:03,615 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-10-02 11:36:03,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-10-02 11:36:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:36:03,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:03,616 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:03,616 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:03,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-10-02 11:36:03,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:03,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:03,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:03,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:03,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:03,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:03,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:03,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:03,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-02 11:36:03,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:36:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:36:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:03,791 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-10-02 11:36:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:04,623 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-10-02 11:36:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:36:04,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-02 11:36:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:04,627 INFO L225 Difference]: With dead ends: 1117 [2018-10-02 11:36:04,627 INFO L226 Difference]: Without dead ends: 1115 [2018-10-02 11:36:04,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-10-02 11:36:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-10-02 11:36:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-02 11:36:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-10-02 11:36:04,808 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-10-02 11:36:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:04,808 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-10-02 11:36:04,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:36:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-10-02 11:36:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:36:04,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:04,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:04,810 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:04,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-10-02 11:36:04,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:04,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:04,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:04,939 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:04,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:04,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:05,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:05,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 11:36:05,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:36:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:36:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:36:05,016 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-10-02 11:36:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:05,789 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-10-02 11:36:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:36:05,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-02 11:36:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:05,793 INFO L225 Difference]: With dead ends: 995 [2018-10-02 11:36:05,793 INFO L226 Difference]: Without dead ends: 993 [2018-10-02 11:36:05,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:36:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-02 11:36:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-10-02 11:36:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-10-02 11:36:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-10-02 11:36:05,969 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-10-02 11:36:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:05,969 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-10-02 11:36:05,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-10-02 11:36:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:05,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:05,971 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:36:05,971 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:05,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-10-02 11:36:05,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:05,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:06,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:06,185 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:06,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:06,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:06,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:06,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-02 11:36:06,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:36:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:36:06,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:06,371 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-10-02 11:36:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:08,824 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-10-02 11:36:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:36:08,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-02 11:36:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:08,829 INFO L225 Difference]: With dead ends: 2105 [2018-10-02 11:36:08,829 INFO L226 Difference]: Without dead ends: 1229 [2018-10-02 11:36:08,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=635, Invalid=2557, Unknown=0, NotChecked=0, Total=3192 [2018-10-02 11:36:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-02 11:36:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-10-02 11:36:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-02 11:36:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-10-02 11:36:09,052 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-10-02 11:36:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:09,052 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-10-02 11:36:09,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:36:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-10-02 11:36:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:09,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:09,053 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:09,053 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:09,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-10-02 11:36:09,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:09,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:09,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:09,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:09,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:09,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 11:36:09,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:09,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:09,332 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-10-02 11:36:10,112 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-10-02 11:36:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:11,572 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-10-02 11:36:11,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 11:36:11,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 11:36:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:11,577 INFO L225 Difference]: With dead ends: 2110 [2018-10-02 11:36:11,577 INFO L226 Difference]: Without dead ends: 1097 [2018-10-02 11:36:11,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=426, Invalid=2024, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:36:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-02 11:36:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-10-02 11:36:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-02 11:36:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-10-02 11:36:11,776 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-10-02 11:36:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:11,776 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-10-02 11:36:11,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-10-02 11:36:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:11,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:11,777 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:11,777 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:11,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-10-02 11:36:11,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:11,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:12,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:12,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:12,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:12,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:12,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:12,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 11:36:12,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:12,623 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-10-02 11:36:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:15,065 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-10-02 11:36:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:36:15,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 11:36:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:15,071 INFO L225 Difference]: With dead ends: 2832 [2018-10-02 11:36:15,071 INFO L226 Difference]: Without dead ends: 1867 [2018-10-02 11:36:15,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=702, Invalid=3330, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:36:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-10-02 11:36:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-10-02 11:36:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-02 11:36:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-10-02 11:36:15,411 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-10-02 11:36:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:15,411 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-10-02 11:36:15,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-10-02 11:36:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:15,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:15,412 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:15,413 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:15,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-10-02 11:36:15,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:15,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:15,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:15,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:15,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:36:15,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 11:36:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:15,621 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-10-02 11:36:19,054 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-10-02 11:36:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:19,961 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-10-02 11:36:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 11:36:19,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 11:36:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:19,988 INFO L225 Difference]: With dead ends: 4461 [2018-10-02 11:36:19,988 INFO L226 Difference]: Without dead ends: 2887 [2018-10-02 11:36:19,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1321, Invalid=5159, Unknown=0, NotChecked=0, Total=6480 [2018-10-02 11:36:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-02 11:36:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-10-02 11:36:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-10-02 11:36:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-10-02 11:36:20,921 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-10-02 11:36:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:20,921 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-10-02 11:36:20,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-10-02 11:36:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:20,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:20,925 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:36:20,925 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:20,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-10-02 11:36:20,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:20,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:21,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:21,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:21,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:22,568 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-02 11:36:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:23,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:23,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-02 11:36:23,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:23,713 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-10-02 11:36:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:27,993 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-10-02 11:36:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 11:36:27,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-02 11:36:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:28,001 INFO L225 Difference]: With dead ends: 3903 [2018-10-02 11:36:28,002 INFO L226 Difference]: Without dead ends: 3227 [2018-10-02 11:36:28,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1137, Invalid=6873, Unknown=0, NotChecked=0, Total=8010 [2018-10-02 11:36:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-10-02 11:36:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-10-02 11:36:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-10-02 11:36:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-10-02 11:36:28,679 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-10-02 11:36:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:28,679 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-10-02 11:36:28,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:36:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-10-02 11:36:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:28,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:28,680 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:28,680 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:28,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-10-02 11:36:28,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:28,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:28,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:28,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:29,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:29,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:29,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:29,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:29,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 11:36:29,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:29,208 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-10-02 11:36:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:31,937 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-10-02 11:36:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 11:36:31,937 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 11:36:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:31,942 INFO L225 Difference]: With dead ends: 5427 [2018-10-02 11:36:31,942 INFO L226 Difference]: Without dead ends: 2851 [2018-10-02 11:36:31,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2018-10-02 11:36:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-10-02 11:36:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-10-02 11:36:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-10-02 11:36:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-10-02 11:36:32,637 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-10-02 11:36:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:32,638 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-10-02 11:36:32,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-10-02 11:36:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:32,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:32,639 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:36:32,640 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:32,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-10-02 11:36:32,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:32,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:32,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:32,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:32,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:32,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:32,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 11:36:32,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:32,887 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-10-02 11:36:35,520 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-10-02 11:36:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:36,082 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-10-02 11:36:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:36:36,082 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 11:36:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:36,089 INFO L225 Difference]: With dead ends: 5837 [2018-10-02 11:36:36,089 INFO L226 Difference]: Without dead ends: 3072 [2018-10-02 11:36:36,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=785, Invalid=3247, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:36:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-02 11:36:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-10-02 11:36:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-10-02 11:36:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-10-02 11:36:36,803 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-10-02 11:36:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:36,804 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-10-02 11:36:36,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-10-02 11:36:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:36,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:36,805 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:36:36,806 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:36,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-10-02 11:36:36,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:36,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:36,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:36,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:36,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:37,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:37,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:37,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:37,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:37,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-02 11:36:37,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:36:37,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:36:37,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:36:37,920 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-10-02 11:36:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:43,924 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-10-02 11:36:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-02 11:36:43,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-10-02 11:36:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:43,929 INFO L225 Difference]: With dead ends: 5120 [2018-10-02 11:36:43,930 INFO L226 Difference]: Without dead ends: 3342 [2018-10-02 11:36:43,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3994 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1800, Invalid=9972, Unknown=0, NotChecked=0, Total=11772 [2018-10-02 11:36:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-10-02 11:36:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-10-02 11:36:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-10-02 11:36:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-10-02 11:36:44,892 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-10-02 11:36:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:44,893 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-10-02 11:36:44,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:36:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-10-02 11:36:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:44,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:44,894 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:44,894 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:44,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:44,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-10-02 11:36:44,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:44,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:44,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:44,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:44,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:45,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:45,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:45,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:36:45,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:45,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-10-02 11:36:45,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:45,245 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 16 states. [2018-10-02 11:36:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:48,217 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-10-02 11:36:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:36:48,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 11:36:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:48,224 INFO L225 Difference]: With dead ends: 3487 [2018-10-02 11:36:48,224 INFO L226 Difference]: Without dead ends: 3485 [2018-10-02 11:36:48,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2018-10-02 11:36:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-10-02 11:36:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-10-02 11:36:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-02 11:36:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-10-02 11:36:49,077 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-10-02 11:36:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:49,078 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-10-02 11:36:49,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:36:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-10-02 11:36:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:49,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:49,079 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:49,079 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:49,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-10-02 11:36:49,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:49,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:49,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:49,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:49,300 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:49,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:49,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:36:49,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-02 11:36:49,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:49,487 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 15 states. [2018-10-02 11:36:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:52,552 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-10-02 11:36:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 11:36:52,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-02 11:36:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:52,556 INFO L225 Difference]: With dead ends: 3557 [2018-10-02 11:36:52,556 INFO L226 Difference]: Without dead ends: 3555 [2018-10-02 11:36:52,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=674, Invalid=3486, Unknown=0, NotChecked=0, Total=4160 [2018-10-02 11:36:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-10-02 11:36:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-10-02 11:36:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-10-02 11:36:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-10-02 11:36:53,265 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-10-02 11:36:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:53,265 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-10-02 11:36:53,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-10-02 11:36:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:53,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:53,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:53,267 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:53,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-10-02 11:36:53,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:53,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:53,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:53,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:53,375 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:53,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:36:53,391 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:36:53,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:36:53,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:53,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:53,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 11:36:53,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:36:53,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:36:53,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:36:53,531 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-10-02 11:37:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:01,800 INFO L93 Difference]: Finished difference Result 5252 states and 8823 transitions. [2018-10-02 11:37:01,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-02 11:37:01,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 11:37:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:01,804 INFO L225 Difference]: With dead ends: 5252 [2018-10-02 11:37:01,804 INFO L226 Difference]: Without dead ends: 5250 [2018-10-02 11:37:01,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7869 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2825, Invalid=16915, Unknown=0, NotChecked=0, Total=19740 [2018-10-02 11:37:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2018-10-02 11:37:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 3515. [2018-10-02 11:37:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-10-02 11:37:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-10-02 11:37:02,569 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-10-02 11:37:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:02,569 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-10-02 11:37:02,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-10-02 11:37:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:02,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:02,570 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:02,571 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:02,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-10-02 11:37:02,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:02,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:02,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:02,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:02,817 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:02,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:02,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:02,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:02,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-02 11:37:02,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:02,996 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-10-02 11:37:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:10,931 INFO L93 Difference]: Finished difference Result 4843 states and 8107 transitions. [2018-10-02 11:37:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-02 11:37:10,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 11:37:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:10,936 INFO L225 Difference]: With dead ends: 4843 [2018-10-02 11:37:10,936 INFO L226 Difference]: Without dead ends: 4841 [2018-10-02 11:37:10,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6131 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2645, Invalid=12855, Unknown=0, NotChecked=0, Total=15500 [2018-10-02 11:37:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2018-10-02 11:37:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3405. [2018-10-02 11:37:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-10-02 11:37:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-10-02 11:37:11,773 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-10-02 11:37:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-10-02 11:37:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-10-02 11:37:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:11,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:11,775 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:11,775 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:11,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-10-02 11:37:11,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:11,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:11,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:11,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:11,915 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:11,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:11,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:11,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:11,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:37:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-02 11:37:12,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:37:12,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:37:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:37:12,030 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-10-02 11:37:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:14,730 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-10-02 11:37:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 11:37:14,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 11:37:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:14,734 INFO L225 Difference]: With dead ends: 5774 [2018-10-02 11:37:14,735 INFO L226 Difference]: Without dead ends: 3100 [2018-10-02 11:37:14,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=695, Invalid=2385, Unknown=0, NotChecked=0, Total=3080 [2018-10-02 11:37:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-02 11:37:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-10-02 11:37:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-10-02 11:37:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-10-02 11:37:15,821 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-10-02 11:37:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:15,821 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-10-02 11:37:15,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:37:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-10-02 11:37:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:15,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:15,823 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:15,823 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:15,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-10-02 11:37:15,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:15,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:15,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:17,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:17,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:17,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:17,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:17,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:17,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-02 11:37:17,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:37:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:37:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:37:17,980 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 15 states. [2018-10-02 11:37:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:20,473 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-10-02 11:37:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 11:37:20,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-02 11:37:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:20,476 INFO L225 Difference]: With dead ends: 3114 [2018-10-02 11:37:20,476 INFO L226 Difference]: Without dead ends: 3112 [2018-10-02 11:37:20,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=409, Invalid=1847, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:37:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-10-02 11:37:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-10-02 11:37:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-10-02 11:37:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-10-02 11:37:21,182 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-10-02 11:37:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:21,183 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-10-02 11:37:21,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:37:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-10-02 11:37:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:21,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:21,184 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:21,184 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:21,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-10-02 11:37:21,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:21,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:21,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:21,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:21,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:21,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:21,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:21,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:21,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:21,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:21,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:21,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:21,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-02 11:37:21,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:21,415 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-10-02 11:37:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:26,827 INFO L93 Difference]: Finished difference Result 4415 states and 7404 transitions. [2018-10-02 11:37:26,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-02 11:37:26,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-02 11:37:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:26,831 INFO L225 Difference]: With dead ends: 4415 [2018-10-02 11:37:26,831 INFO L226 Difference]: Without dead ends: 4413 [2018-10-02 11:37:26,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1803, Invalid=6939, Unknown=0, NotChecked=0, Total=8742 [2018-10-02 11:37:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-10-02 11:37:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3073. [2018-10-02 11:37:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-10-02 11:37:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-10-02 11:37:27,604 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-10-02 11:37:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:27,604 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-10-02 11:37:27,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-10-02 11:37:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:27,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:27,605 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:27,606 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:27,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-10-02 11:37:27,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:27,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:27,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:27,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:27,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:27,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:27,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:27,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:27,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-10-02 11:37:27,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:37:27,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:37:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:37:27,846 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 16 states. [2018-10-02 11:37:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:32,040 INFO L93 Difference]: Finished difference Result 4429 states and 7411 transitions. [2018-10-02 11:37:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 11:37:32,041 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 11:37:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:32,045 INFO L225 Difference]: With dead ends: 4429 [2018-10-02 11:37:32,045 INFO L226 Difference]: Without dead ends: 4427 [2018-10-02 11:37:32,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=906, Invalid=3384, Unknown=0, NotChecked=0, Total=4290 [2018-10-02 11:37:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2018-10-02 11:37:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 2723. [2018-10-02 11:37:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-10-02 11:37:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-10-02 11:37:32,879 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-10-02 11:37:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:32,880 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-10-02 11:37:32,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:37:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-10-02 11:37:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:32,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:32,881 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:32,881 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:32,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-10-02 11:37:32,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:32,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:32,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:32,981 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:32,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:32,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:33,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:33,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 11:37:33,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:33,166 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 18 states. [2018-10-02 11:37:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:37,850 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-10-02 11:37:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-02 11:37:37,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 11:37:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:37,854 INFO L225 Difference]: With dead ends: 4290 [2018-10-02 11:37:37,854 INFO L226 Difference]: Without dead ends: 4288 [2018-10-02 11:37:37,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=986, Invalid=4416, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:37:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-10-02 11:37:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-10-02 11:37:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-10-02 11:37:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5610 transitions. [2018-10-02 11:37:38,891 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5610 transitions. Word has length 18 [2018-10-02 11:37:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:38,891 INFO L480 AbstractCegarLoop]: Abstraction has 3364 states and 5610 transitions. [2018-10-02 11:37:38,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5610 transitions. [2018-10-02 11:37:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:37:38,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:38,892 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:38,892 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:38,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-10-02 11:37:38,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:38,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:38,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:38,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:38,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:37:39,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:37:39,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:39,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:39,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:39,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 11:37:39,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:39,233 INFO L87 Difference]: Start difference. First operand 3364 states and 5610 transitions. Second operand 18 states. [2018-10-02 11:37:44,760 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-10-02 11:37:47,778 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-02 11:37:50,645 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-10-02 11:37:51,103 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-02 11:37:51,676 WARN L178 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-02 11:37:52,110 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-02 11:37:53,196 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-10-02 11:37:54,034 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-10-02 11:37:54,676 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-02 11:37:55,402 WARN L178 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-10-02 11:37:56,363 WARN L178 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-10-02 11:37:56,884 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-02 11:38:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:02,642 INFO L93 Difference]: Finished difference Result 9624 states and 16323 transitions. [2018-10-02 11:38:02,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-02 11:38:02,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-02 11:38:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:02,652 INFO L225 Difference]: With dead ends: 9624 [2018-10-02 11:38:02,652 INFO L226 Difference]: Without dead ends: 9622 [2018-10-02 11:38:02,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16036 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=6166, Invalid=32839, Unknown=1, NotChecked=0, Total=39006 [2018-10-02 11:38:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2018-10-02 11:38:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 3326. [2018-10-02 11:38:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2018-10-02 11:38:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 5536 transitions. [2018-10-02 11:38:03,682 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 5536 transitions. Word has length 18 [2018-10-02 11:38:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 3326 states and 5536 transitions. [2018-10-02 11:38:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:38:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 5536 transitions. [2018-10-02 11:38:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:38:03,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:03,684 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:03,684 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-10-02 11:38:03,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:03,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:38:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:03,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:03,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:03,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:03,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:03,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:03,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-10-02 11:38:03,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:03,939 INFO L87 Difference]: Start difference. First operand 3326 states and 5536 transitions. Second operand 17 states. [2018-10-02 11:38:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:09,850 INFO L93 Difference]: Finished difference Result 5572 states and 9460 transitions. [2018-10-02 11:38:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-02 11:38:09,850 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-02 11:38:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:09,856 INFO L225 Difference]: With dead ends: 5572 [2018-10-02 11:38:09,856 INFO L226 Difference]: Without dead ends: 5570 [2018-10-02 11:38:09,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1511, Invalid=7045, Unknown=0, NotChecked=0, Total=8556 [2018-10-02 11:38:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2018-10-02 11:38:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3526. [2018-10-02 11:38:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-10-02 11:38:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5899 transitions. [2018-10-02 11:38:11,113 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5899 transitions. Word has length 18 [2018-10-02 11:38:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:11,113 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 5899 transitions. [2018-10-02 11:38:11,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5899 transitions. [2018-10-02 11:38:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:38:11,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:11,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:11,115 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:11,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-10-02 11:38:11,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:11,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:11,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:11,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:11,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:11,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:11,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:38:11,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:38:11,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:38:11,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:11,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-10-02 11:38:11,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:11,757 INFO L87 Difference]: Start difference. First operand 3526 states and 5899 transitions. Second operand 17 states. [2018-10-02 11:38:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:16,129 INFO L93 Difference]: Finished difference Result 4458 states and 7480 transitions. [2018-10-02 11:38:16,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-02 11:38:16,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-02 11:38:16,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:16,134 INFO L225 Difference]: With dead ends: 4458 [2018-10-02 11:38:16,134 INFO L226 Difference]: Without dead ends: 4456 [2018-10-02 11:38:16,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=904, Invalid=5258, Unknown=0, NotChecked=0, Total=6162 [2018-10-02 11:38:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-10-02 11:38:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3633. [2018-10-02 11:38:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2018-10-02 11:38:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6081 transitions. [2018-10-02 11:38:17,537 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6081 transitions. Word has length 18 [2018-10-02 11:38:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:17,537 INFO L480 AbstractCegarLoop]: Abstraction has 3633 states and 6081 transitions. [2018-10-02 11:38:17,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6081 transitions. [2018-10-02 11:38:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 11:38:17,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:17,538 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:17,539 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:17,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-10-02 11:38:17,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:17,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:17,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:17,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:38:17,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:17,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:17,703 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:17,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:17,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:18,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:18,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-02 11:38:18,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:38:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:38:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:38:18,260 INFO L87 Difference]: Start difference. First operand 3633 states and 6081 transitions. Second operand 21 states. [2018-10-02 11:38:18,743 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-02 11:38:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:22,822 INFO L93 Difference]: Finished difference Result 4389 states and 7355 transitions. [2018-10-02 11:38:22,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 11:38:22,822 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-10-02 11:38:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:22,826 INFO L225 Difference]: With dead ends: 4389 [2018-10-02 11:38:22,826 INFO L226 Difference]: Without dead ends: 4376 [2018-10-02 11:38:22,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=725, Invalid=3181, Unknown=0, NotChecked=0, Total=3906 [2018-10-02 11:38:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2018-10-02 11:38:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4152. [2018-10-02 11:38:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2018-10-02 11:38:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6931 transitions. [2018-10-02 11:38:24,386 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6931 transitions. Word has length 19 [2018-10-02 11:38:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:24,386 INFO L480 AbstractCegarLoop]: Abstraction has 4152 states and 6931 transitions. [2018-10-02 11:38:24,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:38:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6931 transitions. [2018-10-02 11:38:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 11:38:24,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:24,388 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:24,388 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:24,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-10-02 11:38:24,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:24,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:24,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:24,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:24,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:24,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:24,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:24,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:24,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:24,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-10-02 11:38:24,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:38:24,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:38:24,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:38:24,661 INFO L87 Difference]: Start difference. First operand 4152 states and 6931 transitions. Second operand 19 states. [2018-10-02 11:38:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:32,326 INFO L93 Difference]: Finished difference Result 7602 states and 12857 transitions. [2018-10-02 11:38:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 11:38:32,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-10-02 11:38:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:32,332 INFO L225 Difference]: With dead ends: 7602 [2018-10-02 11:38:32,332 INFO L226 Difference]: Without dead ends: 7553 [2018-10-02 11:38:32,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1106, Invalid=4006, Unknown=0, NotChecked=0, Total=5112 [2018-10-02 11:38:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2018-10-02 11:38:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5765. [2018-10-02 11:38:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2018-10-02 11:38:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 9725 transitions. [2018-10-02 11:38:34,598 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 9725 transitions. Word has length 19 [2018-10-02 11:38:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:34,598 INFO L480 AbstractCegarLoop]: Abstraction has 5765 states and 9725 transitions. [2018-10-02 11:38:34,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:38:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 9725 transitions. [2018-10-02 11:38:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 11:38:34,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:34,600 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:34,600 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:34,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-10-02 11:38:34,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:34,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:34,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:34,734 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:34,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:34,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:34,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:34,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2018-10-02 11:38:34,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:38:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:38:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:38:34,880 INFO L87 Difference]: Start difference. First operand 5765 states and 9725 transitions. Second operand 18 states. [2018-10-02 11:38:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:46,170 INFO L93 Difference]: Finished difference Result 10730 states and 18220 transitions. [2018-10-02 11:38:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-02 11:38:46,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-10-02 11:38:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:46,180 INFO L225 Difference]: With dead ends: 10730 [2018-10-02 11:38:46,180 INFO L226 Difference]: Without dead ends: 10673 [2018-10-02 11:38:46,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1268, Invalid=5872, Unknown=0, NotChecked=0, Total=7140 [2018-10-02 11:38:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2018-10-02 11:38:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 5867. [2018-10-02 11:38:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5867 states. [2018-10-02 11:38:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 9873 transitions. [2018-10-02 11:38:48,897 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 9873 transitions. Word has length 19 [2018-10-02 11:38:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:48,897 INFO L480 AbstractCegarLoop]: Abstraction has 5867 states and 9873 transitions. [2018-10-02 11:38:48,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:38:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 9873 transitions. [2018-10-02 11:38:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:38:48,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:48,899 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-02 11:38:48,899 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:48,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash -298147634, now seen corresponding path program 2 times [2018-10-02 11:38:48,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:48,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:48,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:48,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:49,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:49,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:49,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:38:49,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:38:49,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:38:49,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:38:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:49,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-02 11:38:49,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:38:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:38:49,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:38:49,200 INFO L87 Difference]: Start difference. First operand 5867 states and 9873 transitions. Second operand 20 states. [2018-10-02 11:38:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:54,439 INFO L93 Difference]: Finished difference Result 12951 states and 21640 transitions. [2018-10-02 11:38:54,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:38:54,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-02 11:38:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:54,446 INFO L225 Difference]: With dead ends: 12951 [2018-10-02 11:38:54,446 INFO L226 Difference]: Without dead ends: 7453 [2018-10-02 11:38:54,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:38:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2018-10-02 11:38:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 6977. [2018-10-02 11:38:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-10-02 11:38:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 11514 transitions. [2018-10-02 11:38:57,624 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 11514 transitions. Word has length 21 [2018-10-02 11:38:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:57,624 INFO L480 AbstractCegarLoop]: Abstraction has 6977 states and 11514 transitions. [2018-10-02 11:38:57,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:38:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 11514 transitions. [2018-10-02 11:38:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:38:57,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:57,626 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:57,626 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:57,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 1 times [2018-10-02 11:38:57,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:57,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:57,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:38:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:57,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:57,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:57,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:57,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:57,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-10-02 11:38:57,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:57,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:57,888 INFO L87 Difference]: Start difference. First operand 6977 states and 11514 transitions. Second operand 17 states. [2018-10-02 11:39:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:03,211 INFO L93 Difference]: Finished difference Result 7309 states and 12055 transitions. [2018-10-02 11:39:03,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:39:03,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-10-02 11:39:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:03,216 INFO L225 Difference]: With dead ends: 7309 [2018-10-02 11:39:03,216 INFO L226 Difference]: Without dead ends: 7307 [2018-10-02 11:39:03,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-02 11:39:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2018-10-02 11:39:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 6935. [2018-10-02 11:39:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6935 states. [2018-10-02 11:39:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 11445 transitions. [2018-10-02 11:39:06,140 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 11445 transitions. Word has length 21 [2018-10-02 11:39:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:06,140 INFO L480 AbstractCegarLoop]: Abstraction has 6935 states and 11445 transitions. [2018-10-02 11:39:06,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:39:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 11445 transitions. [2018-10-02 11:39:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:39:06,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:06,142 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:06,142 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:06,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1010297104, now seen corresponding path program 1 times [2018-10-02 11:39:06,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:06,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:06,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:06,265 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:06,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:06,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:39:06,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:06,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-02 11:39:06,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:39:06,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:39:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:39:06,957 INFO L87 Difference]: Start difference. First operand 6935 states and 11445 transitions. Second operand 21 states. [2018-10-02 11:39:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:13,520 INFO L93 Difference]: Finished difference Result 11330 states and 18599 transitions. [2018-10-02 11:39:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:39:13,520 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-02 11:39:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:13,527 INFO L225 Difference]: With dead ends: 11330 [2018-10-02 11:39:13,527 INFO L226 Difference]: Without dead ends: 7599 [2018-10-02 11:39:13,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=590, Invalid=3442, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:39:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-02 11:39:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 6837. [2018-10-02 11:39:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-10-02 11:39:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 11276 transitions. [2018-10-02 11:39:16,779 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 11276 transitions. Word has length 21 [2018-10-02 11:39:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:16,779 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 11276 transitions. [2018-10-02 11:39:16,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:39:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 11276 transitions. [2018-10-02 11:39:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:39:16,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:16,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:16,782 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:16,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash -972124902, now seen corresponding path program 1 times [2018-10-02 11:39:16,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:16,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:16,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:16,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:16,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:16,896 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:16,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:16,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:39:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-10-02 11:39:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:39:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:39:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:39:17,031 INFO L87 Difference]: Start difference. First operand 6837 states and 11276 transitions. Second operand 15 states. [2018-10-02 11:39:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:21,719 INFO L93 Difference]: Finished difference Result 7136 states and 11762 transitions. [2018-10-02 11:39:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:39:21,719 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-02 11:39:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:21,725 INFO L225 Difference]: With dead ends: 7136 [2018-10-02 11:39:21,726 INFO L226 Difference]: Without dead ends: 7134 [2018-10-02 11:39:21,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:39:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2018-10-02 11:39:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 6814. [2018-10-02 11:39:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6814 states. [2018-10-02 11:39:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 11236 transitions. [2018-10-02 11:39:24,750 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 11236 transitions. Word has length 21 [2018-10-02 11:39:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:24,750 INFO L480 AbstractCegarLoop]: Abstraction has 6814 states and 11236 transitions. [2018-10-02 11:39:24,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:39:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 11236 transitions. [2018-10-02 11:39:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:39:24,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:24,752 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-02 11:39:24,752 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:24,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 4 times [2018-10-02 11:39:24,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:24,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:24,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:24,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:24,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:24,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:24,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:39:24,895 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:39:24,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:24,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:25,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:25,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-02 11:39:25,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:39:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:39:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:39:25,055 INFO L87 Difference]: Start difference. First operand 6814 states and 11236 transitions. Second operand 20 states. Received shutdown request... [2018-10-02 11:39:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-02 11:39:32,314 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:39:32,320 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:39:32,321 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:32 BoogieIcfgContainer [2018-10-02 11:39:32,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:32,322 INFO L168 Benchmark]: Toolchain (without parser) took 247188.70 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -106.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-02 11:39:32,323 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:32,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:32,323 INFO L168 Benchmark]: Boogie Preprocessor took 27.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:32,324 INFO L168 Benchmark]: RCFGBuilder took 410.68 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:32,324 INFO L168 Benchmark]: TraceAbstraction took 246700.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -127.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-02 11:39:32,327 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.18 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 42.73 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 27.05 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 410.68 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246700.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -127.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 116 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (4433 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 116 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (4433 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 116 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (4433 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 116 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (4433 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 246.5s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 185.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2150 SDtfs, 10711 SDslu, 7088 SDs, 0 SdLazy, 56154 SolverSat, 7359 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 56.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 511 SyntacticMatches, 21 SemanticMatches, 2791 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 74465 ImplicationChecksByTransitivity, 82.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6977occurred in iteration=57, 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: 37.6s AutomataMinimizationTime, 60 MinimizatonAttempts, 33087 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1480 ConstructedInterpolants, 87 QuantifiedInterpolants, 145148 SizeOfPredicates, 236 NumberOfNonLiveVariables, 2412 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 114 InterpolantComputations, 9 PerfectInterpolantSequences, 200/918 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_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-39-32-338.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-39-32-338.csv Completed graceful shutdown