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/eldarica-misc/LIA/reve/008-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:11:25,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:11:25,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:11:25,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:11:25,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:11:25,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:11:25,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:11:25,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:11:25,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:11:25,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:11:25,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:11:25,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:11:25,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:11:25,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:11:25,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:11:25,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:11:25,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:11:25,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:11:25,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:11:25,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:11:25,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:11:25,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:11:25,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:11:25,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:11:25,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:11:25,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:11:25,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:11:25,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:11:25,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:11:25,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:11:25,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:11:25,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:11:25,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:11:25,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:11:25,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:11:25,437 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:11:25,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:11:25,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:11:25,462 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:11:25,462 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:11:25,463 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:11:25,463 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:11:25,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:11:25,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:11:25,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:11:25,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:11:25,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:11:25,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:11:25,464 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:11:25,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:11:25,465 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:11:25,465 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:11:25,465 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:11:25,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:11:25,466 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:11:25,467 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:11:25,467 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:11:25,519 INFO ]: Repository-Root is: /tmp [2018-06-22 11:11:25,535 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:11:25,541 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:11:25,542 INFO ]: Initializing SmtParser... [2018-06-22 11:11:25,542 INFO ]: SmtParser initialized [2018-06-22 11:11:25,543 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-22 11:11:25,544 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:11:25,622 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 unknown [2018-06-22 11:11:25,852 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-22 11:11:25,857 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:11:25,862 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:11:25,863 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:11:25,863 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:11:25,863 INFO ]: ChcToBoogie initialized [2018-06-22 11:11:25,867 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,910 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25 Unit [2018-06-22 11:11:25,911 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:11:25,912 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:11:25,912 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:11:25,912 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:11:25,934 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,934 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,942 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,942 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,947 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,954 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,955 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (1/1) ... [2018-06-22 11:11:25,959 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:11:25,960 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:11:25,960 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:11:25,960 INFO ]: RCFGBuilder initialized [2018-06-22 11:11:25,961 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (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:11:25,977 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:11:25,977 INFO ]: Found specification of procedure False [2018-06-22 11:11:25,977 INFO ]: Found implementation of procedure False [2018-06-22 11:11:25,977 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:11:25,977 INFO ]: Found specification of procedure INV1 [2018-06-22 11:11:25,977 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:11:25,977 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:11:25,977 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:11:25,977 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:11:26,423 INFO ]: Using library mode [2018-06-22 11:11:26,423 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:11:26 BoogieIcfgContainer [2018-06-22 11:11:26,424 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:11:26,429 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:11:26,429 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:11:26,433 INFO ]: TraceAbstraction initialized [2018-06-22 11:11:26,433 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:11:25" (1/3) ... [2018-06-22 11:11:26,434 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1521ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:11:26, skipping insertion in model container [2018-06-22 11:11:26,434 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:11:25" (2/3) ... [2018-06-22 11:11:26,434 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1521ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:11:26, skipping insertion in model container [2018-06-22 11:11:26,434 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:11:26" (3/3) ... [2018-06-22 11:11:26,436 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:11:26,446 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:11:26,459 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:11:26,509 INFO ]: Using default assertion order modulation [2018-06-22 11:11:26,510 INFO ]: Interprodecural is true [2018-06-22 11:11:26,510 INFO ]: Hoare is false [2018-06-22 11:11:26,510 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:11:26,510 INFO ]: Backedges is TWOTRACK [2018-06-22 11:11:26,510 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:11:26,510 INFO ]: Difference is false [2018-06-22 11:11:26,510 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:11:26,510 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:11:26,531 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:11:26,555 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:11:26,555 INFO ]: Found error trace [2018-06-22 11:11:26,557 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:26,557 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:26,563 INFO ]: Analyzing trace with hash -355109999, now seen corresponding path program 1 times [2018-06-22 11:11:26,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:26,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:26,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:26,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:26,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:26,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:26,744 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:11:26,748 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:26,749 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:26,751 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:26,761 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:26,762 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:26,764 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-22 11:11:27,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:27,262 INFO ]: Finished difference Result 23 states and 54 transitions. [2018-06-22 11:11:27,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:27,264 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:11:27,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:27,281 INFO ]: With dead ends: 23 [2018-06-22 11:11:27,281 INFO ]: Without dead ends: 23 [2018-06-22 11:11:27,283 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:11:27,297 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:11:27,329 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:11:27,330 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:11:27,332 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2018-06-22 11:11:27,334 INFO ]: Start accepts. Automaton has 23 states and 54 transitions. Word has length 9 [2018-06-22 11:11:27,335 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:27,335 INFO ]: Abstraction has 23 states and 54 transitions. [2018-06-22 11:11:27,335 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:27,335 INFO ]: Start isEmpty. Operand 23 states and 54 transitions. [2018-06-22 11:11:27,340 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:27,340 INFO ]: Found error trace [2018-06-22 11:11:27,340 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:27,340 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:27,340 INFO ]: Analyzing trace with hash 2003335094, now seen corresponding path program 1 times [2018-06-22 11:11:27,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:27,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:27,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:27,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:27,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:27,355 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:27,409 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:11:27,409 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:27,409 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:27,411 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:27,411 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:27,411 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:27,411 INFO ]: Start difference. First operand 23 states and 54 transitions. Second operand 4 states. [2018-06-22 11:11:28,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:28,512 INFO ]: Finished difference Result 39 states and 132 transitions. [2018-06-22 11:11:28,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:28,514 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:11:28,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:28,518 INFO ]: With dead ends: 39 [2018-06-22 11:11:28,518 INFO ]: Without dead ends: 39 [2018-06-22 11:11:28,519 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:11:28,519 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:11:28,544 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 11:11:28,544 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:11:28,547 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 101 transitions. [2018-06-22 11:11:28,547 INFO ]: Start accepts. Automaton has 35 states and 101 transitions. Word has length 13 [2018-06-22 11:11:28,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:28,547 INFO ]: Abstraction has 35 states and 101 transitions. [2018-06-22 11:11:28,547 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:28,547 INFO ]: Start isEmpty. Operand 35 states and 101 transitions. [2018-06-22 11:11:28,551 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:28,551 INFO ]: Found error trace [2018-06-22 11:11:28,551 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:28,552 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:28,552 INFO ]: Analyzing trace with hash -1555879643, now seen corresponding path program 1 times [2018-06-22 11:11:28,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:28,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:28,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:28,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:28,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:28,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:28,923 WARN ]: Spent 199.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 11:11:29,057 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:11:29,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:29,057 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:11:29,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:29,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:29,116 INFO ]: Computing forward predicates... [2018-06-22 11:11:29,608 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:11:29,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:29,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:11:29,639 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:11:29,639 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:11:29,639 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:29,639 INFO ]: Start difference. First operand 35 states and 101 transitions. Second operand 9 states. [2018-06-22 11:11:30,578 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:11:30,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:30,948 INFO ]: Finished difference Result 55 states and 224 transitions. [2018-06-22 11:11:30,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:11:30,950 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:11:30,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:30,955 INFO ]: With dead ends: 55 [2018-06-22 11:11:30,955 INFO ]: Without dead ends: 55 [2018-06-22 11:11:30,955 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:30,955 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:11:30,983 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-06-22 11:11:30,983 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:11:30,985 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 162 transitions. [2018-06-22 11:11:30,985 INFO ]: Start accepts. Automaton has 43 states and 162 transitions. Word has length 13 [2018-06-22 11:11:30,985 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:30,985 INFO ]: Abstraction has 43 states and 162 transitions. [2018-06-22 11:11:30,985 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:11:30,985 INFO ]: Start isEmpty. Operand 43 states and 162 transitions. [2018-06-22 11:11:30,989 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:30,989 INFO ]: Found error trace [2018-06-22 11:11:30,989 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:30,989 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:30,989 INFO ]: Analyzing trace with hash -2143856045, now seen corresponding path program 1 times [2018-06-22 11:11:30,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:30,989 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:30,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:30,990 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:30,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:30,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,066 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:11:31,066 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:31,066 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:31,067 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:31,067 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:31,067 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:31,067 INFO ]: Start difference. First operand 43 states and 162 transitions. Second operand 4 states. [2018-06-22 11:11:31,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:31,370 INFO ]: Finished difference Result 69 states and 335 transitions. [2018-06-22 11:11:31,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:31,371 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:11:31,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:31,376 INFO ]: With dead ends: 69 [2018-06-22 11:11:31,376 INFO ]: Without dead ends: 69 [2018-06-22 11:11:31,376 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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:11:31,376 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:11:31,407 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-06-22 11:11:31,407 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:11:31,409 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 260 transitions. [2018-06-22 11:11:31,410 INFO ]: Start accepts. Automaton has 57 states and 260 transitions. Word has length 13 [2018-06-22 11:11:31,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:31,410 INFO ]: Abstraction has 57 states and 260 transitions. [2018-06-22 11:11:31,410 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:31,410 INFO ]: Start isEmpty. Operand 57 states and 260 transitions. [2018-06-22 11:11:31,414 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:31,414 INFO ]: Found error trace [2018-06-22 11:11:31,414 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:31,414 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:31,414 INFO ]: Analyzing trace with hash -1801130496, now seen corresponding path program 1 times [2018-06-22 11:11:31,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:31,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:31,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:31,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:31,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:31,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,490 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:11:31,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:31,490 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:11:31,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:31,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:31,516 INFO ]: Computing forward predicates... [2018-06-22 11:11:31,575 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:11:31,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:31,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:11:31,594 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:11:31,594 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:11:31,595 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:11:31,595 INFO ]: Start difference. First operand 57 states and 260 transitions. Second operand 7 states. [2018-06-22 11:11:32,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:32,411 INFO ]: Finished difference Result 87 states and 473 transitions. [2018-06-22 11:11:32,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:11:32,413 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:11:32,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:32,419 INFO ]: With dead ends: 87 [2018-06-22 11:11:32,419 INFO ]: Without dead ends: 87 [2018-06-22 11:11:32,419 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:32,419 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:11:32,484 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-06-22 11:11:32,484 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:11:32,488 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 455 transitions. [2018-06-22 11:11:32,488 INFO ]: Start accepts. Automaton has 79 states and 455 transitions. Word has length 13 [2018-06-22 11:11:32,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:32,488 INFO ]: Abstraction has 79 states and 455 transitions. [2018-06-22 11:11:32,488 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:11:32,488 INFO ]: Start isEmpty. Operand 79 states and 455 transitions. [2018-06-22 11:11:32,494 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:32,494 INFO ]: Found error trace [2018-06-22 11:11:32,494 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:32,494 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:32,494 INFO ]: Analyzing trace with hash -1065377937, now seen corresponding path program 1 times [2018-06-22 11:11:32,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:32,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:32,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:32,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:32,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:32,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:32,559 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:11:32,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:32,560 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:11:32,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:32,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:32,580 INFO ]: Computing forward predicates... [2018-06-22 11:11:32,643 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:11:32,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:32,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:11:32,664 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:11:32,664 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:11:32,664 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:11:32,664 INFO ]: Start difference. First operand 79 states and 455 transitions. Second operand 7 states. [2018-06-22 11:11:33,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:33,635 INFO ]: Finished difference Result 109 states and 634 transitions. [2018-06-22 11:11:33,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:11:33,662 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:11:33,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:33,668 INFO ]: With dead ends: 109 [2018-06-22 11:11:33,668 INFO ]: Without dead ends: 109 [2018-06-22 11:11:33,668 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:33,669 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:11:33,722 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 79. [2018-06-22 11:11:33,722 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:11:33,728 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 455 transitions. [2018-06-22 11:11:33,728 INFO ]: Start accepts. Automaton has 79 states and 455 transitions. Word has length 13 [2018-06-22 11:11:33,728 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:33,728 INFO ]: Abstraction has 79 states and 455 transitions. [2018-06-22 11:11:33,728 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:11:33,728 INFO ]: Start isEmpty. Operand 79 states and 455 transitions. [2018-06-22 11:11:33,735 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:33,735 INFO ]: Found error trace [2018-06-22 11:11:33,735 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:33,735 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:33,736 INFO ]: Analyzing trace with hash -2046381349, now seen corresponding path program 1 times [2018-06-22 11:11:33,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:33,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:33,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:33,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:33,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:33,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:33,886 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:11:33,886 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:33,886 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:33,887 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:33,887 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:33,887 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:33,887 INFO ]: Start difference. First operand 79 states and 455 transitions. Second operand 4 states. [2018-06-22 11:11:34,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:34,105 INFO ]: Finished difference Result 83 states and 457 transitions. [2018-06-22 11:11:34,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:34,106 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:11:34,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:34,109 INFO ]: With dead ends: 83 [2018-06-22 11:11:34,109 INFO ]: Without dead ends: 83 [2018-06-22 11:11:34,109 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:34,109 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:11:34,136 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-06-22 11:11:34,136 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:11:34,138 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 451 transitions. [2018-06-22 11:11:34,138 INFO ]: Start accepts. Automaton has 79 states and 451 transitions. Word has length 13 [2018-06-22 11:11:34,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:34,138 INFO ]: Abstraction has 79 states and 451 transitions. [2018-06-22 11:11:34,138 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:34,139 INFO ]: Start isEmpty. Operand 79 states and 451 transitions. [2018-06-22 11:11:34,143 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:11:34,143 INFO ]: Found error trace [2018-06-22 11:11:34,144 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:34,144 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:34,144 INFO ]: Analyzing trace with hash -1310628790, now seen corresponding path program 1 times [2018-06-22 11:11:34,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:34,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:34,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:34,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:34,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:34,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:34,301 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:11:34,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:34,301 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:11:34,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:34,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:34,330 INFO ]: Computing forward predicates... [2018-06-22 11:11:34,465 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:11:34,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:34,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:11:34,489 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:11:34,489 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:11:34,489 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:11:34,490 INFO ]: Start difference. First operand 79 states and 451 transitions. Second operand 8 states. [2018-06-22 11:11:34,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:34,936 INFO ]: Finished difference Result 99 states and 631 transitions. [2018-06-22 11:11:34,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:11:34,937 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:11:34,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:34,941 INFO ]: With dead ends: 99 [2018-06-22 11:11:34,941 INFO ]: Without dead ends: 99 [2018-06-22 11:11:34,941 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:34,941 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:11:34,973 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 79. [2018-06-22 11:11:34,973 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:11:34,975 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 450 transitions. [2018-06-22 11:11:34,975 INFO ]: Start accepts. Automaton has 79 states and 450 transitions. Word has length 13 [2018-06-22 11:11:34,976 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:34,976 INFO ]: Abstraction has 79 states and 450 transitions. [2018-06-22 11:11:34,976 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:11:34,976 INFO ]: Start isEmpty. Operand 79 states and 450 transitions. [2018-06-22 11:11:34,980 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:34,980 INFO ]: Found error trace [2018-06-22 11:11:34,980 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:34,981 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:34,981 INFO ]: Analyzing trace with hash -850656051, now seen corresponding path program 1 times [2018-06-22 11:11:34,981 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:34,981 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:34,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:34,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:34,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:34,990 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:35,109 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:11:35,110 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:35,110 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:35,110 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:35,110 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:35,110 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:35,110 INFO ]: Start difference. First operand 79 states and 450 transitions. Second operand 4 states. [2018-06-22 11:11:35,444 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:35,445 INFO ]: Finished difference Result 86 states and 492 transitions. [2018-06-22 11:11:35,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:35,445 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:35,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:35,447 INFO ]: With dead ends: 86 [2018-06-22 11:11:35,447 INFO ]: Without dead ends: 86 [2018-06-22 11:11:35,448 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:11:35,448 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:11:35,470 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-06-22 11:11:35,470 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 11:11:35,472 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 484 transitions. [2018-06-22 11:11:35,472 INFO ]: Start accepts. Automaton has 82 states and 484 transitions. Word has length 17 [2018-06-22 11:11:35,472 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:35,472 INFO ]: Abstraction has 82 states and 484 transitions. [2018-06-22 11:11:35,473 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:35,473 INFO ]: Start isEmpty. Operand 82 states and 484 transitions. [2018-06-22 11:11:35,477 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:35,477 INFO ]: Found error trace [2018-06-22 11:11:35,477 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:35,477 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:35,478 INFO ]: Analyzing trace with hash 60243678, now seen corresponding path program 1 times [2018-06-22 11:11:35,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:35,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:35,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:35,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:35,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:35,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:35,616 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:11:35,616 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:35,616 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:35,616 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:35,616 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:35,616 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:35,617 INFO ]: Start difference. First operand 82 states and 484 transitions. Second operand 4 states. [2018-06-22 11:11:36,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:36,833 INFO ]: Finished difference Result 118 states and 654 transitions. [2018-06-22 11:11:36,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:36,834 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:36,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:36,837 INFO ]: With dead ends: 118 [2018-06-22 11:11:36,837 INFO ]: Without dead ends: 118 [2018-06-22 11:11:36,837 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:36,838 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:11:36,869 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 102. [2018-06-22 11:11:36,869 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 11:11:36,873 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 528 transitions. [2018-06-22 11:11:36,873 INFO ]: Start accepts. Automaton has 102 states and 528 transitions. Word has length 17 [2018-06-22 11:11:36,873 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:36,873 INFO ]: Abstraction has 102 states and 528 transitions. [2018-06-22 11:11:36,873 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:36,873 INFO ]: Start isEmpty. Operand 102 states and 528 transitions. [2018-06-22 11:11:36,879 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:36,879 INFO ]: Found error trace [2018-06-22 11:11:36,879 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:36,879 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:36,879 INFO ]: Analyzing trace with hash 642331597, now seen corresponding path program 2 times [2018-06-22 11:11:36,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:36,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:36,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:36,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:36,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:36,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:37,247 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:37,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:37,247 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) [2018-06-22 11:11:37,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:37,305 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:37,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:37,307 INFO ]: Computing forward predicates... [2018-06-22 11:11:37,646 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:37,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:37,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:11:37,678 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:11:37,678 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:11:37,678 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:11:37,679 INFO ]: Start difference. First operand 102 states and 528 transitions. Second operand 7 states. [2018-06-22 11:11:38,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:38,471 INFO ]: Finished difference Result 184 states and 769 transitions. [2018-06-22 11:11:38,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:11:38,472 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:11:38,472 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:38,479 INFO ]: With dead ends: 184 [2018-06-22 11:11:38,479 INFO ]: Without dead ends: 175 [2018-06-22 11:11:38,480 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:11:38,480 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 11:11:38,520 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 127. [2018-06-22 11:11:38,520 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 11:11:38,522 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 543 transitions. [2018-06-22 11:11:38,522 INFO ]: Start accepts. Automaton has 127 states and 543 transitions. Word has length 17 [2018-06-22 11:11:38,522 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:38,522 INFO ]: Abstraction has 127 states and 543 transitions. [2018-06-22 11:11:38,522 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:11:38,522 INFO ]: Start isEmpty. Operand 127 states and 543 transitions. [2018-06-22 11:11:38,527 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:38,527 INFO ]: Found error trace [2018-06-22 11:11:38,527 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:38,527 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:38,527 INFO ]: Analyzing trace with hash -1832921321, now seen corresponding path program 1 times [2018-06-22 11:11:38,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:38,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:38,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:38,528 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:38,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:38,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:38,663 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:11:38,663 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:38,774 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:38,774 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:38,774 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:38,774 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:38,775 INFO ]: Start difference. First operand 127 states and 543 transitions. Second operand 4 states. [2018-06-22 11:11:38,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:38,899 INFO ]: Finished difference Result 168 states and 541 transitions. [2018-06-22 11:11:38,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:38,899 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:38,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:38,902 INFO ]: With dead ends: 168 [2018-06-22 11:11:38,902 INFO ]: Without dead ends: 141 [2018-06-22 11:11:38,902 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:11:38,902 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:11:38,922 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 127. [2018-06-22 11:11:38,922 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-22 11:11:38,924 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 432 transitions. [2018-06-22 11:11:38,924 INFO ]: Start accepts. Automaton has 127 states and 432 transitions. Word has length 17 [2018-06-22 11:11:38,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:38,924 INFO ]: Abstraction has 127 states and 432 transitions. [2018-06-22 11:11:38,924 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:38,924 INFO ]: Start isEmpty. Operand 127 states and 432 transitions. [2018-06-22 11:11:38,929 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:38,929 INFO ]: Found error trace [2018-06-22 11:11:38,929 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:38,929 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:38,930 INFO ]: Analyzing trace with hash -1222339153, now seen corresponding path program 2 times [2018-06-22 11:11:38,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:38,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:38,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:38,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:38,930 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:38,947 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:39,063 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:39,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:39,063 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) [2018-06-22 11:11:39,080 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:39,128 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:39,128 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:39,130 INFO ]: Computing forward predicates... [2018-06-22 11:11:39,253 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:39,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:39,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:11:39,272 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:11:39,272 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:11:39,272 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:39,272 INFO ]: Start difference. First operand 127 states and 432 transitions. Second operand 10 states. [2018-06-22 11:11:40,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:40,346 INFO ]: Finished difference Result 215 states and 798 transitions. [2018-06-22 11:11:40,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:11:40,346 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:11:40,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:40,352 INFO ]: With dead ends: 215 [2018-06-22 11:11:40,352 INFO ]: Without dead ends: 201 [2018-06-22 11:11:40,352 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:11:40,352 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 11:11:40,386 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 139. [2018-06-22 11:11:40,386 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-22 11:11:40,390 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 515 transitions. [2018-06-22 11:11:40,390 INFO ]: Start accepts. Automaton has 139 states and 515 transitions. Word has length 17 [2018-06-22 11:11:40,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:40,390 INFO ]: Abstraction has 139 states and 515 transitions. [2018-06-22 11:11:40,390 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:11:40,390 INFO ]: Start isEmpty. Operand 139 states and 515 transitions. [2018-06-22 11:11:40,394 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:40,394 INFO ]: Found error trace [2018-06-22 11:11:40,394 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:40,394 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:40,394 INFO ]: Analyzing trace with hash -1295789774, now seen corresponding path program 1 times [2018-06-22 11:11:40,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:40,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:40,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:40,395 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:40,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:40,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:40,546 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:11:40,547 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:40,547 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:40,547 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:40,547 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:40,547 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:40,547 INFO ]: Start difference. First operand 139 states and 515 transitions. Second operand 4 states. [2018-06-22 11:11:40,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:40,657 INFO ]: Finished difference Result 135 states and 352 transitions. [2018-06-22 11:11:40,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:40,657 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:40,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:40,659 INFO ]: With dead ends: 135 [2018-06-22 11:11:40,659 INFO ]: Without dead ends: 117 [2018-06-22 11:11:40,659 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:11:40,659 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:11:40,669 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 109. [2018-06-22 11:11:40,669 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:11:40,671 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 280 transitions. [2018-06-22 11:11:40,671 INFO ]: Start accepts. Automaton has 109 states and 280 transitions. Word has length 17 [2018-06-22 11:11:40,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:40,671 INFO ]: Abstraction has 109 states and 280 transitions. [2018-06-22 11:11:40,671 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:40,671 INFO ]: Start isEmpty. Operand 109 states and 280 transitions. [2018-06-22 11:11:40,675 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:40,675 INFO ]: Found error trace [2018-06-22 11:11:40,675 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:40,676 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:40,676 INFO ]: Analyzing trace with hash -431931497, now seen corresponding path program 1 times [2018-06-22 11:11:40,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:40,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:40,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:40,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:40,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:40,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:41,008 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:41,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:41,008 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:11:41,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:41,029 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:41,031 INFO ]: Computing forward predicates... [2018-06-22 11:11:41,100 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:41,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:41,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:11:41,120 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:41,120 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:41,120 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:41,120 INFO ]: Start difference. First operand 109 states and 280 transitions. Second operand 11 states. [2018-06-22 11:11:41,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:41,519 INFO ]: Finished difference Result 137 states and 359 transitions. [2018-06-22 11:11:41,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:11:41,519 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:11:41,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:41,521 INFO ]: With dead ends: 137 [2018-06-22 11:11:41,521 INFO ]: Without dead ends: 137 [2018-06-22 11:11:41,522 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:41,522 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 11:11:41,535 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 109. [2018-06-22 11:11:41,535 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:11:41,537 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 280 transitions. [2018-06-22 11:11:41,537 INFO ]: Start accepts. Automaton has 109 states and 280 transitions. Word has length 17 [2018-06-22 11:11:41,537 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:41,537 INFO ]: Abstraction has 109 states and 280 transitions. [2018-06-22 11:11:41,537 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:41,537 INFO ]: Start isEmpty. Operand 109 states and 280 transitions. [2018-06-22 11:11:41,540 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:41,540 INFO ]: Found error trace [2018-06-22 11:11:41,540 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:41,540 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:41,540 INFO ]: Analyzing trace with hash -895612423, now seen corresponding path program 1 times [2018-06-22 11:11:41,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:41,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:41,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:41,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:41,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:41,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:41,698 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:11:41,699 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:41,699 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:41,699 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:41,699 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:41,699 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:41,699 INFO ]: Start difference. First operand 109 states and 280 transitions. Second operand 4 states. [2018-06-22 11:11:42,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:42,349 INFO ]: Finished difference Result 127 states and 312 transitions. [2018-06-22 11:11:42,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:42,349 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:42,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:42,351 INFO ]: With dead ends: 127 [2018-06-22 11:11:42,351 INFO ]: Without dead ends: 125 [2018-06-22 11:11:42,351 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:42,352 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:11:42,363 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 109. [2018-06-22 11:11:42,364 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:11:42,365 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 279 transitions. [2018-06-22 11:11:42,365 INFO ]: Start accepts. Automaton has 109 states and 279 transitions. Word has length 17 [2018-06-22 11:11:42,365 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:42,365 INFO ]: Abstraction has 109 states and 279 transitions. [2018-06-22 11:11:42,365 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:42,365 INFO ]: Start isEmpty. Operand 109 states and 279 transitions. [2018-06-22 11:11:42,368 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:42,368 INFO ]: Found error trace [2018-06-22 11:11:42,368 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:42,368 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:42,368 INFO ]: Analyzing trace with hash 1787960232, now seen corresponding path program 1 times [2018-06-22 11:11:42,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:42,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:42,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:42,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:42,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:42,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:42,580 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:42,580 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:42,580 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:11:42,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:42,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:42,602 INFO ]: Computing forward predicates... [2018-06-22 11:11:42,665 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:42,684 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:42,684 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:11:42,684 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:11:42,685 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:11:42,685 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:11:42,685 INFO ]: Start difference. First operand 109 states and 279 transitions. Second operand 9 states. [2018-06-22 11:11:43,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:43,362 INFO ]: Finished difference Result 111 states and 268 transitions. [2018-06-22 11:11:43,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:11:43,363 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:11:43,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:43,364 INFO ]: With dead ends: 111 [2018-06-22 11:11:43,364 INFO ]: Without dead ends: 100 [2018-06-22 11:11:43,364 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:43,365 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:11:43,372 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 92. [2018-06-22 11:11:43,373 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 11:11:43,374 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 226 transitions. [2018-06-22 11:11:43,374 INFO ]: Start accepts. Automaton has 92 states and 226 transitions. Word has length 17 [2018-06-22 11:11:43,374 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:43,374 INFO ]: Abstraction has 92 states and 226 transitions. [2018-06-22 11:11:43,374 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:11:43,374 INFO ]: Start isEmpty. Operand 92 states and 226 transitions. [2018-06-22 11:11:43,376 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:43,376 INFO ]: Found error trace [2018-06-22 11:11:43,376 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:43,376 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:43,376 INFO ]: Analyzing trace with hash -1924919145, now seen corresponding path program 2 times [2018-06-22 11:11:43,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:43,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:43,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:43,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:43,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:43,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:43,580 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:43,580 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:43,580 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:11:43,588 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:43,601 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:43,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:43,603 INFO ]: Computing forward predicates... [2018-06-22 11:11:43,737 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:11:43,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:43,774 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:11:43,774 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:43,775 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:43,775 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:43,775 INFO ]: Start difference. First operand 92 states and 226 transitions. Second operand 11 states. [2018-06-22 11:11:44,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:44,560 INFO ]: Finished difference Result 180 states and 449 transitions. [2018-06-22 11:11:44,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:11:44,561 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:11:44,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:44,563 INFO ]: With dead ends: 180 [2018-06-22 11:11:44,563 INFO ]: Without dead ends: 136 [2018-06-22 11:11:44,563 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:11:44,563 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-22 11:11:44,575 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 112. [2018-06-22 11:11:44,575 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 11:11:44,577 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 287 transitions. [2018-06-22 11:11:44,577 INFO ]: Start accepts. Automaton has 112 states and 287 transitions. Word has length 17 [2018-06-22 11:11:44,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:44,577 INFO ]: Abstraction has 112 states and 287 transitions. [2018-06-22 11:11:44,577 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:44,577 INFO ]: Start isEmpty. Operand 112 states and 287 transitions. [2018-06-22 11:11:44,579 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:11:44,579 INFO ]: Found error trace [2018-06-22 11:11:44,579 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:44,579 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:44,579 INFO ]: Analyzing trace with hash -521844241, now seen corresponding path program 1 times [2018-06-22 11:11:44,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:44,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:44,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:44,580 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:44,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:44,586 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:44,781 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 11:11:44,900 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:11:44,900 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:44,900 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:44,900 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:44,901 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:44,901 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:44,901 INFO ]: Start difference. First operand 112 states and 287 transitions. Second operand 4 states. [2018-06-22 11:11:45,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:45,039 INFO ]: Finished difference Result 106 states and 267 transitions. [2018-06-22 11:11:45,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:11:45,040 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:11:45,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:45,040 INFO ]: With dead ends: 106 [2018-06-22 11:11:45,040 INFO ]: Without dead ends: 83 [2018-06-22 11:11:45,040 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:11:45,041 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:11:45,047 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 73. [2018-06-22 11:11:45,047 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 11:11:45,048 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2018-06-22 11:11:45,048 INFO ]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 17 [2018-06-22 11:11:45,048 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:45,048 INFO ]: Abstraction has 73 states and 165 transitions. [2018-06-22 11:11:45,048 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:45,049 INFO ]: Start isEmpty. Operand 73 states and 165 transitions. [2018-06-22 11:11:45,049 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:45,049 INFO ]: Found error trace [2018-06-22 11:11:45,050 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:45,050 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:45,050 INFO ]: Analyzing trace with hash -1202814714, now seen corresponding path program 1 times [2018-06-22 11:11:45,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:45,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:45,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:45,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:45,092 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:11:45,092 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:11:45,092 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:11:45,092 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:45,092 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:45,092 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:45,092 INFO ]: Start difference. First operand 73 states and 165 transitions. Second operand 4 states. [2018-06-22 11:11:45,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:45,165 INFO ]: Finished difference Result 89 states and 182 transitions. [2018-06-22 11:11:45,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:45,166 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:11:45,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:45,166 INFO ]: With dead ends: 89 [2018-06-22 11:11:45,166 INFO ]: Without dead ends: 89 [2018-06-22 11:11:45,167 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 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:11:45,167 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 11:11:45,171 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-06-22 11:11:45,171 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:11:45,172 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 169 transitions. [2018-06-22 11:11:45,172 INFO ]: Start accepts. Automaton has 85 states and 169 transitions. Word has length 21 [2018-06-22 11:11:45,172 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:45,172 INFO ]: Abstraction has 85 states and 169 transitions. [2018-06-22 11:11:45,172 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:45,172 INFO ]: Start isEmpty. Operand 85 states and 169 transitions. [2018-06-22 11:11:45,174 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:45,174 INFO ]: Found error trace [2018-06-22 11:11:45,174 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:45,174 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:45,174 INFO ]: Analyzing trace with hash -1011901794, now seen corresponding path program 3 times [2018-06-22 11:11:45,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:45,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:45,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:45,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:45,354 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 4 [2018-06-22 11:11:45,381 INFO ]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:11:45,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:45,381 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:11:45,386 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:11:45,401 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:11:45,401 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:45,403 INFO ]: Computing forward predicates... [2018-06-22 11:11:45,550 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:11:45,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:45,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2018-06-22 11:11:45,574 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:45,574 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:45,574 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:45,574 INFO ]: Start difference. First operand 85 states and 169 transitions. Second operand 11 states. [2018-06-22 11:11:45,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:45,860 INFO ]: Finished difference Result 107 states and 194 transitions. [2018-06-22 11:11:45,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:11:45,860 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:11:45,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:45,861 INFO ]: With dead ends: 107 [2018-06-22 11:11:45,861 INFO ]: Without dead ends: 102 [2018-06-22 11:11:45,861 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:11:45,861 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 11:11:45,866 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 72. [2018-06-22 11:11:45,866 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:11:45,867 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 122 transitions. [2018-06-22 11:11:45,867 INFO ]: Start accepts. Automaton has 72 states and 122 transitions. Word has length 21 [2018-06-22 11:11:45,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:45,867 INFO ]: Abstraction has 72 states and 122 transitions. [2018-06-22 11:11:45,867 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:45,867 INFO ]: Start isEmpty. Operand 72 states and 122 transitions. [2018-06-22 11:11:45,868 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:45,868 INFO ]: Found error trace [2018-06-22 11:11:45,868 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:45,868 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:45,868 INFO ]: Analyzing trace with hash 36301355, now seen corresponding path program 2 times [2018-06-22 11:11:45,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:45,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:45,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,868 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:45,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:45,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:46,258 INFO ]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:11:46,258 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:46,258 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:11:46,270 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:46,292 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:46,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:46,294 INFO ]: Computing forward predicates... [2018-06-22 11:11:46,383 INFO ]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:11:46,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:46,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:11:46,402 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:11:46,403 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:11:46,403 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:11:46,403 INFO ]: Start difference. First operand 72 states and 122 transitions. Second operand 11 states. [2018-06-22 11:11:46,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:46,754 INFO ]: Finished difference Result 88 states and 140 transitions. [2018-06-22 11:11:46,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:11:46,756 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:11:46,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:46,757 INFO ]: With dead ends: 88 [2018-06-22 11:11:46,757 INFO ]: Without dead ends: 82 [2018-06-22 11:11:46,757 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:11:46,757 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:11:46,760 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-06-22 11:11:46,760 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:11:46,761 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 121 transitions. [2018-06-22 11:11:46,761 INFO ]: Start accepts. Automaton has 72 states and 121 transitions. Word has length 21 [2018-06-22 11:11:46,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:46,761 INFO ]: Abstraction has 72 states and 121 transitions. [2018-06-22 11:11:46,761 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:11:46,761 INFO ]: Start isEmpty. Operand 72 states and 121 transitions. [2018-06-22 11:11:46,762 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:11:46,762 INFO ]: Found error trace [2018-06-22 11:11:46,762 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:46,762 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:46,762 INFO ]: Analyzing trace with hash 269489901, now seen corresponding path program 1 times [2018-06-22 11:11:46,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:46,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:46,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:46,763 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:46,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:46,768 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:46,867 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:11:46,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:46,867 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:11:46,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:46,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:46,888 INFO ]: Computing forward predicates... [2018-06-22 11:11:47,328 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:11:47,349 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:47,349 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 11:11:47,349 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:11:47,349 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:11:47,349 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:47,349 INFO ]: Start difference. First operand 72 states and 121 transitions. Second operand 10 states. [2018-06-22 11:11:47,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:47,582 INFO ]: Finished difference Result 120 states and 193 transitions. [2018-06-22 11:11:47,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:11:47,582 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:11:47,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:47,583 INFO ]: With dead ends: 120 [2018-06-22 11:11:47,583 INFO ]: Without dead ends: 116 [2018-06-22 11:11:47,584 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:47,584 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:11:47,588 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 76. [2018-06-22 11:11:47,588 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:11:47,589 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 126 transitions. [2018-06-22 11:11:47,589 INFO ]: Start accepts. Automaton has 76 states and 126 transitions. Word has length 21 [2018-06-22 11:11:47,589 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:47,589 INFO ]: Abstraction has 76 states and 126 transitions. [2018-06-22 11:11:47,589 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:11:47,590 INFO ]: Start isEmpty. Operand 76 states and 126 transitions. [2018-06-22 11:11:47,590 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:47,590 INFO ]: Found error trace [2018-06-22 11:11:47,590 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:47,590 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:47,591 INFO ]: Analyzing trace with hash 223392351, now seen corresponding path program 2 times [2018-06-22 11:11:47,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:47,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:47,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:47,591 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:47,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:47,606 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:47,824 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:11:47,824 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:47,824 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:11:47,831 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:47,850 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:47,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:47,853 INFO ]: Computing forward predicates... [2018-06-22 11:11:48,032 INFO ]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:11:48,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:48,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-22 11:11:48,052 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:11:48,053 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:11:48,053 INFO ]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:11:48,053 INFO ]: Start difference. First operand 76 states and 126 transitions. Second operand 15 states. [2018-06-22 11:11:48,445 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 11:11:49,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:49,779 INFO ]: Finished difference Result 116 states and 184 transitions. [2018-06-22 11:11:49,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:11:49,780 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:11:49,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:49,780 INFO ]: With dead ends: 116 [2018-06-22 11:11:49,780 INFO ]: Without dead ends: 104 [2018-06-22 11:11:49,781 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:11:49,781 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 11:11:49,784 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 86. [2018-06-22 11:11:49,784 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:11:49,785 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 140 transitions. [2018-06-22 11:11:49,785 INFO ]: Start accepts. Automaton has 86 states and 140 transitions. Word has length 25 [2018-06-22 11:11:49,785 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:49,785 INFO ]: Abstraction has 86 states and 140 transitions. [2018-06-22 11:11:49,785 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:11:49,785 INFO ]: Start isEmpty. Operand 86 states and 140 transitions. [2018-06-22 11:11:49,786 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:49,786 INFO ]: Found error trace [2018-06-22 11:11:49,786 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:49,786 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:49,786 INFO ]: Analyzing trace with hash 1085945912, now seen corresponding path program 1 times [2018-06-22 11:11:49,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:49,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:49,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:49,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:49,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:49,792 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:50,038 INFO ]: Checked inductivity of 33 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:50,038 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:50,038 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:11:50,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:50,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:50,078 INFO ]: Computing forward predicates... [2018-06-22 11:11:50,398 INFO ]: Checked inductivity of 33 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:50,418 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:50,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 11:11:50,419 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:11:50,419 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:11:50,419 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:11:50,419 INFO ]: Start difference. First operand 86 states and 140 transitions. Second operand 10 states. [2018-06-22 11:11:50,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:50,577 INFO ]: Finished difference Result 92 states and 145 transitions. [2018-06-22 11:11:50,578 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:50,578 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:11:50,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:50,578 INFO ]: With dead ends: 92 [2018-06-22 11:11:50,578 INFO ]: Without dead ends: 84 [2018-06-22 11:11:50,579 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:50,579 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:11:50,582 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-22 11:11:50,582 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:11:50,583 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 137 transitions. [2018-06-22 11:11:50,583 INFO ]: Start accepts. Automaton has 84 states and 137 transitions. Word has length 25 [2018-06-22 11:11:50,583 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:50,583 INFO ]: Abstraction has 84 states and 137 transitions. [2018-06-22 11:11:50,583 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:11:50,583 INFO ]: Start isEmpty. Operand 84 states and 137 transitions. [2018-06-22 11:11:50,592 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:50,592 INFO ]: Found error trace [2018-06-22 11:11:50,592 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:50,592 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:50,593 INFO ]: Analyzing trace with hash -1760416921, now seen corresponding path program 1 times [2018-06-22 11:11:50,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:50,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:50,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:50,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:50,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:50,602 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:50,700 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:50,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:50,700 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:11:50,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:50,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:50,723 INFO ]: Computing forward predicates... [2018-06-22 11:11:50,983 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:51,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:51,003 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 11:11:51,003 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:11:51,003 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:11:51,004 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:51,004 INFO ]: Start difference. First operand 84 states and 137 transitions. Second operand 13 states. [2018-06-22 11:11:51,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:51,208 INFO ]: Finished difference Result 100 states and 164 transitions. [2018-06-22 11:11:51,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:11:51,209 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:11:51,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:51,209 INFO ]: With dead ends: 100 [2018-06-22 11:11:51,209 INFO ]: Without dead ends: 100 [2018-06-22 11:11:51,209 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:51,210 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:11:51,213 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 84. [2018-06-22 11:11:51,213 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 11:11:51,214 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 137 transitions. [2018-06-22 11:11:51,214 INFO ]: Start accepts. Automaton has 84 states and 137 transitions. Word has length 25 [2018-06-22 11:11:51,214 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:51,214 INFO ]: Abstraction has 84 states and 137 transitions. [2018-06-22 11:11:51,214 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:11:51,214 INFO ]: Start isEmpty. Operand 84 states and 137 transitions. [2018-06-22 11:11:51,215 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:11:51,215 INFO ]: Found error trace [2018-06-22 11:11:51,215 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:51,215 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:51,215 INFO ]: Analyzing trace with hash -1863415147, now seen corresponding path program 3 times [2018-06-22 11:11:51,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:51,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:51,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:51,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:51,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:51,238 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:51,989 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:51,989 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:51,989 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:11:51,995 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:11:52,012 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:11:52,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:52,014 INFO ]: Computing forward predicates... [2018-06-22 11:11:52,182 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:11:52,208 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:52,208 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 11:11:52,208 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:11:52,209 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:11:52,209 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:11:52,209 INFO ]: Start difference. First operand 84 states and 137 transitions. Second operand 16 states. [2018-06-22 11:11:52,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:52,507 INFO ]: Finished difference Result 94 states and 156 transitions. [2018-06-22 11:11:52,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:11:52,507 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:11:52,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:52,508 INFO ]: With dead ends: 94 [2018-06-22 11:11:52,508 INFO ]: Without dead ends: 94 [2018-06-22 11:11:52,509 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:11:52,509 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:11:52,513 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-06-22 11:11:52,513 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:11:52,514 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 144 transitions. [2018-06-22 11:11:52,514 INFO ]: Start accepts. Automaton has 88 states and 144 transitions. Word has length 25 [2018-06-22 11:11:52,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:52,514 INFO ]: Abstraction has 88 states and 144 transitions. [2018-06-22 11:11:52,514 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:11:52,514 INFO ]: Start isEmpty. Operand 88 states and 144 transitions. [2018-06-22 11:11:52,515 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:52,515 INFO ]: Found error trace [2018-06-22 11:11:52,515 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:52,515 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:52,515 INFO ]: Analyzing trace with hash 1045630385, now seen corresponding path program 1 times [2018-06-22 11:11:52,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:52,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:52,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:52,516 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:52,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:52,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:52,654 INFO ]: Checked inductivity of 48 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:11:52,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:52,654 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) [2018-06-22 11:11:52,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:52,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:52,708 INFO ]: Computing forward predicates... [2018-06-22 11:11:52,773 INFO ]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:11:52,798 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:11:52,798 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 11:11:52,798 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:11:52,799 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:11:52,799 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:52,799 INFO ]: Start difference. First operand 88 states and 144 transitions. Second operand 4 states. [2018-06-22 11:11:52,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:52,903 INFO ]: Finished difference Result 98 states and 153 transitions. [2018-06-22 11:11:52,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:11:52,903 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 11:11:52,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:52,903 INFO ]: With dead ends: 98 [2018-06-22 11:11:52,903 INFO ]: Without dead ends: 98 [2018-06-22 11:11:52,904 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:11:52,904 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:11:52,907 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-06-22 11:11:52,907 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 11:11:52,908 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 142 transitions. [2018-06-22 11:11:52,908 INFO ]: Start accepts. Automaton has 88 states and 142 transitions. Word has length 29 [2018-06-22 11:11:52,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:52,908 INFO ]: Abstraction has 88 states and 142 transitions. [2018-06-22 11:11:52,908 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:11:52,908 INFO ]: Start isEmpty. Operand 88 states and 142 transitions. [2018-06-22 11:11:52,909 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:52,909 INFO ]: Found error trace [2018-06-22 11:11:52,909 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:52,909 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:52,909 INFO ]: Analyzing trace with hash 790865423, now seen corresponding path program 2 times [2018-06-22 11:11:52,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:52,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:52,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:52,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:52,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:52,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:53,037 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:11:53,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:53,037 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:11:53,043 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:53,061 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:53,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:53,064 INFO ]: Computing forward predicates... [2018-06-22 11:11:53,198 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:11:53,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:53,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-22 11:11:53,219 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:11:53,219 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:11:53,219 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:11:53,219 INFO ]: Start difference. First operand 88 states and 142 transitions. Second operand 18 states. [2018-06-22 11:11:53,506 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:53,506 INFO ]: Finished difference Result 108 states and 167 transitions. [2018-06-22 11:11:53,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:53,507 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:11:53,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:53,507 INFO ]: With dead ends: 108 [2018-06-22 11:11:53,507 INFO ]: Without dead ends: 108 [2018-06-22 11:11:53,508 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:11:53,508 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 11:11:53,513 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 86. [2018-06-22 11:11:53,513 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 11:11:53,514 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 140 transitions. [2018-06-22 11:11:53,514 INFO ]: Start accepts. Automaton has 86 states and 140 transitions. Word has length 29 [2018-06-22 11:11:53,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:53,514 INFO ]: Abstraction has 86 states and 140 transitions. [2018-06-22 11:11:53,514 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:11:53,514 INFO ]: Start isEmpty. Operand 86 states and 140 transitions. [2018-06-22 11:11:53,515 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:53,515 INFO ]: Found error trace [2018-06-22 11:11:53,515 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:53,515 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:53,515 INFO ]: Analyzing trace with hash 1652535886, now seen corresponding path program 1 times [2018-06-22 11:11:53,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:53,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:53,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:53,518 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:53,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:53,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:53,588 INFO ]: Checked inductivity of 46 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:11:53,588 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:53,588 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:11:53,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:53,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:53,618 INFO ]: Computing forward predicates... [2018-06-22 11:11:53,721 INFO ]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:11:53,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:53,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13] total 15 [2018-06-22 11:11:53,740 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:11:53,740 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:11:53,740 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:11:53,741 INFO ]: Start difference. First operand 86 states and 140 transitions. Second operand 15 states. [2018-06-22 11:11:54,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:54,161 INFO ]: Finished difference Result 110 states and 165 transitions. [2018-06-22 11:11:54,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:11:54,182 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:11:54,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:54,183 INFO ]: With dead ends: 110 [2018-06-22 11:11:54,183 INFO ]: Without dead ends: 99 [2018-06-22 11:11:54,183 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:11:54,183 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:11:54,186 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 51. [2018-06-22 11:11:54,186 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:11:54,187 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2018-06-22 11:11:54,188 INFO ]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 29 [2018-06-22 11:11:54,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:54,188 INFO ]: Abstraction has 51 states and 73 transitions. [2018-06-22 11:11:54,188 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:11:54,188 INFO ]: Start isEmpty. Operand 51 states and 73 transitions. [2018-06-22 11:11:54,188 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:54,188 INFO ]: Found error trace [2018-06-22 11:11:54,188 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:54,188 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:54,188 INFO ]: Analyzing trace with hash 593818045, now seen corresponding path program 4 times [2018-06-22 11:11:54,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:54,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:54,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:54,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,196 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:54,305 INFO ]: Checked inductivity of 48 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:11:54,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:54,305 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:11:54,312 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:11:54,330 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:11:54,330 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:54,332 INFO ]: Computing forward predicates... [2018-06-22 11:11:54,470 INFO ]: Checked inductivity of 48 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:11:54,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:54,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 11:11:54,491 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:11:54,491 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:11:54,491 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:11:54,491 INFO ]: Start difference. First operand 51 states and 73 transitions. Second operand 13 states. [2018-06-22 11:11:54,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:54,760 INFO ]: Finished difference Result 81 states and 108 transitions. [2018-06-22 11:11:54,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:11:54,761 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:11:54,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:54,761 INFO ]: With dead ends: 81 [2018-06-22 11:11:54,761 INFO ]: Without dead ends: 73 [2018-06-22 11:11:54,761 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:54,761 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:11:54,763 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 49. [2018-06-22 11:11:54,764 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:11:54,764 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2018-06-22 11:11:54,764 INFO ]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 29 [2018-06-22 11:11:54,764 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:54,764 INFO ]: Abstraction has 49 states and 70 transitions. [2018-06-22 11:11:54,764 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:11:54,764 INFO ]: Start isEmpty. Operand 49 states and 70 transitions. [2018-06-22 11:11:54,765 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:54,765 INFO ]: Found error trace [2018-06-22 11:11:54,766 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:54,766 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:54,766 INFO ]: Analyzing trace with hash 1610933290, now seen corresponding path program 1 times [2018-06-22 11:11:54,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:54,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:54,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,767 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:54,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:54,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:54,977 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:11:54,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:54,977 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:11:54,982 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:54,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:55,000 INFO ]: Computing forward predicates... [2018-06-22 11:11:55,143 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:11:55,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:55,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 11:11:55,164 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:11:55,164 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:11:55,164 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:55,164 INFO ]: Start difference. First operand 49 states and 70 transitions. Second operand 14 states. [2018-06-22 11:11:55,397 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:55,397 INFO ]: Finished difference Result 73 states and 99 transitions. [2018-06-22 11:11:55,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:55,400 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 11:11:55,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:55,400 INFO ]: With dead ends: 73 [2018-06-22 11:11:55,400 INFO ]: Without dead ends: 73 [2018-06-22 11:11:55,401 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:11:55,401 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:11:55,403 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 47. [2018-06-22 11:11:55,403 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:11:55,403 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2018-06-22 11:11:55,403 INFO ]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 29 [2018-06-22 11:11:55,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:55,403 INFO ]: Abstraction has 47 states and 68 transitions. [2018-06-22 11:11:55,403 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:11:55,403 INFO ]: Start isEmpty. Operand 47 states and 68 transitions. [2018-06-22 11:11:55,404 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:11:55,404 INFO ]: Found error trace [2018-06-22 11:11:55,404 INFO ]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:55,404 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:55,404 INFO ]: Analyzing trace with hash -849270311, now seen corresponding path program 1 times [2018-06-22 11:11:55,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:55,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:55,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:55,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:55,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:55,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:55,559 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:11:55,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:55,559 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:11:55,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:55,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:55,583 INFO ]: Computing forward predicates... [2018-06-22 11:11:55,747 INFO ]: Checked inductivity of 48 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:11:55,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:55,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 11:11:55,766 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:11:55,766 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:11:55,766 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:55,766 INFO ]: Start difference. First operand 47 states and 68 transitions. Second operand 14 states. [2018-06-22 11:11:56,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:56,001 INFO ]: Finished difference Result 81 states and 107 transitions. [2018-06-22 11:11:56,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:56,001 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 11:11:56,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:56,002 INFO ]: With dead ends: 81 [2018-06-22 11:11:56,002 INFO ]: Without dead ends: 81 [2018-06-22 11:11:56,002 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:11:56,002 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:11:56,004 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 45. [2018-06-22 11:11:56,004 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:11:56,004 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2018-06-22 11:11:56,004 INFO ]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 29 [2018-06-22 11:11:56,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:56,004 INFO ]: Abstraction has 45 states and 66 transitions. [2018-06-22 11:11:56,004 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:11:56,004 INFO ]: Start isEmpty. Operand 45 states and 66 transitions. [2018-06-22 11:11:56,005 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:11:56,005 INFO ]: Found error trace [2018-06-22 11:11:56,005 INFO ]: trace histogram [7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:56,005 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:56,005 INFO ]: Analyzing trace with hash 399283255, now seen corresponding path program 3 times [2018-06-22 11:11:56,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:56,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:56,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:56,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:11:56,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:56,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:56,105 INFO ]: Checked inductivity of 69 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:11:56,105 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:56,105 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:11:56,111 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:11:56,132 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:11:56,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:56,133 INFO ]: Computing forward predicates... [2018-06-22 11:11:56,233 INFO ]: Checked inductivity of 69 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:11:56,252 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:56,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-22 11:11:56,252 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:11:56,252 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:11:56,252 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:11:56,252 INFO ]: Start difference. First operand 45 states and 66 transitions. Second operand 14 states. [2018-06-22 11:11:56,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:56,482 INFO ]: Finished difference Result 81 states and 107 transitions. [2018-06-22 11:11:56,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:11:56,482 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:11:56,482 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:56,482 INFO ]: With dead ends: 81 [2018-06-22 11:11:56,482 INFO ]: Without dead ends: 71 [2018-06-22 11:11:56,482 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:11:56,483 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:11:56,484 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-06-22 11:11:56,484 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:11:56,485 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2018-06-22 11:11:56,485 INFO ]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 33 [2018-06-22 11:11:56,485 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:56,485 INFO ]: Abstraction has 45 states and 65 transitions. [2018-06-22 11:11:56,485 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:11:56,485 INFO ]: Start isEmpty. Operand 45 states and 65 transitions. [2018-06-22 11:11:56,485 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:11:56,485 INFO ]: Found error trace [2018-06-22 11:11:56,485 INFO ]: trace histogram [7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:56,485 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:56,486 INFO ]: Analyzing trace with hash -1789479022, now seen corresponding path program 2 times [2018-06-22 11:11:56,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:56,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:56,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:56,486 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:56,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:56,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:56,672 INFO ]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:11:56,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:56,672 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:11:56,677 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:56,697 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:56,697 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:56,699 INFO ]: Computing forward predicates... [2018-06-22 11:11:56,905 INFO ]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:11:56,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:56,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-22 11:11:56,923 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:11:56,923 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:11:56,923 INFO ]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:11:56,924 INFO ]: Start difference. First operand 45 states and 65 transitions. Second operand 15 states. [2018-06-22 11:11:57,148 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:57,148 INFO ]: Finished difference Result 73 states and 98 transitions. [2018-06-22 11:11:57,148 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:11:57,148 INFO ]: Start accepts. Automaton has 15 states. Word has length 33 [2018-06-22 11:11:57,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:57,149 INFO ]: With dead ends: 73 [2018-06-22 11:11:57,149 INFO ]: Without dead ends: 73 [2018-06-22 11:11:57,149 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:57,149 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 11:11:57,151 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 49. [2018-06-22 11:11:57,151 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:11:57,152 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2018-06-22 11:11:57,152 INFO ]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 33 [2018-06-22 11:11:57,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:57,152 INFO ]: Abstraction has 49 states and 69 transitions. [2018-06-22 11:11:57,152 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:11:57,152 INFO ]: Start isEmpty. Operand 49 states and 69 transitions. [2018-06-22 11:11:57,152 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:11:57,152 INFO ]: Found error trace [2018-06-22 11:11:57,152 INFO ]: trace histogram [7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:57,153 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:57,154 INFO ]: Analyzing trace with hash 481840513, now seen corresponding path program 2 times [2018-06-22 11:11:57,154 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:57,154 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:57,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:57,154 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:57,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:57,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:57,917 INFO ]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:11:57,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:57,917 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:11:57,923 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:11:57,943 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:11:57,943 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:57,944 INFO ]: Computing forward predicates... [2018-06-22 11:11:58,053 INFO ]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:11:58,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:58,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-22 11:11:58,072 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:11:58,072 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:11:58,072 INFO ]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:11:58,072 INFO ]: Start difference. First operand 49 states and 69 transitions. Second operand 20 states. [2018-06-22 11:11:58,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:58,615 INFO ]: Finished difference Result 75 states and 100 transitions. [2018-06-22 11:11:58,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:11:58,616 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:11:58,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:58,616 INFO ]: With dead ends: 75 [2018-06-22 11:11:58,616 INFO ]: Without dead ends: 75 [2018-06-22 11:11:58,616 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:11:58,616 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 11:11:58,618 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 51. [2018-06-22 11:11:58,618 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:11:58,618 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-06-22 11:11:58,618 INFO ]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 33 [2018-06-22 11:11:58,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:58,618 INFO ]: Abstraction has 51 states and 71 transitions. [2018-06-22 11:11:58,618 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:11:58,618 INFO ]: Start isEmpty. Operand 51 states and 71 transitions. [2018-06-22 11:11:58,618 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:11:58,618 INFO ]: Found error trace [2018-06-22 11:11:58,618 INFO ]: trace histogram [8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:58,618 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:58,618 INFO ]: Analyzing trace with hash -1273612887, now seen corresponding path program 4 times [2018-06-22 11:11:58,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:58,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:58,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:58,619 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:58,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:58,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:58,721 INFO ]: Checked inductivity of 91 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:11:58,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:58,721 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:11:58,727 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:11:58,749 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:11:58,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:58,752 INFO ]: Computing forward predicates... [2018-06-22 11:11:59,005 INFO ]: Checked inductivity of 91 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 11:11:59,025 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:59,025 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-22 11:11:59,025 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:11:59,025 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:11:59,025 INFO ]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:11:59,025 INFO ]: Start difference. First operand 51 states and 71 transitions. Second operand 17 states. [2018-06-22 11:11:59,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:11:59,387 INFO ]: Finished difference Result 77 states and 102 transitions. [2018-06-22 11:11:59,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:11:59,388 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 11:11:59,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:11:59,388 INFO ]: With dead ends: 77 [2018-06-22 11:11:59,388 INFO ]: Without dead ends: 77 [2018-06-22 11:11:59,388 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:11:59,388 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:11:59,390 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 53. [2018-06-22 11:11:59,390 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:11:59,390 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-06-22 11:11:59,390 INFO ]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 37 [2018-06-22 11:11:59,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:11:59,390 INFO ]: Abstraction has 53 states and 73 transitions. [2018-06-22 11:11:59,390 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:11:59,390 INFO ]: Start isEmpty. Operand 53 states and 73 transitions. [2018-06-22 11:11:59,390 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:11:59,390 INFO ]: Found error trace [2018-06-22 11:11:59,390 INFO ]: trace histogram [8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:11:59,390 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:11:59,391 INFO ]: Analyzing trace with hash 932318842, now seen corresponding path program 3 times [2018-06-22 11:11:59,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:11:59,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:11:59,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:59,391 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:11:59,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:11:59,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:59,532 INFO ]: Checked inductivity of 94 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:11:59,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:11:59,532 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:11:59,539 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:11:59,563 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:11:59,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:11:59,565 INFO ]: Computing forward predicates... [2018-06-22 11:11:59,727 INFO ]: Checked inductivity of 94 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:11:59,746 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:11:59,746 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-06-22 11:11:59,746 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:11:59,746 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:11:59,746 INFO ]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:11:59,746 INFO ]: Start difference. First operand 53 states and 73 transitions. Second operand 22 states. [2018-06-22 11:12:00,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:00,073 INFO ]: Finished difference Result 83 states and 108 transitions. [2018-06-22 11:12:00,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:12:00,073 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:12:00,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:00,074 INFO ]: With dead ends: 83 [2018-06-22 11:12:00,074 INFO ]: Without dead ends: 83 [2018-06-22 11:12:00,074 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:12:00,074 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:12:00,075 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-06-22 11:12:00,075 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:12:00,076 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-06-22 11:12:00,076 INFO ]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 37 [2018-06-22 11:12:00,076 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:00,076 INFO ]: Abstraction has 51 states and 71 transitions. [2018-06-22 11:12:00,076 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:12:00,076 INFO ]: Start isEmpty. Operand 51 states and 71 transitions. [2018-06-22 11:12:00,076 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:12:00,076 INFO ]: Found error trace [2018-06-22 11:12:00,076 INFO ]: trace histogram [8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:00,076 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:00,076 INFO ]: Analyzing trace with hash 1827005609, now seen corresponding path program 3 times [2018-06-22 11:12:00,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:00,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:00,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:00,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:00,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:00,086 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:00,267 INFO ]: Checked inductivity of 94 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:12:00,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:00,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:00,272 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:12:00,301 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:12:00,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:00,303 INFO ]: Computing forward predicates... [2018-06-22 11:12:00,383 INFO ]: Checked inductivity of 94 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:12:00,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:00,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-22 11:12:00,402 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:12:00,402 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:12:00,402 INFO ]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:12:00,402 INFO ]: Start difference. First operand 51 states and 71 transitions. Second operand 15 states. [2018-06-22 11:12:00,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:00,836 INFO ]: Finished difference Result 93 states and 118 transitions. [2018-06-22 11:12:00,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:00,837 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-22 11:12:00,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:00,837 INFO ]: With dead ends: 93 [2018-06-22 11:12:00,837 INFO ]: Without dead ends: 81 [2018-06-22 11:12:00,837 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:12:00,837 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:12:00,840 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 49. [2018-06-22 11:12:00,840 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:12:00,840 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2018-06-22 11:12:00,840 INFO ]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 37 [2018-06-22 11:12:00,840 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:00,840 INFO ]: Abstraction has 49 states and 68 transitions. [2018-06-22 11:12:00,840 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:12:00,840 INFO ]: Start isEmpty. Operand 49 states and 68 transitions. [2018-06-22 11:12:00,842 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:12:00,842 INFO ]: Found error trace [2018-06-22 11:12:00,842 INFO ]: trace histogram [9, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:00,842 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:00,842 INFO ]: Analyzing trace with hash -894805505, now seen corresponding path program 5 times [2018-06-22 11:12:00,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:00,843 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:00,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:00,843 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:00,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:00,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:01,187 INFO ]: Checked inductivity of 119 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:12:01,187 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:01,187 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:01,192 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:12:01,218 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 11:12:01,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:01,221 INFO ]: Computing forward predicates... [2018-06-22 11:12:01,389 INFO ]: Checked inductivity of 119 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-22 11:12:01,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:01,409 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2018-06-22 11:12:01,409 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:12:01,409 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:12:01,409 INFO ]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:12:01,409 INFO ]: Start difference. First operand 49 states and 68 transitions. Second operand 25 states. [2018-06-22 11:12:01,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:01,864 INFO ]: Finished difference Result 77 states and 104 transitions. [2018-06-22 11:12:01,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:12:01,864 INFO ]: Start accepts. Automaton has 25 states. Word has length 41 [2018-06-22 11:12:01,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:01,864 INFO ]: With dead ends: 77 [2018-06-22 11:12:01,864 INFO ]: Without dead ends: 77 [2018-06-22 11:12:01,865 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:12:01,865 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-22 11:12:01,866 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 53. [2018-06-22 11:12:01,866 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:12:01,867 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2018-06-22 11:12:01,867 INFO ]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 41 [2018-06-22 11:12:01,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:01,867 INFO ]: Abstraction has 53 states and 76 transitions. [2018-06-22 11:12:01,867 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:12:01,867 INFO ]: Start isEmpty. Operand 53 states and 76 transitions. [2018-06-22 11:12:01,867 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:12:01,867 INFO ]: Found error trace [2018-06-22 11:12:01,867 INFO ]: trace histogram [9, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:01,867 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:01,867 INFO ]: Analyzing trace with hash -1731639070, now seen corresponding path program 4 times [2018-06-22 11:12:01,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:01,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:01,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:01,868 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:01,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:01,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:02,252 INFO ]: Checked inductivity of 123 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:12:02,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:02,252 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:02,257 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:12:02,280 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:12:02,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:02,282 INFO ]: Computing forward predicates... [2018-06-22 11:12:02,371 INFO ]: Checked inductivity of 123 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:12:02,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:02,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-22 11:12:02,390 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:12:02,390 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:12:02,390 INFO ]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:12:02,390 INFO ]: Start difference. First operand 53 states and 76 transitions. Second operand 16 states. [2018-06-22 11:12:02,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:02,586 INFO ]: Finished difference Result 67 states and 89 transitions. [2018-06-22 11:12:02,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:12:02,587 INFO ]: Start accepts. Automaton has 16 states. Word has length 41 [2018-06-22 11:12:02,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:02,587 INFO ]: With dead ends: 67 [2018-06-22 11:12:02,587 INFO ]: Without dead ends: 53 [2018-06-22 11:12:02,587 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:12:02,587 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:12:02,589 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-22 11:12:02,589 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:12:02,589 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2018-06-22 11:12:02,589 INFO ]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 41 [2018-06-22 11:12:02,589 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:02,589 INFO ]: Abstraction has 53 states and 75 transitions. [2018-06-22 11:12:02,589 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:12:02,589 INFO ]: Start isEmpty. Operand 53 states and 75 transitions. [2018-06-22 11:12:02,590 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:12:02,590 INFO ]: Found error trace [2018-06-22 11:12:02,590 INFO ]: trace histogram [10, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:02,590 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:02,590 INFO ]: Analyzing trace with hash 1577434745, now seen corresponding path program 5 times [2018-06-22 11:12:02,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:02,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:02,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:02,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:02,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:02,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:02,838 INFO ]: Checked inductivity of 151 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 11:12:02,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:02,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:02,844 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:12:02,988 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:12:02,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:02,991 INFO ]: Computing forward predicates... [2018-06-22 11:12:03,226 INFO ]: Checked inductivity of 151 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:12:03,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:03,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-06-22 11:12:03,258 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:12:03,258 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:12:03,258 INFO ]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:12:03,258 INFO ]: Start difference. First operand 53 states and 75 transitions. Second operand 27 states. [2018-06-22 11:12:03,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:03,730 INFO ]: Finished difference Result 93 states and 120 transitions. [2018-06-22 11:12:03,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:12:03,730 INFO ]: Start accepts. Automaton has 27 states. Word has length 45 [2018-06-22 11:12:03,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:03,730 INFO ]: With dead ends: 93 [2018-06-22 11:12:03,730 INFO ]: Without dead ends: 93 [2018-06-22 11:12:03,731 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:12:03,731 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:12:03,732 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 57. [2018-06-22 11:12:03,732 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:12:03,732 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2018-06-22 11:12:03,732 INFO ]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 45 [2018-06-22 11:12:03,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:03,732 INFO ]: Abstraction has 57 states and 79 transitions. [2018-06-22 11:12:03,732 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:12:03,733 INFO ]: Start isEmpty. Operand 57 states and 79 transitions. [2018-06-22 11:12:03,733 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:12:03,733 INFO ]: Found error trace [2018-06-22 11:12:03,733 INFO ]: trace histogram [10, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:03,733 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:03,733 INFO ]: Analyzing trace with hash -1039650959, now seen corresponding path program 6 times [2018-06-22 11:12:03,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:03,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:03,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:03,735 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:03,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:03,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:03,889 INFO ]: Checked inductivity of 148 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:12:03,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:03,889 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:03,895 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:12:03,927 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:12:03,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:03,929 INFO ]: Computing forward predicates... [2018-06-22 11:12:04,518 INFO ]: Checked inductivity of 148 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:12:04,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:04,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 20 [2018-06-22 11:12:04,538 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:12:04,538 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:12:04,538 INFO ]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:12:04,538 INFO ]: Start difference. First operand 57 states and 79 transitions. Second operand 20 states. [2018-06-22 11:12:04,923 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:04,923 INFO ]: Finished difference Result 97 states and 123 transitions. [2018-06-22 11:12:04,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:12:04,923 INFO ]: Start accepts. Automaton has 20 states. Word has length 45 [2018-06-22 11:12:04,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:04,923 INFO ]: With dead ends: 97 [2018-06-22 11:12:04,923 INFO ]: Without dead ends: 97 [2018-06-22 11:12:04,924 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=870, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:12:04,924 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:12:04,926 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 59. [2018-06-22 11:12:04,926 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:12:04,926 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2018-06-22 11:12:04,927 INFO ]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 45 [2018-06-22 11:12:04,927 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:04,927 INFO ]: Abstraction has 59 states and 81 transitions. [2018-06-22 11:12:04,927 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:12:04,927 INFO ]: Start isEmpty. Operand 59 states and 81 transitions. [2018-06-22 11:12:04,927 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:12:04,927 INFO ]: Found error trace [2018-06-22 11:12:04,927 INFO ]: trace histogram [10, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:04,927 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:04,927 INFO ]: Analyzing trace with hash -650640217, now seen corresponding path program 7 times [2018-06-22 11:12:04,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:04,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:04,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:04,928 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:04,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:04,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:05,173 INFO ]: Checked inductivity of 151 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:12:05,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:05,173 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:05,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:05,206 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:05,208 INFO ]: Computing forward predicates... [2018-06-22 11:12:05,813 INFO ]: Checked inductivity of 151 backedges. 48 proven. 47 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:12:05,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:05,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2018-06-22 11:12:05,833 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:12:05,833 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:12:05,833 INFO ]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:12:05,833 INFO ]: Start difference. First operand 59 states and 81 transitions. Second operand 18 states. [2018-06-22 11:12:06,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:06,117 INFO ]: Finished difference Result 107 states and 134 transitions. [2018-06-22 11:12:06,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:12:06,117 INFO ]: Start accepts. Automaton has 18 states. Word has length 45 [2018-06-22 11:12:06,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:06,118 INFO ]: With dead ends: 107 [2018-06-22 11:12:06,118 INFO ]: Without dead ends: 93 [2018-06-22 11:12:06,118 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:12:06,118 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:12:06,120 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 57. [2018-06-22 11:12:06,120 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:12:06,120 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-06-22 11:12:06,120 INFO ]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 45 [2018-06-22 11:12:06,121 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:06,121 INFO ]: Abstraction has 57 states and 78 transitions. [2018-06-22 11:12:06,121 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:12:06,121 INFO ]: Start isEmpty. Operand 57 states and 78 transitions. [2018-06-22 11:12:06,121 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:12:06,121 INFO ]: Found error trace [2018-06-22 11:12:06,121 INFO ]: trace histogram [10, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:06,121 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:06,121 INFO ]: Analyzing trace with hash 1026074068, now seen corresponding path program 5 times [2018-06-22 11:12:06,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:06,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:06,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:06,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:06,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:06,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:06,325 INFO ]: Checked inductivity of 151 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 11:12:06,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:06,325 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:06,331 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:12:06,361 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:12:06,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:06,364 INFO ]: Computing forward predicates... [2018-06-22 11:12:06,646 INFO ]: Checked inductivity of 151 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:12:06,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:06,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 19 [2018-06-22 11:12:06,665 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:12:06,665 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:12:06,665 INFO ]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:12:06,665 INFO ]: Start difference. First operand 57 states and 78 transitions. Second operand 19 states. [2018-06-22 11:12:06,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:06,958 INFO ]: Finished difference Result 93 states and 119 transitions. [2018-06-22 11:12:06,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:12:06,958 INFO ]: Start accepts. Automaton has 19 states. Word has length 45 [2018-06-22 11:12:06,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:06,958 INFO ]: With dead ends: 93 [2018-06-22 11:12:06,958 INFO ]: Without dead ends: 93 [2018-06-22 11:12:06,958 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:12:06,959 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:12:06,960 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 55. [2018-06-22 11:12:06,960 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:12:06,961 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2018-06-22 11:12:06,961 INFO ]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 45 [2018-06-22 11:12:06,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:06,961 INFO ]: Abstraction has 55 states and 76 transitions. [2018-06-22 11:12:06,961 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:12:06,961 INFO ]: Start isEmpty. Operand 55 states and 76 transitions. [2018-06-22 11:12:06,961 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:12:06,961 INFO ]: Found error trace [2018-06-22 11:12:06,961 INFO ]: trace histogram [10, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:06,961 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:06,962 INFO ]: Analyzing trace with hash -1614811197, now seen corresponding path program 4 times [2018-06-22 11:12:06,962 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:06,962 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:06,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:06,962 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:06,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:06,973 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:07,262 INFO ]: Checked inductivity of 151 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 11:12:07,262 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:07,262 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:07,268 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:12:07,294 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:12:07,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:07,296 INFO ]: Computing forward predicates... [2018-06-22 11:12:07,478 INFO ]: Checked inductivity of 151 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:12:07,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:07,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 19 [2018-06-22 11:12:07,498 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:12:07,498 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:12:07,498 INFO ]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:12:07,498 INFO ]: Start difference. First operand 55 states and 76 transitions. Second operand 19 states. [2018-06-22 11:12:07,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:07,776 INFO ]: Finished difference Result 107 states and 133 transitions. [2018-06-22 11:12:07,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:12:07,776 INFO ]: Start accepts. Automaton has 19 states. Word has length 45 [2018-06-22 11:12:07,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:07,777 INFO ]: With dead ends: 107 [2018-06-22 11:12:07,777 INFO ]: Without dead ends: 107 [2018-06-22 11:12:07,777 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:12:07,778 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:12:07,780 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 53. [2018-06-22 11:12:07,780 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:12:07,780 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2018-06-22 11:12:07,780 INFO ]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 45 [2018-06-22 11:12:07,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:07,780 INFO ]: Abstraction has 53 states and 74 transitions. [2018-06-22 11:12:07,780 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:12:07,780 INFO ]: Start isEmpty. Operand 53 states and 74 transitions. [2018-06-22 11:12:07,780 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:12:07,780 INFO ]: Found error trace [2018-06-22 11:12:07,780 INFO ]: trace histogram [11, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:07,780 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:07,781 INFO ]: Analyzing trace with hash -491999199, now seen corresponding path program 6 times [2018-06-22 11:12:07,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:07,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:07,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:07,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:07,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:07,790 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:08,092 INFO ]: Checked inductivity of 187 backedges. 62 proven. 55 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-22 11:12:08,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:08,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:08,104 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:12:08,139 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 11:12:08,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:08,142 INFO ]: Computing forward predicates... [2018-06-22 11:12:08,340 INFO ]: Checked inductivity of 187 backedges. 62 proven. 54 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-22 11:12:08,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:08,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 19 [2018-06-22 11:12:08,358 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:12:08,358 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:12:08,358 INFO ]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:12:08,358 INFO ]: Start difference. First operand 53 states and 74 transitions. Second operand 19 states. [2018-06-22 11:12:08,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:08,635 INFO ]: Finished difference Result 107 states and 133 transitions. [2018-06-22 11:12:08,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:12:08,635 INFO ]: Start accepts. Automaton has 19 states. Word has length 49 [2018-06-22 11:12:08,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:08,636 INFO ]: With dead ends: 107 [2018-06-22 11:12:08,636 INFO ]: Without dead ends: 91 [2018-06-22 11:12:08,636 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:12:08,636 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:12:08,638 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 53. [2018-06-22 11:12:08,638 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:12:08,638 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-06-22 11:12:08,638 INFO ]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 49 [2018-06-22 11:12:08,638 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:08,638 INFO ]: Abstraction has 53 states and 73 transitions. [2018-06-22 11:12:08,638 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:12:08,638 INFO ]: Start isEmpty. Operand 53 states and 73 transitions. [2018-06-22 11:12:08,639 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:12:08,639 INFO ]: Found error trace [2018-06-22 11:12:08,639 INFO ]: trace histogram [11, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:08,639 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:08,639 INFO ]: Analyzing trace with hash -2068632388, now seen corresponding path program 6 times [2018-06-22 11:12:08,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:08,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:08,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:08,640 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:08,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:08,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:08,916 INFO ]: Checked inductivity of 187 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 11:12:08,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:08,916 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:08,921 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:12:08,956 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-22 11:12:08,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:08,958 INFO ]: Computing forward predicates... [2018-06-22 11:12:09,106 INFO ]: Checked inductivity of 187 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 11:12:09,124 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:09,124 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-06-22 11:12:09,124 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:12:09,124 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:12:09,124 INFO ]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:12:09,124 INFO ]: Start difference. First operand 53 states and 73 transitions. Second operand 20 states. [2018-06-22 11:12:09,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:09,406 INFO ]: Finished difference Result 93 states and 118 transitions. [2018-06-22 11:12:09,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:12:09,442 INFO ]: Start accepts. Automaton has 20 states. Word has length 49 [2018-06-22 11:12:09,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:09,442 INFO ]: With dead ends: 93 [2018-06-22 11:12:09,442 INFO ]: Without dead ends: 93 [2018-06-22 11:12:09,443 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:12:09,443 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:12:09,445 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 57. [2018-06-22 11:12:09,445 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:12:09,445 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2018-06-22 11:12:09,445 INFO ]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 49 [2018-06-22 11:12:09,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:09,446 INFO ]: Abstraction has 57 states and 77 transitions. [2018-06-22 11:12:09,446 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:12:09,446 INFO ]: Start isEmpty. Operand 57 states and 77 transitions. [2018-06-22 11:12:09,446 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:12:09,446 INFO ]: Found error trace [2018-06-22 11:12:09,446 INFO ]: trace histogram [11, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:09,446 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:09,446 INFO ]: Analyzing trace with hash -1633700117, now seen corresponding path program 5 times [2018-06-22 11:12:09,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:09,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:09,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:09,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:09,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:09,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:09,995 INFO ]: Checked inductivity of 187 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-22 11:12:09,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:09,995 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:10,000 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:12:10,033 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-06-22 11:12:10,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:10,036 INFO ]: Computing forward predicates... [2018-06-22 11:12:10,463 INFO ]: Checked inductivity of 187 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-22 11:12:10,481 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:10,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2018-06-22 11:12:10,482 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:12:10,482 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:12:10,482 INFO ]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:12:10,482 INFO ]: Start difference. First operand 57 states and 77 transitions. Second operand 29 states. [2018-06-22 11:12:10,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:10,933 INFO ]: Finished difference Result 95 states and 120 transitions. [2018-06-22 11:12:10,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:12:10,933 INFO ]: Start accepts. Automaton has 29 states. Word has length 49 [2018-06-22 11:12:10,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:10,933 INFO ]: With dead ends: 95 [2018-06-22 11:12:10,934 INFO ]: Without dead ends: 95 [2018-06-22 11:12:10,934 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:12:10,934 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 11:12:10,936 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-06-22 11:12:10,936 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:12:10,937 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2018-06-22 11:12:10,937 INFO ]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 49 [2018-06-22 11:12:10,937 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:10,937 INFO ]: Abstraction has 59 states and 79 transitions. [2018-06-22 11:12:10,937 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:12:10,937 INFO ]: Start isEmpty. Operand 59 states and 79 transitions. [2018-06-22 11:12:10,938 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:12:10,938 INFO ]: Found error trace [2018-06-22 11:12:10,938 INFO ]: trace histogram [12, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:10,938 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:10,938 INFO ]: Analyzing trace with hash 731731748, now seen corresponding path program 7 times [2018-06-22 11:12:10,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:10,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:10,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:10,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:10,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:10,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:11,238 INFO ]: Checked inductivity of 227 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-22 11:12:11,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:11,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:11,244 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:11,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:11,276 INFO ]: Computing forward predicates... [2018-06-22 11:12:11,530 INFO ]: Checked inductivity of 227 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-06-22 11:12:11,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:11,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2018-06-22 11:12:11,548 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:12:11,549 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:12:11,549 INFO ]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:12:11,549 INFO ]: Start difference. First operand 59 states and 79 transitions. Second operand 31 states. [2018-06-22 11:12:12,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:12,044 INFO ]: Finished difference Result 97 states and 122 transitions. [2018-06-22 11:12:12,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:12:12,044 INFO ]: Start accepts. Automaton has 31 states. Word has length 53 [2018-06-22 11:12:12,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:12,045 INFO ]: With dead ends: 97 [2018-06-22 11:12:12,045 INFO ]: Without dead ends: 97 [2018-06-22 11:12:12,045 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=1582, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:12:12,045 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:12:12,046 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 61. [2018-06-22 11:12:12,046 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:12:12,047 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2018-06-22 11:12:12,047 INFO ]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 53 [2018-06-22 11:12:12,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:12,047 INFO ]: Abstraction has 61 states and 81 transitions. [2018-06-22 11:12:12,047 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:12:12,047 INFO ]: Start isEmpty. Operand 61 states and 81 transitions. [2018-06-22 11:12:12,047 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:12:12,047 INFO ]: Found error trace [2018-06-22 11:12:12,047 INFO ]: trace histogram [12, 7, 7, 7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:12,047 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:12,047 INFO ]: Analyzing trace with hash 468591251, now seen corresponding path program 7 times [2018-06-22 11:12:12,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:12,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:12,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:12,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:12,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:12,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:12,939 INFO ]: Checked inductivity of 222 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:12:12,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:12,939 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:12,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:12,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:12,982 INFO ]: Computing forward predicates... [2018-06-22 11:12:13,414 INFO ]: Checked inductivity of 222 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 11:12:13,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:13,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 22 [2018-06-22 11:12:13,433 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:12:13,433 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:12:13,433 INFO ]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:12:13,433 INFO ]: Start difference. First operand 61 states and 81 transitions. Second operand 22 states. [2018-06-22 11:12:14,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:14,124 INFO ]: Finished difference Result 111 states and 136 transitions. [2018-06-22 11:12:14,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:12:14,124 INFO ]: Start accepts. Automaton has 22 states. Word has length 53 [2018-06-22 11:12:14,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:14,125 INFO ]: With dead ends: 111 [2018-06-22 11:12:14,125 INFO ]: Without dead ends: 111 [2018-06-22 11:12:14,126 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:12:14,126 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-22 11:12:14,127 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 59. [2018-06-22 11:12:14,127 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:12:14,128 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2018-06-22 11:12:14,128 INFO ]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 53 [2018-06-22 11:12:14,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:14,128 INFO ]: Abstraction has 59 states and 79 transitions. [2018-06-22 11:12:14,128 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:12:14,128 INFO ]: Start isEmpty. Operand 59 states and 79 transitions. [2018-06-22 11:12:14,129 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:12:14,129 INFO ]: Found error trace [2018-06-22 11:12:14,129 INFO ]: trace histogram [12, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:14,129 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:14,129 INFO ]: Analyzing trace with hash 2089816467, now seen corresponding path program 6 times [2018-06-22 11:12:14,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:14,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:14,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:14,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:12:14,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:14,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:14,296 INFO ]: Checked inductivity of 227 backedges. 78 proven. 62 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-22 11:12:14,296 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:14,296 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:14,302 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:12:14,342 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 11:12:14,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:14,345 INFO ]: Computing forward predicates... [2018-06-22 11:12:14,518 INFO ]: Checked inductivity of 227 backedges. 78 proven. 61 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-22 11:12:14,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:14,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-06-22 11:12:14,594 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:12:14,594 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:12:14,594 INFO ]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:12:14,594 INFO ]: Start difference. First operand 59 states and 79 transitions. Second operand 20 states. [2018-06-22 11:12:15,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:15,018 INFO ]: Finished difference Result 119 states and 144 transitions. [2018-06-22 11:12:15,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:12:15,018 INFO ]: Start accepts. Automaton has 20 states. Word has length 53 [2018-06-22 11:12:15,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:15,019 INFO ]: With dead ends: 119 [2018-06-22 11:12:15,019 INFO ]: Without dead ends: 101 [2018-06-22 11:12:15,019 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:12:15,019 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 11:12:15,020 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 57. [2018-06-22 11:12:15,020 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:12:15,021 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2018-06-22 11:12:15,021 INFO ]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 53 [2018-06-22 11:12:15,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:15,021 INFO ]: Abstraction has 57 states and 76 transitions. [2018-06-22 11:12:15,021 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:12:15,021 INFO ]: Start isEmpty. Operand 57 states and 76 transitions. [2018-06-22 11:12:15,021 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:12:15,021 INFO ]: Found error trace [2018-06-22 11:12:15,021 INFO ]: trace histogram [13, 8, 8, 8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:15,021 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:15,022 INFO ]: Analyzing trace with hash -1795644183, now seen corresponding path program 8 times [2018-06-22 11:12:15,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:15,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:15,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:15,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:15,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:15,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:15,874 INFO ]: Checked inductivity of 265 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-22 11:12:15,874 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:15,874 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:15,881 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:12:15,925 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:12:15,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:15,928 INFO ]: Computing forward predicates... [2018-06-22 11:12:16,272 INFO ]: Checked inductivity of 265 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-22 11:12:16,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:16,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2018-06-22 11:12:16,290 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:12:16,290 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:12:16,290 INFO ]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:12:16,291 INFO ]: Start difference. First operand 57 states and 76 transitions. Second operand 33 states. [2018-06-22 11:12:16,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:16,843 INFO ]: Finished difference Result 91 states and 118 transitions. [2018-06-22 11:12:16,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:12:16,843 INFO ]: Start accepts. Automaton has 33 states. Word has length 57 [2018-06-22 11:12:16,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:16,844 INFO ]: With dead ends: 91 [2018-06-22 11:12:16,844 INFO ]: Without dead ends: 91 [2018-06-22 11:12:16,844 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=1840, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:12:16,844 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:12:16,846 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 61. [2018-06-22 11:12:16,846 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:12:16,847 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2018-06-22 11:12:16,847 INFO ]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 57 [2018-06-22 11:12:16,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:16,847 INFO ]: Abstraction has 61 states and 84 transitions. [2018-06-22 11:12:16,847 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:12:16,847 INFO ]: Start isEmpty. Operand 61 states and 84 transitions. [2018-06-22 11:12:16,847 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:12:16,847 INFO ]: Found error trace [2018-06-22 11:12:16,847 INFO ]: trace histogram [13, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:16,847 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:16,848 INFO ]: Analyzing trace with hash -864975604, now seen corresponding path program 8 times [2018-06-22 11:12:16,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:16,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:16,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:16,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:16,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:16,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:17,134 INFO ]: Checked inductivity of 271 backedges. 96 proven. 69 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:12:17,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:17,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:17,140 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:12:17,172 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:12:17,172 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:17,174 INFO ]: Computing forward predicates... [2018-06-22 11:12:17,335 INFO ]: Checked inductivity of 271 backedges. 96 proven. 68 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-22 11:12:17,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:17,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 21 [2018-06-22 11:12:17,354 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:12:17,354 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:12:17,354 INFO ]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:12:17,354 INFO ]: Start difference. First operand 61 states and 84 transitions. Second operand 21 states. [2018-06-22 11:12:17,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:17,654 INFO ]: Finished difference Result 81 states and 103 transitions. [2018-06-22 11:12:17,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:12:17,654 INFO ]: Start accepts. Automaton has 21 states. Word has length 57 [2018-06-22 11:12:17,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:17,654 INFO ]: With dead ends: 81 [2018-06-22 11:12:17,654 INFO ]: Without dead ends: 61 [2018-06-22 11:12:17,655 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:12:17,655 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:12:17,656 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-22 11:12:17,656 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 11:12:17,656 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2018-06-22 11:12:17,656 INFO ]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 57 [2018-06-22 11:12:17,656 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:17,656 INFO ]: Abstraction has 61 states and 83 transitions. [2018-06-22 11:12:17,656 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:12:17,656 INFO ]: Start isEmpty. Operand 61 states and 83 transitions. [2018-06-22 11:12:17,656 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:12:17,656 INFO ]: Found error trace [2018-06-22 11:12:17,656 INFO ]: trace histogram [14, 9, 9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:17,656 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:17,657 INFO ]: Analyzing trace with hash 1463857937, now seen corresponding path program 9 times [2018-06-22 11:12:17,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:17,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:17,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:17,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:17,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:17,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:17,924 INFO ]: Checked inductivity of 312 backedges. 98 proven. 95 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-22 11:12:17,924 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:12:17,924 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:12:17,929 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:12:17,992 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:12:17,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:12:17,995 INFO ]: Computing forward predicates... [2018-06-22 11:12:18,439 INFO ]: Checked inductivity of 312 backedges. 98 proven. 92 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-22 11:12:18,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:12:18,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2018-06-22 11:12:18,458 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:12:18,458 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:12:18,458 INFO ]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:12:18,458 INFO ]: Start difference. First operand 61 states and 83 transitions. Second operand 23 states. [2018-06-22 11:12:18,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:12:18,884 INFO ]: Finished difference Result 125 states and 152 transitions. [2018-06-22 11:12:18,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:12:18,884 INFO ]: Start accepts. Automaton has 23 states. Word has length 61 [2018-06-22 11:12:18,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:12:18,885 INFO ]: With dead ends: 125 [2018-06-22 11:12:18,885 INFO ]: Without dead ends: 105 [2018-06-22 11:12:18,885 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=1230, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:12:18,885 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 11:12:18,888 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 59. [2018-06-22 11:12:18,888 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:12:18,888 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2018-06-22 11:12:18,888 INFO ]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 61 [2018-06-22 11:12:18,888 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:12:18,888 INFO ]: Abstraction has 59 states and 80 transitions. [2018-06-22 11:12:18,888 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:12:18,888 INFO ]: Start isEmpty. Operand 59 states and 80 transitions. [2018-06-22 11:12:18,889 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:12:18,889 INFO ]: Found error trace [2018-06-22 11:12:18,889 INFO ]: trace histogram [14, 9, 9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:12:18,889 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:12:18,889 INFO ]: Analyzing trace with hash 252809827, now seen corresponding path program 8 times [2018-06-22 11:12:18,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:12:18,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:12:18,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:18,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:12:18,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:12:18,908 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:12:19,116 WARN ]: Removed 4 from assertion stack [2018-06-22 11:12:19,117 WARN ]: Verification canceled [2018-06-22 11:12:19,121 WARN ]: Timeout [2018-06-22 11:12:19,121 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:12:19 BoogieIcfgContainer [2018-06-22 11:12:19,122 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:12:19,122 INFO ]: Toolchain (without parser) took 53264.93 ms. Allocated memory was 309.3 MB in the beginning and 734.0 MB in the end (delta: 424.7 MB). Free memory was 263.9 MB in the beginning and 490.0 MB in the end (delta: -226.2 MB). Peak memory consumption was 198.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:12:19,123 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:12:19,123 INFO ]: ChcToBoogie took 48.33 ms. Allocated memory is still 309.3 MB. Free memory was 262.9 MB in the beginning and 260.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:12:19,123 INFO ]: Boogie Preprocessor took 47.88 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 259.9 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 3.6 GB. [2018-06-22 11:12:19,124 INFO ]: RCFGBuilder took 463.45 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 246.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:12:19,124 INFO ]: TraceAbstraction took 52692.18 ms. Allocated memory was 309.3 MB in the beginning and 734.0 MB in the end (delta: 424.7 MB). Free memory was 246.9 MB in the beginning and 490.0 MB in the end (delta: -243.2 MB). Peak memory consumption was 181.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:12:19,130 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 309.3 MB. Free memory is still 274.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.33 ms. Allocated memory is still 309.3 MB. Free memory was 262.9 MB in the beginning and 260.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 47.88 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 259.9 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 3.6 GB. * RCFGBuilder took 463.45 ms. Allocated memory is still 309.3 MB. Free memory was 259.9 MB in the beginning and 246.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52692.18 ms. Allocated memory was 309.3 MB in the beginning and 734.0 MB in the end (delta: 424.7 MB). Free memory was 246.9 MB in the beginning and 490.0 MB in the end (delta: -243.2 MB). Peak memory consumption was 181.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 11. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. TIMEOUT Result, 52.6s OverallTime, 56 OverallIterations, 14 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1717 SDtfs, 557 SDslu, 5864 SDs, 0 SdLazy, 15074 SolverSat, 1771 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2552 GetRequests, 1271 SyntacticMatches, 239 SemanticMatches, 1042 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4444 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=13, 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.6s AutomataMinimizationTime, 55 MinimizatonAttempts, 1324 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 3115 NumberOfCodeBlocks, 3091 NumberOfCodeBlocksAsserted, 217 NumberOfCheckSat, 3016 ConstructedInterpolants, 16 QuantifiedInterpolants, 470652 SizeOfPredicates, 430 NumberOfNonLiveVariables, 9220 ConjunctsInSsa, 1267 ConjunctsInUnsatCore, 99 InterpolantComputations, 12 PerfectInterpolantSequences, 4411/8271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-12-19-143.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-12-19-143.csv Completed graceful shutdown