java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_3.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:47:21,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:47:21,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:47:21,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:47:21,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:47:21,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:47:21,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:47:21,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:47:21,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:47:21,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:47:21,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:47:21,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:47:21,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:47:21,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:47:21,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:47:21,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:47:21,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:47:21,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:47:21,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:47:21,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:47:21,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:47:21,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:47:21,426 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:47:21,426 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:47:21,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:47:21,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:47:21,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:47:21,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:47:21,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:47:21,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:47:21,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:47:21,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:47:21,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:47:21,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:47:21,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:47:21,434 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:47:21,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:47:21,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:47:21,455 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:47:21,455 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:47:21,456 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:47:21,456 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:47:21,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:47:21,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:47:21,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:47:21,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:47:21,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:47:21,458 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:47:21,459 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:47:21,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:47:21,459 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:47:21,459 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:47:21,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:47:21,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:47:21,460 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:47:21,462 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:47:21,462 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:47:21,507 INFO ]: Repository-Root is: /tmp [2018-06-22 11:47:21,519 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:47:21,522 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:47:21,524 INFO ]: Initializing SmtParser... [2018-06-22 11:47:21,524 INFO ]: SmtParser initialized [2018-06-22 11:47:21,525 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_3.array.smt2 [2018-06-22 11:47:21,526 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:47:21,626 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_3.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@4b78dfac [2018-06-22 11:47:21,878 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_3.array.smt2 [2018-06-22 11:47:21,883 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:47:21,890 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:47:21,890 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:47:21,890 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:47:21,890 INFO ]: ChcToBoogie initialized [2018-06-22 11:47:21,894 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:21,956 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21 Unit [2018-06-22 11:47:21,957 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:47:21,957 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:47:21,957 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:47:21,957 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:47:21,981 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:21,981 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:21,994 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:21,995 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:21,999 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:22,002 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:22,004 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... [2018-06-22 11:47:22,005 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:47:22,006 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:47:22,006 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:47:22,006 INFO ]: RCFGBuilder initialized [2018-06-22 11:47:22,007 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:47:22,023 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:47:22,024 INFO ]: Found specification of procedure False [2018-06-22 11:47:22,024 INFO ]: Found implementation of procedure False [2018-06-22 11:47:22,024 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:47:22,024 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:47:22,024 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:47:22,024 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:47:22,024 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:47:22,024 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:47:22,024 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:47:22,024 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:47:22,024 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:47:22,355 INFO ]: Using library mode [2018-06-22 11:47:22,355 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:47:22 BoogieIcfgContainer [2018-06-22 11:47:22,355 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:47:22,357 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:47:22,357 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:47:22,366 INFO ]: TraceAbstraction initialized [2018-06-22 11:47:22,366 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:47:21" (1/3) ... [2018-06-22 11:47:22,367 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a84ef94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:47:22, skipping insertion in model container [2018-06-22 11:47:22,367 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:47:21" (2/3) ... [2018-06-22 11:47:22,367 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a84ef94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:47:22, skipping insertion in model container [2018-06-22 11:47:22,367 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:47:22" (3/3) ... [2018-06-22 11:47:22,369 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:47:22,378 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:47:22,386 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:47:22,420 INFO ]: Using default assertion order modulation [2018-06-22 11:47:22,421 INFO ]: Interprodecural is true [2018-06-22 11:47:22,421 INFO ]: Hoare is false [2018-06-22 11:47:22,421 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:47:22,421 INFO ]: Backedges is TWOTRACK [2018-06-22 11:47:22,421 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:47:22,421 INFO ]: Difference is false [2018-06-22 11:47:22,421 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:47:22,421 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:47:22,440 INFO ]: Start isEmpty. Operand 25 states. [2018-06-22 11:47:22,452 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:47:22,453 INFO ]: Found error trace [2018-06-22 11:47:22,453 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:22,453 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:22,457 INFO ]: Analyzing trace with hash -382895144, now seen corresponding path program 1 times [2018-06-22 11:47:22,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:22,459 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:22,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:22,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:22,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:22,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:22,604 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:47:22,606 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:22,606 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:47:22,608 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:47:22,618 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:47:22,619 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:22,620 INFO ]: Start difference. First operand 25 states. Second operand 4 states. [2018-06-22 11:47:22,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:22,749 INFO ]: Finished difference Result 27 states and 45 transitions. [2018-06-22 11:47:22,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:47:22,751 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:47:22,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:22,761 INFO ]: With dead ends: 27 [2018-06-22 11:47:22,761 INFO ]: Without dead ends: 27 [2018-06-22 11:47:22,763 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:22,780 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:47:22,804 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:47:22,805 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:47:22,806 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2018-06-22 11:47:22,808 INFO ]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 9 [2018-06-22 11:47:22,808 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:22,808 INFO ]: Abstraction has 25 states and 43 transitions. [2018-06-22 11:47:22,808 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:47:22,808 INFO ]: Start isEmpty. Operand 25 states and 43 transitions. [2018-06-22 11:47:22,811 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:47:22,811 INFO ]: Found error trace [2018-06-22 11:47:22,811 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:22,811 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:22,811 INFO ]: Analyzing trace with hash 1516288883, now seen corresponding path program 1 times [2018-06-22 11:47:22,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:22,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:22,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:22,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:22,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:22,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:22,864 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:47:22,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:22,864 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:47:22,866 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:47:22,866 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:47:22,866 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:22,866 INFO ]: Start difference. First operand 25 states and 43 transitions. Second operand 4 states. [2018-06-22 11:47:23,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:23,017 INFO ]: Finished difference Result 27 states and 44 transitions. [2018-06-22 11:47:23,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:47:23,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:47:23,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:23,019 INFO ]: With dead ends: 27 [2018-06-22 11:47:23,019 INFO ]: Without dead ends: 27 [2018-06-22 11:47:23,019 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:23,020 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:47:23,026 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:47:23,026 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:47:23,027 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2018-06-22 11:47:23,027 INFO ]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 9 [2018-06-22 11:47:23,027 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:23,027 INFO ]: Abstraction has 25 states and 42 transitions. [2018-06-22 11:47:23,027 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:47:23,027 INFO ]: Start isEmpty. Operand 25 states and 42 transitions. [2018-06-22 11:47:23,029 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:47:23,029 INFO ]: Found error trace [2018-06-22 11:47:23,029 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:23,029 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:23,029 INFO ]: Analyzing trace with hash -547309736, now seen corresponding path program 1 times [2018-06-22 11:47:23,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:23,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:23,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:23,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:23,030 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:23,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:23,253 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:47:23,254 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:23,254 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:47:23,254 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:47:23,254 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:47:23,254 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:47:23,254 INFO ]: Start difference. First operand 25 states and 42 transitions. Second operand 6 states. [2018-06-22 11:47:23,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:23,511 INFO ]: Finished difference Result 31 states and 59 transitions. [2018-06-22 11:47:23,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:47:23,511 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:47:23,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:23,513 INFO ]: With dead ends: 31 [2018-06-22 11:47:23,513 INFO ]: Without dead ends: 31 [2018-06-22 11:47:23,513 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:23,513 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:47:23,521 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:47:23,521 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:47:23,523 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2018-06-22 11:47:23,523 INFO ]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 13 [2018-06-22 11:47:23,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:23,523 INFO ]: Abstraction has 27 states and 49 transitions. [2018-06-22 11:47:23,523 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:47:23,523 INFO ]: Start isEmpty. Operand 27 states and 49 transitions. [2018-06-22 11:47:23,525 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:47:23,525 INFO ]: Found error trace [2018-06-22 11:47:23,525 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:23,525 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:23,525 INFO ]: Analyzing trace with hash 799228019, now seen corresponding path program 1 times [2018-06-22 11:47:23,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:23,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:23,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:23,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:23,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:23,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:23,603 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:47:23,603 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:23,603 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:47:23,603 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:47:23,603 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:47:23,603 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:47:23,603 INFO ]: Start difference. First operand 27 states and 49 transitions. Second operand 6 states. [2018-06-22 11:47:23,959 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:23,959 INFO ]: Finished difference Result 31 states and 58 transitions. [2018-06-22 11:47:23,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:47:23,960 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:47:23,960 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:23,961 INFO ]: With dead ends: 31 [2018-06-22 11:47:23,961 INFO ]: Without dead ends: 31 [2018-06-22 11:47:23,961 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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-06-22 11:47:23,962 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:47:23,968 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:47:23,968 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:47:23,969 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. [2018-06-22 11:47:23,969 INFO ]: Start accepts. Automaton has 27 states and 48 transitions. Word has length 13 [2018-06-22 11:47:23,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:23,969 INFO ]: Abstraction has 27 states and 48 transitions. [2018-06-22 11:47:23,969 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:47:23,969 INFO ]: Start isEmpty. Operand 27 states and 48 transitions. [2018-06-22 11:47:23,970 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:47:23,970 INFO ]: Found error trace [2018-06-22 11:47:23,970 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:23,970 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:23,971 INFO ]: Analyzing trace with hash -1893847491, now seen corresponding path program 1 times [2018-06-22 11:47:23,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:23,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:23,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:23,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:23,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:23,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:24,209 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-06-22 11:47:24,271 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:47:24,271 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:24,271 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:47:24,271 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:47:24,271 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:47:24,271 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:47:24,271 INFO ]: Start difference. First operand 27 states and 48 transitions. Second operand 6 states. [2018-06-22 11:47:24,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:24,568 INFO ]: Finished difference Result 33 states and 64 transitions. [2018-06-22 11:47:24,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:47:24,568 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:47:24,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:24,570 INFO ]: With dead ends: 33 [2018-06-22 11:47:24,570 INFO ]: Without dead ends: 33 [2018-06-22 11:47:24,570 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:24,570 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:47:24,578 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:47:24,578 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:47:24,579 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2018-06-22 11:47:24,579 INFO ]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 13 [2018-06-22 11:47:24,579 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:24,579 INFO ]: Abstraction has 29 states and 54 transitions. [2018-06-22 11:47:24,579 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:47:24,579 INFO ]: Start isEmpty. Operand 29 states and 54 transitions. [2018-06-22 11:47:24,580 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:24,580 INFO ]: Found error trace [2018-06-22 11:47:24,580 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:24,580 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:24,580 INFO ]: Analyzing trace with hash 1668744610, now seen corresponding path program 1 times [2018-06-22 11:47:24,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:24,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:24,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:24,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:24,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:24,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:24,679 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:24,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:24,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:24,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:24,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:24,713 INFO ]: Computing forward predicates... [2018-06-22 11:47:24,999 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:25,032 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:25,032 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:47:25,032 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:47:25,033 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:47:25,033 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:25,033 INFO ]: Start difference. First operand 29 states and 54 transitions. Second operand 8 states. [2018-06-22 11:47:25,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:25,549 INFO ]: Finished difference Result 43 states and 100 transitions. [2018-06-22 11:47:25,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:47:25,550 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:47:25,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:25,552 INFO ]: With dead ends: 43 [2018-06-22 11:47:25,552 INFO ]: Without dead ends: 43 [2018-06-22 11:47:25,552 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:25,552 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:47:25,566 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-06-22 11:47:25,567 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:47:25,568 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-06-22 11:47:25,568 INFO ]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 17 [2018-06-22 11:47:25,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:25,568 INFO ]: Abstraction has 31 states and 60 transitions. [2018-06-22 11:47:25,568 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:47:25,568 INFO ]: Start isEmpty. Operand 31 states and 60 transitions. [2018-06-22 11:47:25,576 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:25,576 INFO ]: Found error trace [2018-06-22 11:47:25,576 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:25,576 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:25,576 INFO ]: Analyzing trace with hash 2131236925, now seen corresponding path program 1 times [2018-06-22 11:47:25,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:25,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:25,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:25,577 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:25,577 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:25,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:25,676 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:25,677 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:25,677 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:25,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:25,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:25,713 INFO ]: Computing forward predicates... [2018-06-22 11:47:25,751 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:25,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:25,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:47:25,775 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:47:25,775 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:47:25,775 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:25,775 INFO ]: Start difference. First operand 31 states and 60 transitions. Second operand 8 states. [2018-06-22 11:47:26,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:26,464 INFO ]: Finished difference Result 39 states and 84 transitions. [2018-06-22 11:47:26,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:47:26,464 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:47:26,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:26,466 INFO ]: With dead ends: 39 [2018-06-22 11:47:26,466 INFO ]: Without dead ends: 39 [2018-06-22 11:47:26,466 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:47:26,466 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:47:26,473 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-22 11:47:26,473 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:47:26,474 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2018-06-22 11:47:26,474 INFO ]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 17 [2018-06-22 11:47:26,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:26,475 INFO ]: Abstraction has 29 states and 54 transitions. [2018-06-22 11:47:26,475 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:47:26,475 INFO ]: Start isEmpty. Operand 29 states and 54 transitions. [2018-06-22 11:47:26,476 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:26,476 INFO ]: Found error trace [2018-06-22 11:47:26,476 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:26,476 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:26,476 INFO ]: Analyzing trace with hash -1388596227, now seen corresponding path program 1 times [2018-06-22 11:47:26,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:26,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:26,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:26,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:26,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:26,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:26,550 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:26,550 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:26,550 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:26,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:26,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:26,587 INFO ]: Computing forward predicates... [2018-06-22 11:47:26,746 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:26,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:26,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:47:26,767 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:47:26,767 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:47:26,767 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:47:26,767 INFO ]: Start difference. First operand 29 states and 54 transitions. Second operand 9 states. [2018-06-22 11:47:27,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:27,097 INFO ]: Finished difference Result 41 states and 90 transitions. [2018-06-22 11:47:27,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:47:27,097 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:47:27,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:27,098 INFO ]: With dead ends: 41 [2018-06-22 11:47:27,098 INFO ]: Without dead ends: 41 [2018-06-22 11:47:27,098 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:27,098 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:47:27,107 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-22 11:47:27,107 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:47:27,111 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2018-06-22 11:47:27,111 INFO ]: Start accepts. Automaton has 33 states and 65 transitions. Word has length 17 [2018-06-22 11:47:27,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:27,111 INFO ]: Abstraction has 33 states and 65 transitions. [2018-06-22 11:47:27,111 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:47:27,111 INFO ]: Start isEmpty. Operand 33 states and 65 transitions. [2018-06-22 11:47:27,112 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:27,112 INFO ]: Found error trace [2018-06-22 11:47:27,112 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:27,112 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:27,113 INFO ]: Analyzing trace with hash -926103912, now seen corresponding path program 1 times [2018-06-22 11:47:27,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:27,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:27,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:27,113 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:27,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:27,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:27,199 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:27,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:27,199 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:27,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:27,230 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:27,232 INFO ]: Computing forward predicates... [2018-06-22 11:47:27,369 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:47:27,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:27,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:47:27,389 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:47:27,389 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:47:27,389 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:27,389 INFO ]: Start difference. First operand 33 states and 65 transitions. Second operand 8 states. [2018-06-22 11:47:27,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:27,633 INFO ]: Finished difference Result 43 states and 97 transitions. [2018-06-22 11:47:27,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:47:27,633 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:47:27,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:27,634 INFO ]: With dead ends: 43 [2018-06-22 11:47:27,634 INFO ]: Without dead ends: 43 [2018-06-22 11:47:27,634 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:27,634 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:47:27,641 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-06-22 11:47:27,641 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:47:27,642 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 64 transitions. [2018-06-22 11:47:27,642 INFO ]: Start accepts. Automaton has 33 states and 64 transitions. Word has length 17 [2018-06-22 11:47:27,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:27,642 INFO ]: Abstraction has 33 states and 64 transitions. [2018-06-22 11:47:27,642 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:47:27,642 INFO ]: Start isEmpty. Operand 33 states and 64 transitions. [2018-06-22 11:47:27,643 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:27,643 INFO ]: Found error trace [2018-06-22 11:47:27,643 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:27,643 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:27,644 INFO ]: Analyzing trace with hash 860147482, now seen corresponding path program 1 times [2018-06-22 11:47:27,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:27,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:27,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:27,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:27,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:27,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:27,765 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:27,766 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:27,766 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:47:27,766 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:47:27,766 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:47:27,766 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:27,766 INFO ]: Start difference. First operand 33 states and 64 transitions. Second operand 7 states. [2018-06-22 11:47:27,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:27,899 INFO ]: Finished difference Result 43 states and 95 transitions. [2018-06-22 11:47:27,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:47:27,899 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:47:27,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:27,900 INFO ]: With dead ends: 43 [2018-06-22 11:47:27,900 INFO ]: Without dead ends: 43 [2018-06-22 11:47:27,901 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:27,901 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:47:27,909 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-06-22 11:47:27,909 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:47:27,910 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 70 transitions. [2018-06-22 11:47:27,910 INFO ]: Start accepts. Automaton has 35 states and 70 transitions. Word has length 17 [2018-06-22 11:47:27,911 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:27,911 INFO ]: Abstraction has 35 states and 70 transitions. [2018-06-22 11:47:27,911 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:47:27,911 INFO ]: Start isEmpty. Operand 35 states and 70 transitions. [2018-06-22 11:47:27,912 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:27,912 INFO ]: Found error trace [2018-06-22 11:47:27,912 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:27,912 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:27,912 INFO ]: Analyzing trace with hash 1322639797, now seen corresponding path program 1 times [2018-06-22 11:47:27,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:27,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:27,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:27,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:27,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:27,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:28,003 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:28,004 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:28,004 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:47:28,004 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:47:28,004 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:47:28,004 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:28,004 INFO ]: Start difference. First operand 35 states and 70 transitions. Second operand 7 states. [2018-06-22 11:47:28,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:28,129 INFO ]: Finished difference Result 43 states and 94 transitions. [2018-06-22 11:47:28,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:47:28,129 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:47:28,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:28,130 INFO ]: With dead ends: 43 [2018-06-22 11:47:28,130 INFO ]: Without dead ends: 43 [2018-06-22 11:47:28,131 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:28,131 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:47:28,136 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-06-22 11:47:28,136 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:47:28,137 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2018-06-22 11:47:28,137 INFO ]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 17 [2018-06-22 11:47:28,137 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:28,137 INFO ]: Abstraction has 35 states and 69 transitions. [2018-06-22 11:47:28,137 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:47:28,138 INFO ]: Start isEmpty. Operand 35 states and 69 transitions. [2018-06-22 11:47:28,138 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:28,138 INFO ]: Found error trace [2018-06-22 11:47:28,138 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:28,139 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:28,139 INFO ]: Analyzing trace with hash -798990711, now seen corresponding path program 1 times [2018-06-22 11:47:28,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:28,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:28,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:28,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:28,200 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:28,200 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:28,200 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:47:28,200 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:47:28,200 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:47:28,200 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:28,200 INFO ]: Start difference. First operand 35 states and 69 transitions. Second operand 7 states. [2018-06-22 11:47:28,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:28,272 INFO ]: Finished difference Result 37 states and 69 transitions. [2018-06-22 11:47:28,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:47:28,273 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:47:28,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:28,273 INFO ]: With dead ends: 37 [2018-06-22 11:47:28,273 INFO ]: Without dead ends: 35 [2018-06-22 11:47:28,273 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:28,274 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:47:28,277 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:47:28,277 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:47:28,278 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2018-06-22 11:47:28,278 INFO ]: Start accepts. Automaton has 33 states and 63 transitions. Word has length 17 [2018-06-22 11:47:28,278 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:28,278 INFO ]: Abstraction has 33 states and 63 transitions. [2018-06-22 11:47:28,278 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:47:28,278 INFO ]: Start isEmpty. Operand 33 states and 63 transitions. [2018-06-22 11:47:28,279 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:47:28,279 INFO ]: Found error trace [2018-06-22 11:47:28,279 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:28,279 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:28,279 INFO ]: Analyzing trace with hash -336498396, now seen corresponding path program 1 times [2018-06-22 11:47:28,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:28,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:28,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:28,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:28,505 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:28,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:28,506 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:47:28,506 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:47:28,506 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:47:28,506 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:47:28,506 INFO ]: Start difference. First operand 33 states and 63 transitions. Second operand 5 states. [2018-06-22 11:47:28,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:28,590 INFO ]: Finished difference Result 33 states and 62 transitions. [2018-06-22 11:47:28,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:47:28,590 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:47:28,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:28,591 INFO ]: With dead ends: 33 [2018-06-22 11:47:28,591 INFO ]: Without dead ends: 32 [2018-06-22 11:47:28,591 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:47:28,591 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:47:28,595 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:47:28,595 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:47:28,598 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2018-06-22 11:47:28,598 INFO ]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 17 [2018-06-22 11:47:28,598 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:28,598 INFO ]: Abstraction has 32 states and 60 transitions. [2018-06-22 11:47:28,598 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:47:28,598 INFO ]: Start isEmpty. Operand 32 states and 60 transitions. [2018-06-22 11:47:28,599 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:28,599 INFO ]: Found error trace [2018-06-22 11:47:28,599 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:28,599 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:28,599 INFO ]: Analyzing trace with hash 641662407, now seen corresponding path program 1 times [2018-06-22 11:47:28,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:28,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:28,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:28,600 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:28,650 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:28,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:28,650 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:47:28,650 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:47:28,651 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:47:28,651 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:28,651 INFO ]: Start difference. First operand 32 states and 60 transitions. Second operand 4 states. [2018-06-22 11:47:28,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:28,737 INFO ]: Finished difference Result 54 states and 116 transitions. [2018-06-22 11:47:28,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:47:28,737 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:47:28,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:28,737 INFO ]: With dead ends: 54 [2018-06-22 11:47:28,737 INFO ]: Without dead ends: 54 [2018-06-22 11:47:28,738 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:47:28,738 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:47:28,745 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-06-22 11:47:28,745 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:47:28,746 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 95 transitions. [2018-06-22 11:47:28,746 INFO ]: Start accepts. Automaton has 46 states and 95 transitions. Word has length 21 [2018-06-22 11:47:28,746 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:28,746 INFO ]: Abstraction has 46 states and 95 transitions. [2018-06-22 11:47:28,746 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:47:28,746 INFO ]: Start isEmpty. Operand 46 states and 95 transitions. [2018-06-22 11:47:28,747 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:28,747 INFO ]: Found error trace [2018-06-22 11:47:28,748 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:28,748 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:28,748 INFO ]: Analyzing trace with hash 2043449545, now seen corresponding path program 1 times [2018-06-22 11:47:28,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:28,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:28,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,748 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:28,748 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:28,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:29,061 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:29,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:29,061 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:29,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:29,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:29,087 INFO ]: Computing forward predicates... [2018-06-22 11:47:29,102 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:29,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:29,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:47:29,121 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:47:29,121 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:47:29,121 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:29,121 INFO ]: Start difference. First operand 46 states and 95 transitions. Second operand 7 states. [2018-06-22 11:47:29,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:29,299 INFO ]: Finished difference Result 87 states and 182 transitions. [2018-06-22 11:47:29,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:47:29,300 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:47:29,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:29,301 INFO ]: With dead ends: 87 [2018-06-22 11:47:29,301 INFO ]: Without dead ends: 87 [2018-06-22 11:47:29,302 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:47:29,302 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:47:29,313 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 65. [2018-06-22 11:47:29,313 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:47:29,315 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 140 transitions. [2018-06-22 11:47:29,315 INFO ]: Start accepts. Automaton has 65 states and 140 transitions. Word has length 21 [2018-06-22 11:47:29,315 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:29,315 INFO ]: Abstraction has 65 states and 140 transitions. [2018-06-22 11:47:29,315 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:47:29,315 INFO ]: Start isEmpty. Operand 65 states and 140 transitions. [2018-06-22 11:47:29,316 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:29,316 INFO ]: Found error trace [2018-06-22 11:47:29,316 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:29,317 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:29,317 INFO ]: Analyzing trace with hash 968902975, now seen corresponding path program 1 times [2018-06-22 11:47:29,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:29,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:29,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:29,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:29,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:29,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:29,463 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:29,463 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:29,463 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:29,469 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:29,482 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:29,485 INFO ]: Computing forward predicates... [2018-06-22 11:47:29,576 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:29,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:29,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:47:29,607 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:47:29,608 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:47:29,608 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:29,608 INFO ]: Start difference. First operand 65 states and 140 transitions. Second operand 11 states. [2018-06-22 11:47:29,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:29,979 INFO ]: Finished difference Result 95 states and 217 transitions. [2018-06-22 11:47:29,980 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:47:29,980 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:47:29,981 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:29,982 INFO ]: With dead ends: 95 [2018-06-22 11:47:29,982 INFO ]: Without dead ends: 95 [2018-06-22 11:47:29,983 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:47:29,983 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:47:29,997 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 67. [2018-06-22 11:47:29,998 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:47:30,003 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 147 transitions. [2018-06-22 11:47:30,003 INFO ]: Start accepts. Automaton has 67 states and 147 transitions. Word has length 21 [2018-06-22 11:47:30,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:30,004 INFO ]: Abstraction has 67 states and 147 transitions. [2018-06-22 11:47:30,004 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:47:30,004 INFO ]: Start isEmpty. Operand 67 states and 147 transitions. [2018-06-22 11:47:30,005 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:30,005 INFO ]: Found error trace [2018-06-22 11:47:30,005 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:30,005 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:30,005 INFO ]: Analyzing trace with hash -1778734713, now seen corresponding path program 2 times [2018-06-22 11:47:30,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:30,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:30,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:30,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:30,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:30,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:30,059 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:30,059 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:30,059 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:47:30,059 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:47:30,059 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:47:30,060 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:30,060 INFO ]: Start difference. First operand 67 states and 147 transitions. Second operand 4 states. [2018-06-22 11:47:30,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:30,295 INFO ]: Finished difference Result 111 states and 236 transitions. [2018-06-22 11:47:30,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:47:30,296 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:47:30,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:30,298 INFO ]: With dead ends: 111 [2018-06-22 11:47:30,298 INFO ]: Without dead ends: 92 [2018-06-22 11:47:30,298 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:47:30,298 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 11:47:30,308 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-06-22 11:47:30,309 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:47:30,310 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 175 transitions. [2018-06-22 11:47:30,310 INFO ]: Start accepts. Automaton has 84 states and 175 transitions. Word has length 21 [2018-06-22 11:47:30,310 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:30,310 INFO ]: Abstraction has 84 states and 175 transitions. [2018-06-22 11:47:30,310 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:47:30,310 INFO ]: Start isEmpty. Operand 84 states and 175 transitions. [2018-06-22 11:47:30,312 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:30,312 INFO ]: Found error trace [2018-06-22 11:47:30,312 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:30,312 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:30,312 INFO ]: Analyzing trace with hash 1530864986, now seen corresponding path program 1 times [2018-06-22 11:47:30,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:30,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:30,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:30,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:30,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:30,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:30,425 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:30,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:30,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:30,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:30,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:30,445 INFO ]: Computing forward predicates... [2018-06-22 11:47:30,497 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:30,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:30,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 11:47:30,529 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:47:30,529 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:47:30,529 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:47:30,529 INFO ]: Start difference. First operand 84 states and 175 transitions. Second operand 10 states. [2018-06-22 11:47:30,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:30,932 INFO ]: Finished difference Result 110 states and 221 transitions. [2018-06-22 11:47:30,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:47:30,932 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:47:30,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:30,934 INFO ]: With dead ends: 110 [2018-06-22 11:47:30,934 INFO ]: Without dead ends: 106 [2018-06-22 11:47:30,934 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:47:30,934 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:47:30,952 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 84. [2018-06-22 11:47:30,952 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:47:30,953 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 174 transitions. [2018-06-22 11:47:30,953 INFO ]: Start accepts. Automaton has 84 states and 174 transitions. Word has length 21 [2018-06-22 11:47:30,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:30,953 INFO ]: Abstraction has 84 states and 174 transitions. [2018-06-22 11:47:30,953 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:47:30,953 INFO ]: Start isEmpty. Operand 84 states and 174 transitions. [2018-06-22 11:47:30,959 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:30,959 INFO ]: Found error trace [2018-06-22 11:47:30,959 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:30,960 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:30,960 INFO ]: Analyzing trace with hash -1104580252, now seen corresponding path program 1 times [2018-06-22 11:47:30,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:30,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:30,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:30,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:30,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:30,968 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:31,464 WARN ]: Spent 267.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:47:31,584 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:31,584 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:31,584 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:31,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:31,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:31,615 INFO ]: Computing forward predicates... [2018-06-22 11:47:31,679 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:31,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:31,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 11:47:31,714 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:47:31,714 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:47:31,714 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:47:31,714 INFO ]: Start difference. First operand 84 states and 174 transitions. Second operand 10 states. [2018-06-22 11:47:31,988 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:31,988 INFO ]: Finished difference Result 108 states and 223 transitions. [2018-06-22 11:47:31,988 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:47:31,988 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:47:31,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:31,990 INFO ]: With dead ends: 108 [2018-06-22 11:47:31,990 INFO ]: Without dead ends: 108 [2018-06-22 11:47:31,990 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:47:31,990 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:47:32,001 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 88. [2018-06-22 11:47:32,001 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:47:32,002 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 186 transitions. [2018-06-22 11:47:32,002 INFO ]: Start accepts. Automaton has 88 states and 186 transitions. Word has length 21 [2018-06-22 11:47:32,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:32,002 INFO ]: Abstraction has 88 states and 186 transitions. [2018-06-22 11:47:32,002 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:47:32,002 INFO ]: Start isEmpty. Operand 88 states and 186 transitions. [2018-06-22 11:47:32,004 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:32,004 INFO ]: Found error trace [2018-06-22 11:47:32,004 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:32,004 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:32,004 INFO ]: Analyzing trace with hash -542618241, now seen corresponding path program 1 times [2018-06-22 11:47:32,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:32,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:32,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:32,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:32,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:32,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:32,176 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:32,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:32,176 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:32,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:32,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:32,201 INFO ]: Computing forward predicates... [2018-06-22 11:47:32,270 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:32,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:32,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 11:47:32,290 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:47:32,290 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:47:32,290 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:47:32,290 INFO ]: Start difference. First operand 88 states and 186 transitions. Second operand 10 states. [2018-06-22 11:47:32,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:32,632 INFO ]: Finished difference Result 106 states and 217 transitions. [2018-06-22 11:47:32,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:47:32,633 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:47:32,633 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:32,634 INFO ]: With dead ends: 106 [2018-06-22 11:47:32,634 INFO ]: Without dead ends: 106 [2018-06-22 11:47:32,635 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:47:32,635 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:47:32,644 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 84. [2018-06-22 11:47:32,644 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:47:32,647 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 174 transitions. [2018-06-22 11:47:32,647 INFO ]: Start accepts. Automaton has 84 states and 174 transitions. Word has length 21 [2018-06-22 11:47:32,647 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:32,647 INFO ]: Abstraction has 84 states and 174 transitions. [2018-06-22 11:47:32,647 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:47:32,647 INFO ]: Start isEmpty. Operand 84 states and 174 transitions. [2018-06-22 11:47:32,649 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:32,649 INFO ]: Found error trace [2018-06-22 11:47:32,649 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:32,649 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:32,649 INFO ]: Analyzing trace with hash 414323044, now seen corresponding path program 2 times [2018-06-22 11:47:32,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:32,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:32,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:32,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:32,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:32,654 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:32,790 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:47:32,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:32,790 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:47:32,790 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:47:32,790 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:47:32,790 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:47:32,791 INFO ]: Start difference. First operand 84 states and 174 transitions. Second operand 4 states. [2018-06-22 11:47:32,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:32,858 INFO ]: Finished difference Result 86 states and 162 transitions. [2018-06-22 11:47:32,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:47:32,858 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:47:32,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:32,859 INFO ]: With dead ends: 86 [2018-06-22 11:47:32,859 INFO ]: Without dead ends: 86 [2018-06-22 11:47:32,860 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:47:32,860 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:47:32,870 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-06-22 11:47:32,870 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:47:32,871 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 134 transitions. [2018-06-22 11:47:32,871 INFO ]: Start accepts. Automaton has 72 states and 134 transitions. Word has length 21 [2018-06-22 11:47:32,871 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:32,871 INFO ]: Abstraction has 72 states and 134 transitions. [2018-06-22 11:47:32,871 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:47:32,871 INFO ]: Start isEmpty. Operand 72 states and 134 transitions. [2018-06-22 11:47:32,872 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:47:32,872 INFO ]: Found error trace [2018-06-22 11:47:32,873 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:32,873 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:32,873 INFO ]: Analyzing trace with hash -1689555740, now seen corresponding path program 1 times [2018-06-22 11:47:32,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:32,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:32,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:32,873 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:32,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:32,877 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:33,346 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:47:33,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:33,346 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:33,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:33,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:33,365 INFO ]: Computing forward predicates... [2018-06-22 11:47:33,467 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:47:33,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:33,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-06-22 11:47:33,486 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:47:33,486 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:47:33,486 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:47:33,486 INFO ]: Start difference. First operand 72 states and 134 transitions. Second operand 15 states. [2018-06-22 11:47:34,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:34,191 INFO ]: Finished difference Result 171 states and 341 transitions. [2018-06-22 11:47:34,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:47:34,192 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:47:34,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:34,194 INFO ]: With dead ends: 171 [2018-06-22 11:47:34,194 INFO ]: Without dead ends: 165 [2018-06-22 11:47:34,195 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:47:34,195 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 11:47:34,207 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 115. [2018-06-22 11:47:34,207 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-22 11:47:34,208 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 234 transitions. [2018-06-22 11:47:34,208 INFO ]: Start accepts. Automaton has 115 states and 234 transitions. Word has length 21 [2018-06-22 11:47:34,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:34,208 INFO ]: Abstraction has 115 states and 234 transitions. [2018-06-22 11:47:34,208 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:47:34,208 INFO ]: Start isEmpty. Operand 115 states and 234 transitions. [2018-06-22 11:47:34,210 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:47:34,210 INFO ]: Found error trace [2018-06-22 11:47:34,210 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:34,210 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:34,210 INFO ]: Analyzing trace with hash -917636085, now seen corresponding path program 1 times [2018-06-22 11:47:34,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:34,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:34,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:34,211 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:34,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:34,215 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:34,277 INFO ]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:47:34,277 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:34,277 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:34,283 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:34,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:34,298 INFO ]: Computing forward predicates... [2018-06-22 11:47:34,324 INFO ]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:47:34,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:34,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:47:34,343 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:47:34,343 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:47:34,343 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:34,343 INFO ]: Start difference. First operand 115 states and 234 transitions. Second operand 8 states. [2018-06-22 11:47:35,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:35,940 INFO ]: Finished difference Result 256 states and 605 transitions. [2018-06-22 11:47:35,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:47:35,940 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:47:35,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:35,943 INFO ]: With dead ends: 256 [2018-06-22 11:47:35,943 INFO ]: Without dead ends: 219 [2018-06-22 11:47:35,943 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:47:35,943 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-22 11:47:35,966 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 178. [2018-06-22 11:47:35,966 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-22 11:47:35,968 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 370 transitions. [2018-06-22 11:47:35,968 INFO ]: Start accepts. Automaton has 178 states and 370 transitions. Word has length 25 [2018-06-22 11:47:35,968 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:35,968 INFO ]: Abstraction has 178 states and 370 transitions. [2018-06-22 11:47:35,968 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:47:35,969 INFO ]: Start isEmpty. Operand 178 states and 370 transitions. [2018-06-22 11:47:35,970 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:47:35,970 INFO ]: Found error trace [2018-06-22 11:47:35,971 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:35,971 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:35,971 INFO ]: Analyzing trace with hash 1236918694, now seen corresponding path program 1 times [2018-06-22 11:47:35,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:35,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:35,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:35,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:35,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:35,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:36,460 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:36,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:36,460 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:36,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:36,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:36,482 INFO ]: Computing forward predicates... [2018-06-22 11:47:36,536 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:47:36,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:36,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:47:36,559 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:47:36,560 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:47:36,560 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:47:36,560 INFO ]: Start difference. First operand 178 states and 370 transitions. Second operand 8 states. [2018-06-22 11:47:36,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:36,791 INFO ]: Finished difference Result 261 states and 606 transitions. [2018-06-22 11:47:36,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:47:36,791 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:47:36,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:36,795 INFO ]: With dead ends: 261 [2018-06-22 11:47:36,795 INFO ]: Without dead ends: 261 [2018-06-22 11:47:36,795 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:47:36,795 INFO ]: Start minimizeSevpa. Operand 261 states. [2018-06-22 11:47:36,813 INFO ]: Finished minimizeSevpa. Reduced states from 261 to 207. [2018-06-22 11:47:36,813 INFO ]: Start removeUnreachable. Operand 207 states. [2018-06-22 11:47:36,815 INFO ]: Finished removeUnreachable. Reduced from 207 states to 207 states and 458 transitions. [2018-06-22 11:47:36,815 INFO ]: Start accepts. Automaton has 207 states and 458 transitions. Word has length 25 [2018-06-22 11:47:36,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:36,815 INFO ]: Abstraction has 207 states and 458 transitions. [2018-06-22 11:47:36,815 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:47:36,816 INFO ]: Start isEmpty. Operand 207 states and 458 transitions. [2018-06-22 11:47:36,818 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:47:36,818 INFO ]: Found error trace [2018-06-22 11:47:36,818 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:36,818 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:36,818 INFO ]: Analyzing trace with hash 1222776432, now seen corresponding path program 1 times [2018-06-22 11:47:36,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:36,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:36,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:36,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:36,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:36,826 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:37,094 INFO ]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:37,094 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:47:37,094 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:47:37,095 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:47:37,095 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:47:37,095 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:37,095 INFO ]: Start difference. First operand 207 states and 458 transitions. Second operand 7 states. [2018-06-22 11:47:37,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:37,323 INFO ]: Finished difference Result 237 states and 503 transitions. [2018-06-22 11:47:37,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:47:37,324 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:47:37,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:37,327 INFO ]: With dead ends: 237 [2018-06-22 11:47:37,327 INFO ]: Without dead ends: 234 [2018-06-22 11:47:37,327 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:47:37,327 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-22 11:47:37,343 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 196. [2018-06-22 11:47:37,343 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-22 11:47:37,345 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 376 transitions. [2018-06-22 11:47:37,345 INFO ]: Start accepts. Automaton has 196 states and 376 transitions. Word has length 25 [2018-06-22 11:47:37,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:37,345 INFO ]: Abstraction has 196 states and 376 transitions. [2018-06-22 11:47:37,345 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:47:37,345 INFO ]: Start isEmpty. Operand 196 states and 376 transitions. [2018-06-22 11:47:37,347 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:47:37,347 INFO ]: Found error trace [2018-06-22 11:47:37,347 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:37,347 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:37,347 INFO ]: Analyzing trace with hash -1058101559, now seen corresponding path program 1 times [2018-06-22 11:47:37,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:37,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:37,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:37,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:37,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:37,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:37,634 INFO ]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:47:37,645 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:37,645 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:37,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:37,670 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:37,672 INFO ]: Computing forward predicates... [2018-06-22 11:47:37,680 INFO ]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:47:37,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:37,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:47:37,700 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:47:37,700 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:47:37,700 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:47:37,700 INFO ]: Start difference. First operand 196 states and 376 transitions. Second operand 7 states. [2018-06-22 11:47:37,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:37,953 INFO ]: Finished difference Result 226 states and 438 transitions. [2018-06-22 11:47:37,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:47:37,954 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:47:37,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:37,957 INFO ]: With dead ends: 226 [2018-06-22 11:47:37,957 INFO ]: Without dead ends: 209 [2018-06-22 11:47:37,957 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:47:37,957 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-22 11:47:37,969 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 187. [2018-06-22 11:47:37,969 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-22 11:47:37,971 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 327 transitions. [2018-06-22 11:47:37,971 INFO ]: Start accepts. Automaton has 187 states and 327 transitions. Word has length 25 [2018-06-22 11:47:37,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:37,971 INFO ]: Abstraction has 187 states and 327 transitions. [2018-06-22 11:47:37,971 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:47:37,971 INFO ]: Start isEmpty. Operand 187 states and 327 transitions. [2018-06-22 11:47:37,973 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:47:37,973 INFO ]: Found error trace [2018-06-22 11:47:37,973 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:37,973 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:37,973 INFO ]: Analyzing trace with hash -1863209325, now seen corresponding path program 1 times [2018-06-22 11:47:37,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:37,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:37,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:37,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:37,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:37,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:38,111 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:47:38,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:38,111 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:38,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:38,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:38,131 INFO ]: Computing forward predicates... [2018-06-22 11:47:38,151 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:47:38,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:38,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:47:38,172 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:47:38,172 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:47:38,172 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:47:38,172 INFO ]: Start difference. First operand 187 states and 327 transitions. Second operand 9 states. [2018-06-22 11:47:38,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:38,315 INFO ]: Finished difference Result 225 states and 391 transitions. [2018-06-22 11:47:38,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:47:38,316 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:47:38,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:38,318 INFO ]: With dead ends: 225 [2018-06-22 11:47:38,318 INFO ]: Without dead ends: 223 [2018-06-22 11:47:38,318 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:47:38,318 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-22 11:47:38,338 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 187. [2018-06-22 11:47:38,338 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-22 11:47:38,339 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 323 transitions. [2018-06-22 11:47:38,339 INFO ]: Start accepts. Automaton has 187 states and 323 transitions. Word has length 25 [2018-06-22 11:47:38,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:38,339 INFO ]: Abstraction has 187 states and 323 transitions. [2018-06-22 11:47:38,339 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:47:38,339 INFO ]: Start isEmpty. Operand 187 states and 323 transitions. [2018-06-22 11:47:38,341 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:47:38,341 INFO ]: Found error trace [2018-06-22 11:47:38,341 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:38,341 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:38,341 INFO ]: Analyzing trace with hash 1914543369, now seen corresponding path program 2 times [2018-06-22 11:47:38,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:38,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:38,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:38,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:38,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:38,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:38,588 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:47:38,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:38,588 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:38,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:38,610 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:38,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:38,613 INFO ]: Computing forward predicates... [2018-06-22 11:47:38,712 INFO ]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:47:38,732 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:38,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:47:38,732 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:47:38,732 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:47:38,732 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:47:38,732 INFO ]: Start difference. First operand 187 states and 323 transitions. Second operand 16 states. [2018-06-22 11:47:39,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:39,140 INFO ]: Finished difference Result 249 states and 427 transitions. [2018-06-22 11:47:39,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:47:39,142 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:47:39,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:39,144 INFO ]: With dead ends: 249 [2018-06-22 11:47:39,144 INFO ]: Without dead ends: 182 [2018-06-22 11:47:39,144 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:47:39,144 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:47:39,153 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 156. [2018-06-22 11:47:39,153 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-22 11:47:39,155 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 269 transitions. [2018-06-22 11:47:39,155 INFO ]: Start accepts. Automaton has 156 states and 269 transitions. Word has length 25 [2018-06-22 11:47:39,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:39,155 INFO ]: Abstraction has 156 states and 269 transitions. [2018-06-22 11:47:39,155 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:47:39,155 INFO ]: Start isEmpty. Operand 156 states and 269 transitions. [2018-06-22 11:47:39,157 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:47:39,157 INFO ]: Found error trace [2018-06-22 11:47:39,157 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:39,157 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:39,157 INFO ]: Analyzing trace with hash 1971785264, now seen corresponding path program 1 times [2018-06-22 11:47:39,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:39,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:39,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:39,157 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:39,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:39,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:39,846 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:47:39,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:39,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:39,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:39,870 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:39,874 INFO ]: Computing forward predicates... [2018-06-22 11:47:39,962 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:47:39,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:39,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:47:39,981 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:47:39,981 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:47:39,981 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:39,981 INFO ]: Start difference. First operand 156 states and 269 transitions. Second operand 11 states. [2018-06-22 11:47:40,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:40,314 INFO ]: Finished difference Result 180 states and 323 transitions. [2018-06-22 11:47:40,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:47:40,314 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:47:40,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:40,315 INFO ]: With dead ends: 180 [2018-06-22 11:47:40,315 INFO ]: Without dead ends: 168 [2018-06-22 11:47:40,316 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:47:40,316 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:47:40,326 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 145. [2018-06-22 11:47:40,326 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 11:47:40,327 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 241 transitions. [2018-06-22 11:47:40,327 INFO ]: Start accepts. Automaton has 145 states and 241 transitions. Word has length 29 [2018-06-22 11:47:40,327 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:40,327 INFO ]: Abstraction has 145 states and 241 transitions. [2018-06-22 11:47:40,327 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:47:40,327 INFO ]: Start isEmpty. Operand 145 states and 241 transitions. [2018-06-22 11:47:40,329 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:47:40,329 INFO ]: Found error trace [2018-06-22 11:47:40,329 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:40,329 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:40,329 INFO ]: Analyzing trace with hash 1965952653, now seen corresponding path program 2 times [2018-06-22 11:47:40,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:40,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:40,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:40,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:40,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:40,336 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:40,507 INFO ]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:40,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:40,507 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:40,513 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:40,530 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:40,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:40,532 INFO ]: Computing forward predicates... [2018-06-22 11:47:40,603 INFO ]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:40,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:40,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:47:40,635 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:47:40,635 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:47:40,635 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:40,635 INFO ]: Start difference. First operand 145 states and 241 transitions. Second operand 11 states. [2018-06-22 11:47:41,183 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 11:47:41,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:41,915 INFO ]: Finished difference Result 173 states and 297 transitions. [2018-06-22 11:47:41,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:47:41,915 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:47:41,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:41,916 INFO ]: With dead ends: 173 [2018-06-22 11:47:41,916 INFO ]: Without dead ends: 173 [2018-06-22 11:47:41,917 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:47:41,917 INFO ]: Start minimizeSevpa. Operand 173 states. [2018-06-22 11:47:41,925 INFO ]: Finished minimizeSevpa. Reduced states from 173 to 147. [2018-06-22 11:47:41,925 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-22 11:47:41,927 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 243 transitions. [2018-06-22 11:47:41,927 INFO ]: Start accepts. Automaton has 147 states and 243 transitions. Word has length 29 [2018-06-22 11:47:41,927 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:41,927 INFO ]: Abstraction has 147 states and 243 transitions. [2018-06-22 11:47:41,927 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:47:41,927 INFO ]: Start isEmpty. Operand 147 states and 243 transitions. [2018-06-22 11:47:41,928 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:47:41,928 INFO ]: Found error trace [2018-06-22 11:47:41,928 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:41,928 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:41,928 INFO ]: Analyzing trace with hash -1679409752, now seen corresponding path program 2 times [2018-06-22 11:47:41,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:41,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:41,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:41,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:41,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:41,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:42,258 WARN ]: Spent 194.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-06-22 11:47:42,392 INFO ]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:42,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:42,392 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:42,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:42,415 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:42,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:42,417 INFO ]: Computing forward predicates... [2018-06-22 11:47:42,484 INFO ]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:42,503 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:42,503 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:47:42,503 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:47:42,503 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:47:42,503 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:42,504 INFO ]: Start difference. First operand 147 states and 243 transitions. Second operand 11 states. [2018-06-22 11:47:42,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:42,667 INFO ]: Finished difference Result 173 states and 296 transitions. [2018-06-22 11:47:42,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:47:42,689 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:47:42,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:42,690 INFO ]: With dead ends: 173 [2018-06-22 11:47:42,690 INFO ]: Without dead ends: 170 [2018-06-22 11:47:42,691 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:47:42,691 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 11:47:42,698 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 144. [2018-06-22 11:47:42,698 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 11:47:42,700 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 237 transitions. [2018-06-22 11:47:42,700 INFO ]: Start accepts. Automaton has 144 states and 237 transitions. Word has length 29 [2018-06-22 11:47:42,700 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:42,700 INFO ]: Abstraction has 144 states and 237 transitions. [2018-06-22 11:47:42,700 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:47:42,700 INFO ]: Start isEmpty. Operand 144 states and 237 transitions. [2018-06-22 11:47:42,701 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:47:42,701 INFO ]: Found error trace [2018-06-22 11:47:42,701 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:42,701 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:42,701 INFO ]: Analyzing trace with hash 1675086320, now seen corresponding path program 1 times [2018-06-22 11:47:42,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:42,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:42,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:42,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:42,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:42,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:43,215 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:47:43,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:43,215 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:43,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:43,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:43,241 INFO ]: Computing forward predicates... [2018-06-22 11:47:43,346 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:47:43,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:43,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-22 11:47:43,365 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:47:43,366 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:47:43,366 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:47:43,366 INFO ]: Start difference. First operand 144 states and 237 transitions. Second operand 12 states. [2018-06-22 11:47:43,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:43,635 INFO ]: Finished difference Result 166 states and 281 transitions. [2018-06-22 11:47:43,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:47:43,636 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 11:47:43,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:43,637 INFO ]: With dead ends: 166 [2018-06-22 11:47:43,637 INFO ]: Without dead ends: 162 [2018-06-22 11:47:43,637 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:47:43,637 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-22 11:47:43,644 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 139. [2018-06-22 11:47:43,645 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-22 11:47:43,646 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 224 transitions. [2018-06-22 11:47:43,646 INFO ]: Start accepts. Automaton has 139 states and 224 transitions. Word has length 29 [2018-06-22 11:47:43,646 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:43,646 INFO ]: Abstraction has 139 states and 224 transitions. [2018-06-22 11:47:43,646 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:47:43,646 INFO ]: Start isEmpty. Operand 139 states and 224 transitions. [2018-06-22 11:47:43,648 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:47:43,648 INFO ]: Found error trace [2018-06-22 11:47:43,648 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:43,648 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:43,648 INFO ]: Analyzing trace with hash -1135603811, now seen corresponding path program 2 times [2018-06-22 11:47:43,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:43,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:43,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:43,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:43,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:43,653 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:43,736 INFO ]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:47:43,736 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:43,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:43,743 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:43,758 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:43,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:43,760 INFO ]: Computing forward predicates... [2018-06-22 11:47:43,809 INFO ]: Checked inductivity of 23 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:47:43,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:43,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-06-22 11:47:43,829 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:47:43,829 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:47:43,829 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:47:43,829 INFO ]: Start difference. First operand 139 states and 224 transitions. Second operand 15 states. [2018-06-22 11:47:44,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:44,230 INFO ]: Finished difference Result 143 states and 214 transitions. [2018-06-22 11:47:44,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:47:44,230 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:47:44,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:44,231 INFO ]: With dead ends: 143 [2018-06-22 11:47:44,231 INFO ]: Without dead ends: 97 [2018-06-22 11:47:44,231 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:47:44,231 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:47:44,235 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-06-22 11:47:44,235 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:47:44,236 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2018-06-22 11:47:44,236 INFO ]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 29 [2018-06-22 11:47:44,236 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:44,236 INFO ]: Abstraction has 83 states and 123 transitions. [2018-06-22 11:47:44,236 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:47:44,236 INFO ]: Start isEmpty. Operand 83 states and 123 transitions. [2018-06-22 11:47:44,237 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:44,237 INFO ]: Found error trace [2018-06-22 11:47:44,237 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:44,237 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:44,237 INFO ]: Analyzing trace with hash 1643304343, now seen corresponding path program 1 times [2018-06-22 11:47:44,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:44,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:44,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:44,237 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:44,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:44,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:44,417 INFO ]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:47:44,418 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:44,418 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-22 11:47:44,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:44,451 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:44,453 INFO ]: Computing forward predicates... [2018-06-22 11:47:44,512 INFO ]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:47:44,532 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:44,532 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:47:44,532 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:47:44,532 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:47:44,532 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:44,532 INFO ]: Start difference. First operand 83 states and 123 transitions. Second operand 11 states. [2018-06-22 11:47:44,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:44,938 INFO ]: Finished difference Result 103 states and 157 transitions. [2018-06-22 11:47:44,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:47:44,938 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:47:44,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:44,939 INFO ]: With dead ends: 103 [2018-06-22 11:47:44,939 INFO ]: Without dead ends: 103 [2018-06-22 11:47:44,939 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:47:44,939 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 11:47:44,943 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-06-22 11:47:44,943 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 11:47:44,944 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2018-06-22 11:47:44,944 INFO ]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 33 [2018-06-22 11:47:44,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:44,944 INFO ]: Abstraction has 83 states and 122 transitions. [2018-06-22 11:47:44,944 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:47:44,944 INFO ]: Start isEmpty. Operand 83 states and 122 transitions. [2018-06-22 11:47:44,944 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:44,944 INFO ]: Found error trace [2018-06-22 11:47:44,945 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:44,945 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:44,945 INFO ]: Analyzing trace with hash 884379186, now seen corresponding path program 2 times [2018-06-22 11:47:44,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:44,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:44,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:44,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:44,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:44,954 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:45,284 INFO ]: Checked inductivity of 35 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:47:45,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:45,285 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:45,292 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:45,322 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:45,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:45,325 INFO ]: Computing forward predicates... [2018-06-22 11:47:45,532 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:47:45,562 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:45,562 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-06-22 11:47:45,562 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:47:45,562 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:47:45,562 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:47:45,562 INFO ]: Start difference. First operand 83 states and 122 transitions. Second operand 25 states. [2018-06-22 11:47:46,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:46,378 INFO ]: Finished difference Result 159 states and 248 transitions. [2018-06-22 11:47:46,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:47:46,379 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:47:46,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:46,379 INFO ]: With dead ends: 159 [2018-06-22 11:47:46,379 INFO ]: Without dead ends: 147 [2018-06-22 11:47:46,380 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:47:46,380 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 11:47:46,386 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 99. [2018-06-22 11:47:46,386 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:47:46,386 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2018-06-22 11:47:46,387 INFO ]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 33 [2018-06-22 11:47:46,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:46,387 INFO ]: Abstraction has 99 states and 152 transitions. [2018-06-22 11:47:46,387 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:47:46,387 INFO ]: Start isEmpty. Operand 99 states and 152 transitions. [2018-06-22 11:47:46,387 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:46,388 INFO ]: Found error trace [2018-06-22 11:47:46,388 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:46,388 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:46,388 INFO ]: Analyzing trace with hash -1151620622, now seen corresponding path program 2 times [2018-06-22 11:47:46,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:46,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:46,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:46,388 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:46,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:46,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:46,616 INFO ]: Checked inductivity of 35 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:47:46,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:46,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:46,621 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:46,641 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:46,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:46,643 INFO ]: Computing forward predicates... [2018-06-22 11:47:46,829 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:47:46,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:46,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-06-22 11:47:46,848 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:47:46,848 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:47:46,849 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:47:46,849 INFO ]: Start difference. First operand 99 states and 152 transitions. Second operand 25 states. [2018-06-22 11:47:47,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:47,689 INFO ]: Finished difference Result 169 states and 266 transitions. [2018-06-22 11:47:47,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:47:47,689 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:47:47,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:47,690 INFO ]: With dead ends: 169 [2018-06-22 11:47:47,690 INFO ]: Without dead ends: 169 [2018-06-22 11:47:47,691 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:47:47,691 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-22 11:47:47,697 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 99. [2018-06-22 11:47:47,697 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:47:47,697 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 149 transitions. [2018-06-22 11:47:47,697 INFO ]: Start accepts. Automaton has 99 states and 149 transitions. Word has length 33 [2018-06-22 11:47:47,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:47,698 INFO ]: Abstraction has 99 states and 149 transitions. [2018-06-22 11:47:47,698 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:47:47,698 INFO ]: Start isEmpty. Operand 99 states and 149 transitions. [2018-06-22 11:47:47,698 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:47,698 INFO ]: Found error trace [2018-06-22 11:47:47,698 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:47,699 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:47,699 INFO ]: Analyzing trace with hash -1910545779, now seen corresponding path program 1 times [2018-06-22 11:47:47,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:47,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:47,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:47,699 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:47,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:47,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:47,930 INFO ]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:47:47,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:47,930 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:47,936 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:47,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:47,958 INFO ]: Computing forward predicates... [2018-06-22 11:47:48,015 INFO ]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:47:48,033 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:48,033 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:47:48,034 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:47:48,034 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:47:48,034 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:47:48,034 INFO ]: Start difference. First operand 99 states and 149 transitions. Second operand 11 states. [2018-06-22 11:47:48,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:48,167 INFO ]: Finished difference Result 123 states and 181 transitions. [2018-06-22 11:47:48,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:47:48,167 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:47:48,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:48,168 INFO ]: With dead ends: 123 [2018-06-22 11:47:48,168 INFO ]: Without dead ends: 96 [2018-06-22 11:47:48,168 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:47:48,168 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 11:47:48,171 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 74. [2018-06-22 11:47:48,171 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:47:48,171 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2018-06-22 11:47:48,171 INFO ]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 33 [2018-06-22 11:47:48,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:48,172 INFO ]: Abstraction has 74 states and 109 transitions. [2018-06-22 11:47:48,172 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:47:48,172 INFO ]: Start isEmpty. Operand 74 states and 109 transitions. [2018-06-22 11:47:48,172 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:47:48,172 INFO ]: Found error trace [2018-06-22 11:47:48,172 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:48,172 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:48,172 INFO ]: Analyzing trace with hash -1603268620, now seen corresponding path program 3 times [2018-06-22 11:47:48,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:48,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:48,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:48,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:48,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:48,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:48,455 INFO ]: Checked inductivity of 52 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:47:48,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:48,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:48,461 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:48,484 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:47:48,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:48,487 INFO ]: Computing forward predicates... [2018-06-22 11:47:48,676 INFO ]: Checked inductivity of 52 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:47:48,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:48,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-06-22 11:47:48,695 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:47:48,695 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:47:48,695 INFO ]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:47:48,695 INFO ]: Start difference. First operand 74 states and 109 transitions. Second operand 24 states. [2018-06-22 11:47:49,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:49,827 INFO ]: Finished difference Result 114 states and 172 transitions. [2018-06-22 11:47:49,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:47:49,827 INFO ]: Start accepts. Automaton has 24 states. Word has length 37 [2018-06-22 11:47:49,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:49,827 INFO ]: With dead ends: 114 [2018-06-22 11:47:49,827 INFO ]: Without dead ends: 104 [2018-06-22 11:47:49,828 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=1241, Unknown=1, NotChecked=0, Total=1406 [2018-06-22 11:47:49,828 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:47:49,832 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-06-22 11:47:49,832 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:47:49,833 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2018-06-22 11:47:49,833 INFO ]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 37 [2018-06-22 11:47:49,833 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:49,833 INFO ]: Abstraction has 72 states and 105 transitions. [2018-06-22 11:47:49,833 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:47:49,833 INFO ]: Start isEmpty. Operand 72 states and 105 transitions. [2018-06-22 11:47:49,833 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:47:49,833 INFO ]: Found error trace [2018-06-22 11:47:49,833 INFO ]: trace histogram [7, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:49,833 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:49,834 INFO ]: Analyzing trace with hash 308207350, now seen corresponding path program 3 times [2018-06-22 11:47:49,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:49,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:49,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:49,834 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:49,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:49,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:50,395 WARN ]: Spent 274.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:47:50,610 INFO ]: Checked inductivity of 73 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:47:50,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:50,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:50,616 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:50,659 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:47:50,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:50,663 INFO ]: Computing forward predicates... [2018-06-22 11:47:51,135 INFO ]: Checked inductivity of 73 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:47:51,154 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:51,154 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-06-22 11:47:51,154 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:47:51,154 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:47:51,154 INFO ]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:47:51,154 INFO ]: Start difference. First operand 72 states and 105 transitions. Second operand 29 states. [2018-06-22 11:47:52,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:52,493 INFO ]: Finished difference Result 162 states and 251 transitions. [2018-06-22 11:47:52,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:47:52,494 INFO ]: Start accepts. Automaton has 29 states. Word has length 41 [2018-06-22 11:47:52,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:52,495 INFO ]: With dead ends: 162 [2018-06-22 11:47:52,495 INFO ]: Without dead ends: 150 [2018-06-22 11:47:52,495 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:47:52,496 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-22 11:47:52,502 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 90. [2018-06-22 11:47:52,502 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 11:47:52,502 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-06-22 11:47:52,502 INFO ]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 41 [2018-06-22 11:47:52,502 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:52,502 INFO ]: Abstraction has 90 states and 139 transitions. [2018-06-22 11:47:52,502 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:47:52,502 INFO ]: Start isEmpty. Operand 90 states and 139 transitions. [2018-06-22 11:47:52,503 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:47:52,503 INFO ]: Found error trace [2018-06-22 11:47:52,503 INFO ]: trace histogram [8, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:52,503 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:52,503 INFO ]: Analyzing trace with hash -1472921352, now seen corresponding path program 4 times [2018-06-22 11:47:52,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:52,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:52,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:52,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:52,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:52,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:52,716 INFO ]: Checked inductivity of 98 backedges. 25 proven. 41 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:47:52,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:52,723 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:47:52,729 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:47:52,774 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:47:52,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:52,784 INFO ]: Computing forward predicates... [2018-06-22 11:47:53,135 INFO ]: Checked inductivity of 98 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:47:53,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:53,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-06-22 11:47:53,154 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:47:53,154 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:47:53,154 INFO ]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:47:53,154 INFO ]: Start difference. First operand 90 states and 139 transitions. Second operand 26 states. [2018-06-22 11:47:54,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:54,172 INFO ]: Finished difference Result 148 states and 233 transitions. [2018-06-22 11:47:54,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:47:54,172 INFO ]: Start accepts. Automaton has 26 states. Word has length 45 [2018-06-22 11:47:54,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:54,172 INFO ]: With dead ends: 148 [2018-06-22 11:47:54,172 INFO ]: Without dead ends: 0 [2018-06-22 11:47:54,173 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:47:54,173 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:47:54,173 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:47:54,173 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:47:54,173 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:47:54,173 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-06-22 11:47:54,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:54,173 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:47:54,173 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:47:54,173 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:47:54,173 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:47:54,269 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:47:54 BoogieIcfgContainer [2018-06-22 11:47:54,269 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:47:54,270 INFO ]: Toolchain (without parser) took 32386.62 ms. Allocated memory was 309.3 MB in the beginning and 654.3 MB in the end (delta: 345.0 MB). Free memory was 263.9 MB in the beginning and 633.6 MB in the end (delta: -369.7 MB). Peak memory consumption was 80.8 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:54,270 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:47:54,270 INFO ]: ChcToBoogie took 66.66 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:54,271 INFO ]: Boogie Preprocessor took 48.18 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:54,271 INFO ]: RCFGBuilder took 349.11 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:54,271 INFO ]: TraceAbstraction took 31912.33 ms. Allocated memory was 309.3 MB in the beginning and 654.3 MB in the end (delta: 345.0 MB). Free memory was 248.9 MB in the beginning and 633.6 MB in the end (delta: -384.7 MB). Peak memory consumption was 65.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:54,273 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.66 ms. Allocated memory is still 309.3 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.18 ms. Allocated memory is still 309.3 MB. Free memory was 261.9 MB in the beginning and 259.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 349.11 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 31912.33 ms. Allocated memory was 309.3 MB in the beginning and 654.3 MB in the end (delta: 345.0 MB). Free memory was 248.9 MB in the beginning and 633.6 MB in the end (delta: -384.7 MB). Peak memory consumption was 65.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 31.8s OverallTime, 40 OverallIterations, 8 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1232 SDtfs, 309 SDslu, 5953 SDs, 0 SdLazy, 8608 SolverSat, 756 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1296 GetRequests, 636 SyntacticMatches, 103 SemanticMatches, 557 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 849 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1651 NumberOfCodeBlocks, 1651 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 1584 ConstructedInterpolants, 8 QuantifiedInterpolants, 223780 SizeOfPredicates, 219 NumberOfNonLiveVariables, 4070 ConjunctsInSsa, 1433 ConjunctsInUnsatCore, 67 InterpolantComputations, 13 PerfectInterpolantSequences, 666/1258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strpbrk_3.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-47-54-283.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strpbrk_3.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-47-54-283.csv Received shutdown request...