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/020b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:18:51,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:18:51,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:18:51,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:18:51,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:18:51,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:18:51,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:18:51,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:18:51,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:18:51,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:18:51,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:18:51,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:18:51,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:18:51,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:18:51,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:18:51,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:18:51,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:18:51,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:18:51,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:18:51,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:18:51,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:18:51,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:18:51,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:18:51,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:18:51,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:18:51,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:18:51,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:18:51,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:18:51,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:18:51,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:18:51,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:18:51,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:18:51,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:18:51,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:18:51,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:18:51,172 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:18:51,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:18:51,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:18:51,190 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:18:51,190 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:18:51,191 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:18:51,191 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:18:51,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:18:51,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:18:51,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:18:51,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:18:51,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:18:51,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:18:51,193 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:18:51,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:18:51,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:18:51,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:18:51,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:18:51,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:18:51,194 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:18:51,195 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:18:51,195 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:18:51,238 INFO ]: Repository-Root is: /tmp [2018-06-22 11:18:51,252 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:18:51,257 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:18:51,259 INFO ]: Initializing SmtParser... [2018-06-22 11:18:51,259 INFO ]: SmtParser initialized [2018-06-22 11:18:51,259 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/020b-horn.smt2 [2018-06-22 11:18:51,261 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:18:51,352 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/020b-horn.smt2 unknown [2018-06-22 11:18:51,517 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/020b-horn.smt2 [2018-06-22 11:18:51,527 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:18:51,533 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:18:51,534 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:18:51,534 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:18:51,534 INFO ]: ChcToBoogie initialized [2018-06-22 11:18:51,537 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,576 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51 Unit [2018-06-22 11:18:51,576 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:18:51,577 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:18:51,577 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:18:51,577 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:18:51,599 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,599 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,605 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,605 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,608 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,610 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,610 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (1/1) ... [2018-06-22 11:18:51,612 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:18:51,612 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:18:51,612 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:18:51,612 INFO ]: RCFGBuilder initialized [2018-06-22 11:18:51,613 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:18:51,633 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:18:51,633 INFO ]: Found specification of procedure False [2018-06-22 11:18:51,633 INFO ]: Found implementation of procedure False [2018-06-22 11:18:51,633 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:18:51,633 INFO ]: Found specification of procedure INV1 [2018-06-22 11:18:51,633 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:18:51,633 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:18:51,634 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:18:51,634 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:18:51,869 INFO ]: Using library mode [2018-06-22 11:18:51,870 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:18:51 BoogieIcfgContainer [2018-06-22 11:18:51,870 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:18:51,871 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:18:51,871 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:18:51,881 INFO ]: TraceAbstraction initialized [2018-06-22 11:18:51,882 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:18:51" (1/3) ... [2018-06-22 11:18:51,882 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475f1640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:18:51, skipping insertion in model container [2018-06-22 11:18:51,885 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:18:51" (2/3) ... [2018-06-22 11:18:51,885 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475f1640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:18:51, skipping insertion in model container [2018-06-22 11:18:51,885 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:18:51" (3/3) ... [2018-06-22 11:18:51,887 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:18:51,906 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:18:51,916 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:18:51,966 INFO ]: Using default assertion order modulation [2018-06-22 11:18:51,966 INFO ]: Interprodecural is true [2018-06-22 11:18:51,966 INFO ]: Hoare is false [2018-06-22 11:18:51,967 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:18:51,967 INFO ]: Backedges is TWOTRACK [2018-06-22 11:18:51,967 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:18:51,967 INFO ]: Difference is false [2018-06-22 11:18:51,967 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:18:51,967 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:18:51,979 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:18:51,988 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:18:51,988 INFO ]: Found error trace [2018-06-22 11:18:51,989 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:51,989 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:51,993 INFO ]: Analyzing trace with hash -1409059775, now seen corresponding path program 1 times [2018-06-22 11:18:51,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:51,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:52,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:52,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:52,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:52,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:52,181 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:18:52,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:18:52,182 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:18:52,184 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:18:52,198 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:18:52,199 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:18:52,201 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:18:52,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:52,321 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:18:52,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:18:52,322 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:18:52,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:52,331 INFO ]: With dead ends: 15 [2018-06-22 11:18:52,331 INFO ]: Without dead ends: 15 [2018-06-22 11:18:52,332 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:18:52,344 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:18:52,377 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:18:52,377 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:18:52,378 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:18:52,379 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:18:52,380 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:52,380 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:18:52,380 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:18:52,380 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:18:52,381 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:18:52,381 INFO ]: Found error trace [2018-06-22 11:18:52,381 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:52,382 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:52,382 INFO ]: Analyzing trace with hash 1397489035, now seen corresponding path program 1 times [2018-06-22 11:18:52,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:52,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:52,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:52,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:52,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:52,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:52,510 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:18:52,510 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:52,510 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:18:52,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:52,556 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:52,566 INFO ]: Computing forward predicates... [2018-06-22 11:18:53,058 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:18:53,090 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:53,090 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:18:53,091 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:18:53,091 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:18:53,091 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:18:53,091 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 10 states. [2018-06-22 11:18:53,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:53,558 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-22 11:18:53,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:18:53,559 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:18:53,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:53,559 INFO ]: With dead ends: 21 [2018-06-22 11:18:53,560 INFO ]: Without dead ends: 21 [2018-06-22 11:18:53,561 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:18:53,561 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:18:53,568 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 11:18:53,569 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:18:53,569 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 11:18:53,569 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 13 [2018-06-22 11:18:53,570 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:53,571 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 11:18:53,571 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:18:53,571 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 11:18:53,572 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:18:53,572 INFO ]: Found error trace [2018-06-22 11:18:53,572 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:53,572 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:53,572 INFO ]: Analyzing trace with hash 1152238182, now seen corresponding path program 1 times [2018-06-22 11:18:53,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:53,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:53,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:53,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:53,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:53,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:53,670 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:18:53,670 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:18:53,670 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:18:53,670 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:18:53,670 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:18:53,670 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:18:53,671 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 4 states. [2018-06-22 11:18:53,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:53,819 INFO ]: Finished difference Result 21 states and 34 transitions. [2018-06-22 11:18:53,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:18:53,821 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:18:53,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:53,822 INFO ]: With dead ends: 21 [2018-06-22 11:18:53,822 INFO ]: Without dead ends: 21 [2018-06-22 11:18:53,822 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:18:53,823 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:18:53,829 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 11:18:53,830 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:18:53,830 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 11:18:53,830 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 13 [2018-06-22 11:18:53,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:53,830 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 11:18:53,830 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:18:53,831 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 11:18:53,831 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:18:53,831 INFO ]: Found error trace [2018-06-22 11:18:53,831 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:53,832 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:53,834 INFO ]: Analyzing trace with hash 1300014339, now seen corresponding path program 1 times [2018-06-22 11:18:53,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:53,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:53,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:53,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:53,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:53,853 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:54,068 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:18:54,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:18:54,068 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:18:54,069 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:18:54,069 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:18:54,069 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:18:54,069 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2018-06-22 11:18:54,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:54,210 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-22 11:18:54,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:18:54,212 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:18:54,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:54,212 INFO ]: With dead ends: 19 [2018-06-22 11:18:54,213 INFO ]: Without dead ends: 19 [2018-06-22 11:18:54,213 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:18:54,213 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:18:54,219 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:18:54,219 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:18:54,220 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-22 11:18:54,220 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 13 [2018-06-22 11:18:54,220 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:54,220 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-22 11:18:54,220 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:18:54,220 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-22 11:18:54,221 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:18:54,221 INFO ]: Found error trace [2018-06-22 11:18:54,221 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:54,221 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:54,222 INFO ]: Analyzing trace with hash -837330219, now seen corresponding path program 2 times [2018-06-22 11:18:54,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:54,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:54,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:54,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:54,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:54,236 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:54,340 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:18:54,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:54,340 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:18:54,352 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:18:54,386 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:18:54,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:54,389 INFO ]: Computing forward predicates... [2018-06-22 11:18:54,485 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:18:54,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:54,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:18:54,506 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:18:54,506 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:18:54,506 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:18:54,506 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 13 states. [2018-06-22 11:18:54,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:54,876 INFO ]: Finished difference Result 29 states and 49 transitions. [2018-06-22 11:18:54,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:18:54,877 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:18:54,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:54,878 INFO ]: With dead ends: 29 [2018-06-22 11:18:54,878 INFO ]: Without dead ends: 29 [2018-06-22 11:18:54,878 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:18:54,878 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:18:54,884 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-06-22 11:18:54,884 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:18:54,885 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-22 11:18:54,885 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 17 [2018-06-22 11:18:54,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:54,885 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-22 11:18:54,885 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:18:54,885 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-22 11:18:54,886 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:18:54,886 INFO ]: Found error trace [2018-06-22 11:18:54,886 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:54,886 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:54,886 INFO ]: Analyzing trace with hash -1645927347, now seen corresponding path program 1 times [2018-06-22 11:18:54,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:54,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:54,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:54,887 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:18:54,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:54,899 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:55,136 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:18:55,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:55,136 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:18:55,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:55,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:55,168 INFO ]: Computing forward predicates... [2018-06-22 11:18:55,227 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:18:55,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:55,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-06-22 11:18:55,247 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:18:55,247 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:18:55,247 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:18:55,248 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 10 states. [2018-06-22 11:18:55,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:55,411 INFO ]: Finished difference Result 31 states and 55 transitions. [2018-06-22 11:18:55,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:18:55,412 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:18:55,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:55,413 INFO ]: With dead ends: 31 [2018-06-22 11:18:55,413 INFO ]: Without dead ends: 31 [2018-06-22 11:18:55,413 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:18:55,413 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:18:55,421 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:18:55,422 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:18:55,423 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2018-06-22 11:18:55,423 INFO ]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 17 [2018-06-22 11:18:55,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:55,423 INFO ]: Abstraction has 25 states and 41 transitions. [2018-06-22 11:18:55,423 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:18:55,423 INFO ]: Start isEmpty. Operand 25 states and 41 transitions. [2018-06-22 11:18:55,424 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:18:55,424 INFO ]: Found error trace [2018-06-22 11:18:55,424 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:55,424 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:55,425 INFO ]: Analyzing trace with hash -538495081, now seen corresponding path program 2 times [2018-06-22 11:18:55,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:55,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:55,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:55,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:55,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:55,453 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:55,633 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:18:55,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:55,633 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:18:55,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:18:55,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:18:55,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:55,671 INFO ]: Computing forward predicates... [2018-06-22 11:18:55,790 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:18:55,809 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:55,809 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 11:18:55,809 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:18:55,809 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:18:55,809 INFO ]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:18:55,810 INFO ]: Start difference. First operand 25 states and 41 transitions. Second operand 16 states. [2018-06-22 11:18:56,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:56,247 INFO ]: Finished difference Result 51 states and 95 transitions. [2018-06-22 11:18:56,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:18:56,247 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 11:18:56,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:56,250 INFO ]: With dead ends: 51 [2018-06-22 11:18:56,250 INFO ]: Without dead ends: 51 [2018-06-22 11:18:56,250 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:18:56,250 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:18:56,263 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 27. [2018-06-22 11:18:56,263 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:18:56,264 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2018-06-22 11:18:56,264 INFO ]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 21 [2018-06-22 11:18:56,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:56,264 INFO ]: Abstraction has 27 states and 45 transitions. [2018-06-22 11:18:56,264 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:18:56,264 INFO ]: Start isEmpty. Operand 27 states and 45 transitions. [2018-06-22 11:18:56,265 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:18:56,265 INFO ]: Found error trace [2018-06-22 11:18:56,265 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:56,265 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:56,265 INFO ]: Analyzing trace with hash 1563414458, now seen corresponding path program 1 times [2018-06-22 11:18:56,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:56,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:56,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:56,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:18:56,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:56,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:56,347 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:18:56,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:56,347 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:18:56,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:56,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:56,372 INFO ]: Computing forward predicates... [2018-06-22 11:18:56,381 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:18:56,400 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:56,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:18:56,401 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:18:56,401 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:18:56,401 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:18:56,401 INFO ]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. [2018-06-22 11:18:56,474 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:56,474 INFO ]: Finished difference Result 48 states and 74 transitions. [2018-06-22 11:18:56,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:18:56,475 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:18:56,475 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:56,476 INFO ]: With dead ends: 48 [2018-06-22 11:18:56,476 INFO ]: Without dead ends: 36 [2018-06-22 11:18:56,476 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 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:18:56,476 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:18:56,483 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-22 11:18:56,483 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:18:56,484 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 54 transitions. [2018-06-22 11:18:56,484 INFO ]: Start accepts. Automaton has 32 states and 54 transitions. Word has length 21 [2018-06-22 11:18:56,484 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:56,484 INFO ]: Abstraction has 32 states and 54 transitions. [2018-06-22 11:18:56,484 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:18:56,484 INFO ]: Start isEmpty. Operand 32 states and 54 transitions. [2018-06-22 11:18:56,486 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:18:56,486 INFO ]: Found error trace [2018-06-22 11:18:56,486 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:56,486 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:56,486 INFO ]: Analyzing trace with hash -2057398377, now seen corresponding path program 3 times [2018-06-22 11:18:56,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:56,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:56,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:56,487 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:56,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:56,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:56,527 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:18:56,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:56,527 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:18:56,533 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:18:56,553 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:18:56,553 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:56,555 INFO ]: Computing forward predicates... [2018-06-22 11:18:56,562 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:18:56,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:56,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:18:56,582 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:18:56,582 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:18:56,582 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:18:56,582 INFO ]: Start difference. First operand 32 states and 54 transitions. Second operand 4 states. [2018-06-22 11:18:56,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:56,615 INFO ]: Finished difference Result 41 states and 57 transitions. [2018-06-22 11:18:56,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:18:56,616 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:18:56,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:56,617 INFO ]: With dead ends: 41 [2018-06-22 11:18:56,617 INFO ]: Without dead ends: 35 [2018-06-22 11:18:56,618 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 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:18:56,618 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:18:56,623 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-06-22 11:18:56,623 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:18:56,624 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-06-22 11:18:56,624 INFO ]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 21 [2018-06-22 11:18:56,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:56,624 INFO ]: Abstraction has 31 states and 42 transitions. [2018-06-22 11:18:56,624 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:18:56,624 INFO ]: Start isEmpty. Operand 31 states and 42 transitions. [2018-06-22 11:18:56,626 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:18:56,626 INFO ]: Found error trace [2018-06-22 11:18:56,626 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:56,626 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:56,626 INFO ]: Analyzing trace with hash -211254513, now seen corresponding path program 4 times [2018-06-22 11:18:56,626 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:56,626 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:56,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:56,627 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:18:56,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:56,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:56,975 INFO ]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:18:56,975 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:56,975 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:18:56,982 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:18:57,006 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:18:57,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:57,009 INFO ]: Computing forward predicates... [2018-06-22 11:18:57,197 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:18:57,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:57,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-06-22 11:18:57,217 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:18:57,217 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:18:57,217 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:18:57,217 INFO ]: Start difference. First operand 31 states and 42 transitions. Second operand 15 states. [2018-06-22 11:18:57,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:57,657 INFO ]: Finished difference Result 39 states and 51 transitions. [2018-06-22 11:18:57,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:18:57,657 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:18:57,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:57,658 INFO ]: With dead ends: 39 [2018-06-22 11:18:57,658 INFO ]: Without dead ends: 37 [2018-06-22 11:18:57,658 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:18:57,659 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:18:57,663 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-06-22 11:18:57,663 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:18:57,664 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-06-22 11:18:57,664 INFO ]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 21 [2018-06-22 11:18:57,664 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:57,664 INFO ]: Abstraction has 31 states and 41 transitions. [2018-06-22 11:18:57,664 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:18:57,664 INFO ]: Start isEmpty. Operand 31 states and 41 transitions. [2018-06-22 11:18:57,665 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:18:57,665 INFO ]: Found error trace [2018-06-22 11:18:57,665 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:18:57,665 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:57,665 INFO ]: Analyzing trace with hash 16084850, now seen corresponding path program 1 times [2018-06-22 11:18:57,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:57,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:57,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:57,666 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:18:57,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:57,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:57,708 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:18:57,708 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:18:57,708 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:18:57,708 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:18:57,708 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:18:57,708 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:18:57,709 INFO ]: Start difference. First operand 31 states and 41 transitions. Second operand 4 states. [2018-06-22 11:18:57,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:57,728 INFO ]: Finished difference Result 29 states and 37 transitions. [2018-06-22 11:18:57,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:18:57,728 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:18:57,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:57,729 INFO ]: With dead ends: 29 [2018-06-22 11:18:57,729 INFO ]: Without dead ends: 22 [2018-06-22 11:18:57,729 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:18:57,729 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:18:57,731 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:18:57,731 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:18:57,732 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-22 11:18:57,732 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 21 [2018-06-22 11:18:57,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:57,732 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-22 11:18:57,732 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:18:57,732 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-22 11:18:57,732 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:18:57,732 INFO ]: Found error trace [2018-06-22 11:18:57,732 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:57,733 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:57,733 INFO ]: Analyzing trace with hash 1499958361, now seen corresponding path program 5 times [2018-06-22 11:18:57,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:57,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:57,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:57,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:57,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:57,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:57,995 INFO ]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:18:57,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:57,995 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:18:58,013 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:18:58,066 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 11:18:58,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:58,069 INFO ]: Computing forward predicates... [2018-06-22 11:18:58,159 INFO ]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:18:58,178 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:58,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-06-22 11:18:58,178 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:18:58,179 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:18:58,179 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:18:58,179 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2018-06-22 11:18:58,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:58,309 INFO ]: Finished difference Result 32 states and 38 transitions. [2018-06-22 11:18:58,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:18:58,310 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:18:58,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:58,310 INFO ]: With dead ends: 32 [2018-06-22 11:18:58,310 INFO ]: Without dead ends: 32 [2018-06-22 11:18:58,310 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:18:58,311 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:18:58,313 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:18:58,313 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:18:58,314 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 11:18:58,314 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 25 [2018-06-22 11:18:58,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:58,314 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 11:18:58,314 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:18:58,314 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 11:18:58,315 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:18:58,315 INFO ]: Found error trace [2018-06-22 11:18:58,315 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:58,315 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:58,315 INFO ]: Analyzing trace with hash -1407837925, now seen corresponding path program 6 times [2018-06-22 11:18:58,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:58,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:58,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:58,316 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:18:58,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:58,327 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:58,436 INFO ]: Checked inductivity of 49 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:18:58,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:58,436 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:18:58,444 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:18:58,469 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:18:58,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:58,473 INFO ]: Computing forward predicates... [2018-06-22 11:18:58,606 INFO ]: Checked inductivity of 49 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:18:58,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:58,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-22 11:18:58,632 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:18:58,632 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:18:58,633 INFO ]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:18:58,633 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 18 states. [2018-06-22 11:18:58,792 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:18:58,792 INFO ]: Finished difference Result 32 states and 37 transitions. [2018-06-22 11:18:58,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:18:58,792 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:18:58,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:18:58,793 INFO ]: With dead ends: 32 [2018-06-22 11:18:58,793 INFO ]: Without dead ends: 26 [2018-06-22 11:18:58,793 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:18:58,793 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:18:58,795 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:18:58,795 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:18:58,796 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-22 11:18:58,796 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2018-06-22 11:18:58,796 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:18:58,796 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-22 11:18:58,796 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:18:58,796 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-22 11:18:58,797 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:18:58,797 INFO ]: Found error trace [2018-06-22 11:18:58,797 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:18:58,797 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:18:58,797 INFO ]: Analyzing trace with hash 1952360867, now seen corresponding path program 7 times [2018-06-22 11:18:58,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:18:58,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:18:58,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:58,799 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:18:58,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:18:58,820 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:58,999 INFO ]: Checked inductivity of 49 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:18:58,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:18:58,999 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:18:59,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:18:59,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:18:59,027 INFO ]: Computing forward predicates... [2018-06-22 11:18:59,579 INFO ]: Checked inductivity of 49 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:18:59,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:18:59,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:18:59,598 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:18:59,598 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:18:59,598 INFO ]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:18:59,598 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 21 states. [2018-06-22 11:19:00,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:00,052 INFO ]: Finished difference Result 46 states and 54 transitions. [2018-06-22 11:19:00,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:19:00,052 INFO ]: Start accepts. Automaton has 21 states. Word has length 29 [2018-06-22 11:19:00,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:00,053 INFO ]: With dead ends: 46 [2018-06-22 11:19:00,053 INFO ]: Without dead ends: 46 [2018-06-22 11:19:00,053 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:19:00,053 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:19:00,057 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 26. [2018-06-22 11:19:00,057 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:19:00,058 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-22 11:19:00,058 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 29 [2018-06-22 11:19:00,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:00,058 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-22 11:19:00,058 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:19:00,058 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-22 11:19:00,059 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:19:00,059 INFO ]: Found error trace [2018-06-22 11:19:00,059 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:00,059 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:00,059 INFO ]: Analyzing trace with hash -175690651, now seen corresponding path program 8 times [2018-06-22 11:19:00,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:00,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:00,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:00,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:00,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:00,071 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:00,996 INFO ]: Checked inductivity of 69 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:19:00,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:00,996 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:19:01,001 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:19:01,031 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:19:01,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:01,035 INFO ]: Computing forward predicates... [2018-06-22 11:19:01,236 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:19:01,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:01,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-06-22 11:19:01,256 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:19:01,256 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:19:01,256 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:19:01,256 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 17 states. [2018-06-22 11:19:01,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:01,410 INFO ]: Finished difference Result 38 states and 44 transitions. [2018-06-22 11:19:01,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:19:01,411 INFO ]: Start accepts. Automaton has 17 states. Word has length 33 [2018-06-22 11:19:01,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:01,411 INFO ]: With dead ends: 38 [2018-06-22 11:19:01,411 INFO ]: Without dead ends: 38 [2018-06-22 11:19:01,412 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:19:01,412 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:19:01,416 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-06-22 11:19:01,416 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:19:01,417 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-22 11:19:01,417 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 33 [2018-06-22 11:19:01,417 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:01,417 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-22 11:19:01,417 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:19:01,417 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-22 11:19:01,418 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:19:01,418 INFO ]: Found error trace [2018-06-22 11:19:01,418 INFO ]: trace histogram [8, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:01,418 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:01,418 INFO ]: Analyzing trace with hash 1473172399, now seen corresponding path program 9 times [2018-06-22 11:19:01,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:01,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:01,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:01,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:01,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:01,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:01,634 INFO ]: Checked inductivity of 93 backedges. 6 proven. 53 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:19:01,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:01,634 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:19:01,640 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:19:01,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:19:01,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:01,672 INFO ]: Computing forward predicates... [2018-06-22 11:19:01,875 INFO ]: Checked inductivity of 93 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:19:01,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:01,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-22 11:19:01,903 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:19:01,903 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:19:01,903 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:19:01,903 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 24 states. [2018-06-22 11:19:02,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:02,417 INFO ]: Finished difference Result 68 states and 78 transitions. [2018-06-22 11:19:02,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:19:02,418 INFO ]: Start accepts. Automaton has 24 states. Word has length 37 [2018-06-22 11:19:02,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:02,418 INFO ]: With dead ends: 68 [2018-06-22 11:19:02,418 INFO ]: Without dead ends: 68 [2018-06-22 11:19:02,419 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=404, Invalid=1488, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:19:02,419 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:19:02,424 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 28. [2018-06-22 11:19:02,424 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:19:02,424 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-06-22 11:19:02,424 INFO ]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 37 [2018-06-22 11:19:02,425 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:02,425 INFO ]: Abstraction has 28 states and 32 transitions. [2018-06-22 11:19:02,425 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:19:02,425 INFO ]: Start isEmpty. Operand 28 states and 32 transitions. [2018-06-22 11:19:02,426 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:19:02,426 INFO ]: Found error trace [2018-06-22 11:19:02,426 INFO ]: trace histogram [8, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:02,426 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:02,426 INFO ]: Analyzing trace with hash -496900313, now seen corresponding path program 10 times [2018-06-22 11:19:02,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:02,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:02,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:02,426 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:02,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:02,438 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:02,912 INFO ]: Checked inductivity of 93 backedges. 20 proven. 41 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:19:02,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:02,912 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:19:02,918 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:19:02,942 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:19:02,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:02,945 INFO ]: Computing forward predicates... [2018-06-22 11:19:03,238 INFO ]: Checked inductivity of 93 backedges. 8 proven. 53 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:19:03,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:03,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2018-06-22 11:19:03,257 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:19:03,257 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:19:03,257 INFO ]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:19:03,258 INFO ]: Start difference. First operand 28 states and 32 transitions. Second operand 24 states. [2018-06-22 11:19:03,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:03,631 INFO ]: Finished difference Result 40 states and 45 transitions. [2018-06-22 11:19:03,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:19:03,631 INFO ]: Start accepts. Automaton has 24 states. Word has length 37 [2018-06-22 11:19:03,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:03,632 INFO ]: With dead ends: 40 [2018-06-22 11:19:03,632 INFO ]: Without dead ends: 32 [2018-06-22 11:19:03,632 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:19:03,632 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:19:03,634 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:19:03,634 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:19:03,634 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-22 11:19:03,635 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 37 [2018-06-22 11:19:03,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:03,635 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-22 11:19:03,635 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:19:03,635 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-22 11:19:03,635 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:19:03,635 INFO ]: Found error trace [2018-06-22 11:19:03,635 INFO ]: trace histogram [9, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:03,635 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:03,636 INFO ]: Analyzing trace with hash 88114289, now seen corresponding path program 11 times [2018-06-22 11:19:03,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:03,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:03,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:03,636 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:03,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:03,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:03,890 INFO ]: Checked inductivity of 120 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:19:03,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:03,890 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:19:03,896 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:19:03,929 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 11:19:03,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:03,933 INFO ]: Computing forward predicates... [2018-06-22 11:19:04,148 INFO ]: Checked inductivity of 120 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-22 11:19:04,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:04,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2018-06-22 11:19:04,167 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:19:04,167 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:19:04,167 INFO ]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:19:04,168 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 20 states. [2018-06-22 11:19:04,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:04,392 INFO ]: Finished difference Result 44 states and 50 transitions. [2018-06-22 11:19:04,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:19:04,393 INFO ]: Start accepts. Automaton has 20 states. Word has length 41 [2018-06-22 11:19:04,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:04,393 INFO ]: With dead ends: 44 [2018-06-22 11:19:04,393 INFO ]: Without dead ends: 44 [2018-06-22 11:19:04,394 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:19:04,394 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:19:04,397 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-06-22 11:19:04,399 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:19:04,399 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-06-22 11:19:04,399 INFO ]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 41 [2018-06-22 11:19:04,400 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:04,400 INFO ]: Abstraction has 34 states and 39 transitions. [2018-06-22 11:19:04,400 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:19:04,400 INFO ]: Start isEmpty. Operand 34 states and 39 transitions. [2018-06-22 11:19:04,400 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:19:04,400 INFO ]: Found error trace [2018-06-22 11:19:04,400 INFO ]: trace histogram [10, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:04,400 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:04,400 INFO ]: Analyzing trace with hash 357840315, now seen corresponding path program 12 times [2018-06-22 11:19:04,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:04,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:04,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:04,401 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:04,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:04,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:04,853 INFO ]: Checked inductivity of 151 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:19:04,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:04,853 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:19:04,860 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:19:04,894 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:19:04,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:04,897 INFO ]: Computing forward predicates... [2018-06-22 11:19:05,175 INFO ]: Checked inductivity of 151 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:19:05,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:05,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-06-22 11:19:05,194 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:19:05,194 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:19:05,195 INFO ]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:19:05,195 INFO ]: Start difference. First operand 34 states and 39 transitions. Second operand 28 states. [2018-06-22 11:19:05,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:05,881 INFO ]: Finished difference Result 86 states and 97 transitions. [2018-06-22 11:19:05,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:19:05,882 INFO ]: Start accepts. Automaton has 28 states. Word has length 45 [2018-06-22 11:19:05,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:05,883 INFO ]: With dead ends: 86 [2018-06-22 11:19:05,883 INFO ]: Without dead ends: 86 [2018-06-22 11:19:05,884 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=665, Invalid=2415, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:19:05,884 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:19:05,889 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 32. [2018-06-22 11:19:05,889 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:19:05,889 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-22 11:19:05,889 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2018-06-22 11:19:05,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:05,890 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-22 11:19:05,890 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:19:05,890 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-22 11:19:05,890 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:19:05,890 INFO ]: Found error trace [2018-06-22 11:19:05,890 INFO ]: trace histogram [10, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:05,890 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:05,891 INFO ]: Analyzing trace with hash 2099801395, now seen corresponding path program 13 times [2018-06-22 11:19:05,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:05,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:05,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:05,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:05,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:05,905 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:06,192 INFO ]: Checked inductivity of 151 backedges. 30 proven. 67 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 11:19:06,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:06,193 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:19:06,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:06,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:06,237 INFO ]: Computing forward predicates... [2018-06-22 11:19:06,647 INFO ]: Checked inductivity of 151 backedges. 15 proven. 82 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-22 11:19:06,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:06,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 28 [2018-06-22 11:19:06,669 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:19:06,669 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:19:06,669 INFO ]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:19:06,669 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 28 states. [2018-06-22 11:19:07,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:07,195 INFO ]: Finished difference Result 46 states and 51 transitions. [2018-06-22 11:19:07,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:19:07,195 INFO ]: Start accepts. Automaton has 28 states. Word has length 45 [2018-06-22 11:19:07,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:07,196 INFO ]: With dead ends: 46 [2018-06-22 11:19:07,196 INFO ]: Without dead ends: 36 [2018-06-22 11:19:07,196 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:19:07,196 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:19:07,198 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 11:19:07,198 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:19:07,199 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-22 11:19:07,199 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 45 [2018-06-22 11:19:07,199 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:07,199 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-22 11:19:07,199 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:19:07,199 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-22 11:19:07,200 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:19:07,200 INFO ]: Found error trace [2018-06-22 11:19:07,200 INFO ]: trace histogram [11, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:07,200 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:07,200 INFO ]: Analyzing trace with hash 1603277949, now seen corresponding path program 14 times [2018-06-22 11:19:07,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:07,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:07,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:07,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:07,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:07,212 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:07,419 INFO ]: Checked inductivity of 185 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 11:19:07,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:07,419 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:19:07,424 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:19:07,456 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:19:07,456 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:07,459 INFO ]: Computing forward predicates... [2018-06-22 11:19:07,661 INFO ]: Checked inductivity of 185 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-22 11:19:07,681 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:07,681 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 23 [2018-06-22 11:19:07,681 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:19:07,681 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:19:07,681 INFO ]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:19:07,681 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 23 states. [2018-06-22 11:19:07,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:07,986 INFO ]: Finished difference Result 50 states and 56 transitions. [2018-06-22 11:19:07,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:19:07,986 INFO ]: Start accepts. Automaton has 23 states. Word has length 49 [2018-06-22 11:19:07,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:07,987 INFO ]: With dead ends: 50 [2018-06-22 11:19:07,987 INFO ]: Without dead ends: 50 [2018-06-22 11:19:07,987 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:19:07,987 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:19:07,990 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-06-22 11:19:07,990 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:19:07,990 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-06-22 11:19:07,990 INFO ]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 49 [2018-06-22 11:19:07,990 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:07,990 INFO ]: Abstraction has 38 states and 43 transitions. [2018-06-22 11:19:07,990 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:19:07,990 INFO ]: Start isEmpty. Operand 38 states and 43 transitions. [2018-06-22 11:19:07,992 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:19:07,992 INFO ]: Found error trace [2018-06-22 11:19:07,992 INFO ]: trace histogram [12, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:07,992 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:07,992 INFO ]: Analyzing trace with hash 1141592007, now seen corresponding path program 15 times [2018-06-22 11:19:07,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:07,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:07,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:07,993 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:07,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:08,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:08,199 INFO ]: Checked inductivity of 223 backedges. 20 proven. 117 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-22 11:19:08,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:08,199 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:19:08,205 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:19:08,247 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:19:08,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:08,251 INFO ]: Computing forward predicates... [2018-06-22 11:19:08,594 INFO ]: Checked inductivity of 223 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-06-22 11:19:08,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:08,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2018-06-22 11:19:08,613 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:19:08,613 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:19:08,614 INFO ]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:19:08,614 INFO ]: Start difference. First operand 38 states and 43 transitions. Second operand 32 states. [2018-06-22 11:19:09,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:09,697 INFO ]: Finished difference Result 106 states and 118 transitions. [2018-06-22 11:19:09,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 11:19:09,699 INFO ]: Start accepts. Automaton has 32 states. Word has length 53 [2018-06-22 11:19:09,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:09,700 INFO ]: With dead ends: 106 [2018-06-22 11:19:09,700 INFO ]: Without dead ends: 106 [2018-06-22 11:19:09,701 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1029, Invalid=3663, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:19:09,702 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 11:19:09,706 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 36. [2018-06-22 11:19:09,706 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:19:09,706 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 11:19:09,706 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 53 [2018-06-22 11:19:09,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:09,707 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 11:19:09,707 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:19:09,707 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 11:19:09,707 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:19:09,707 INFO ]: Found error trace [2018-06-22 11:19:09,707 INFO ]: trace histogram [12, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:09,707 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:09,707 INFO ]: Analyzing trace with hash -1488573633, now seen corresponding path program 16 times [2018-06-22 11:19:09,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:09,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:09,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:09,711 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:09,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:09,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:10,162 INFO ]: Checked inductivity of 223 backedges. 42 proven. 99 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 11:19:10,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:10,162 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:19:10,173 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:19:10,208 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:19:10,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:10,213 INFO ]: Computing forward predicates... [2018-06-22 11:19:11,400 INFO ]: Checked inductivity of 223 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 11:19:11,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:11,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 32 [2018-06-22 11:19:11,421 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:19:11,421 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:19:11,421 INFO ]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:19:11,421 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 32 states. [2018-06-22 11:19:11,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:11,986 INFO ]: Finished difference Result 52 states and 57 transitions. [2018-06-22 11:19:11,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:19:11,986 INFO ]: Start accepts. Automaton has 32 states. Word has length 53 [2018-06-22 11:19:11,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:11,986 INFO ]: With dead ends: 52 [2018-06-22 11:19:11,986 INFO ]: Without dead ends: 40 [2018-06-22 11:19:11,987 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:19:11,987 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:19:11,989 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-22 11:19:11,989 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:19:11,990 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-22 11:19:11,990 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 53 [2018-06-22 11:19:11,990 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:11,990 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-22 11:19:11,990 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:19:11,990 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-22 11:19:11,991 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:19:11,991 INFO ]: Found error trace [2018-06-22 11:19:11,991 INFO ]: trace histogram [13, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:11,992 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:11,992 INFO ]: Analyzing trace with hash -411935607, now seen corresponding path program 17 times [2018-06-22 11:19:11,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:11,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:11,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:11,993 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:11,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:12,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:12,243 INFO ]: Checked inductivity of 264 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-06-22 11:19:12,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:12,267 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:19:12,272 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:19:12,317 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-22 11:19:12,317 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:12,321 INFO ]: Computing forward predicates... [2018-06-22 11:19:12,588 INFO ]: Checked inductivity of 264 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-06-22 11:19:12,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:12,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 26 [2018-06-22 11:19:12,608 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:19:12,609 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:19:12,609 INFO ]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:19:12,609 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 26 states. [2018-06-22 11:19:12,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:12,881 INFO ]: Finished difference Result 56 states and 62 transitions. [2018-06-22 11:19:12,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:19:12,884 INFO ]: Start accepts. Automaton has 26 states. Word has length 57 [2018-06-22 11:19:12,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:12,885 INFO ]: With dead ends: 56 [2018-06-22 11:19:12,885 INFO ]: Without dead ends: 56 [2018-06-22 11:19:12,885 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:19:12,885 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:19:12,888 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-06-22 11:19:12,888 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:19:12,889 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-22 11:19:12,889 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 57 [2018-06-22 11:19:12,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:12,889 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-22 11:19:12,889 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:19:12,889 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-22 11:19:12,890 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:19:12,890 INFO ]: Found error trace [2018-06-22 11:19:12,890 INFO ]: trace histogram [14, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:12,890 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:12,890 INFO ]: Analyzing trace with hash 1326490067, now seen corresponding path program 18 times [2018-06-22 11:19:12,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:12,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:12,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:12,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:12,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:12,909 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:13,184 INFO ]: Checked inductivity of 309 backedges. 30 proven. 158 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:19:13,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:13,184 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:19:13,190 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:19:13,240 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-22 11:19:13,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:13,244 INFO ]: Computing forward predicates... [2018-06-22 11:19:14,107 INFO ]: Checked inductivity of 309 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-06-22 11:19:14,126 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:14,126 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2018-06-22 11:19:14,127 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:19:14,127 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:19:14,127 INFO ]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:19:14,127 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 36 states. [2018-06-22 11:19:15,193 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 11:19:15,537 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 11:19:16,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:16,369 INFO ]: Finished difference Result 128 states and 141 transitions. [2018-06-22 11:19:16,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 11:19:16,370 INFO ]: Start accepts. Automaton has 36 states. Word has length 61 [2018-06-22 11:19:16,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:16,370 INFO ]: With dead ends: 128 [2018-06-22 11:19:16,370 INFO ]: Without dead ends: 128 [2018-06-22 11:19:16,372 INFO ]: 0 DeclaredPredicates, 137 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1518, Invalid=5288, Unknown=0, NotChecked=0, Total=6806 [2018-06-22 11:19:16,372 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 11:19:16,381 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 40. [2018-06-22 11:19:16,381 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:19:16,382 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-22 11:19:16,382 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 61 [2018-06-22 11:19:16,382 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:16,382 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-22 11:19:16,382 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:19:16,382 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-22 11:19:16,383 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:19:16,383 INFO ]: Found error trace [2018-06-22 11:19:16,383 INFO ]: trace histogram [14, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:16,383 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:16,383 INFO ]: Analyzing trace with hash -1751670453, now seen corresponding path program 19 times [2018-06-22 11:19:16,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:16,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:16,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:16,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:16,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:16,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:16,615 INFO ]: Checked inductivity of 309 backedges. 56 proven. 137 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 11:19:16,615 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:16,615 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) [2018-06-22 11:19:16,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:19:16,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:16,683 INFO ]: Computing forward predicates... [2018-06-22 11:19:17,115 INFO ]: Checked inductivity of 309 backedges. 35 proven. 158 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-22 11:19:17,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:17,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-06-22 11:19:17,136 INFO ]: Interpolant automaton has 36 states [2018-06-22 11:19:17,136 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-22 11:19:17,136 INFO ]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:19:17,136 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 36 states. [2018-06-22 11:19:17,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:17,724 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-22 11:19:17,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:19:17,727 INFO ]: Start accepts. Automaton has 36 states. Word has length 61 [2018-06-22 11:19:17,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:17,727 INFO ]: With dead ends: 58 [2018-06-22 11:19:17,727 INFO ]: Without dead ends: 44 [2018-06-22 11:19:17,728 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=2204, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:19:17,728 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:19:17,731 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-06-22 11:19:17,731 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:19:17,731 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-06-22 11:19:17,731 INFO ]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 61 [2018-06-22 11:19:17,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:17,732 INFO ]: Abstraction has 42 states and 46 transitions. [2018-06-22 11:19:17,732 INFO ]: Interpolant automaton has 36 states. [2018-06-22 11:19:17,732 INFO ]: Start isEmpty. Operand 42 states and 46 transitions. [2018-06-22 11:19:17,732 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:19:17,732 INFO ]: Found error trace [2018-06-22 11:19:17,733 INFO ]: trace histogram [15, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:17,733 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:17,733 INFO ]: Analyzing trace with hash 1407442069, now seen corresponding path program 20 times [2018-06-22 11:19:17,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:17,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:17,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:17,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:17,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:17,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:17,957 INFO ]: Checked inductivity of 357 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 11:19:17,957 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:17,957 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:19:17,962 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:19:18,021 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:19:18,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:18,025 INFO ]: Computing forward predicates... [2018-06-22 11:19:18,386 INFO ]: Checked inductivity of 357 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-06-22 11:19:18,406 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:18,406 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 29 [2018-06-22 11:19:18,406 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:19:18,406 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:19:18,406 INFO ]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:19:18,407 INFO ]: Start difference. First operand 42 states and 46 transitions. Second operand 29 states. [2018-06-22 11:19:19,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:19,226 INFO ]: Finished difference Result 62 states and 68 transitions. [2018-06-22 11:19:19,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:19:19,227 INFO ]: Start accepts. Automaton has 29 states. Word has length 65 [2018-06-22 11:19:19,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:19,227 INFO ]: With dead ends: 62 [2018-06-22 11:19:19,227 INFO ]: Without dead ends: 62 [2018-06-22 11:19:19,228 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:19:19,228 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:19:19,231 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-06-22 11:19:19,231 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:19:19,231 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-06-22 11:19:19,231 INFO ]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 65 [2018-06-22 11:19:19,231 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:19,231 INFO ]: Abstraction has 46 states and 51 transitions. [2018-06-22 11:19:19,231 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:19:19,231 INFO ]: Start isEmpty. Operand 46 states and 51 transitions. [2018-06-22 11:19:19,232 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:19:19,232 INFO ]: Found error trace [2018-06-22 11:19:19,232 INFO ]: trace histogram [16, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:19,232 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:19,232 INFO ]: Analyzing trace with hash 1031842783, now seen corresponding path program 21 times [2018-06-22 11:19:19,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:19,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:19,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:19,233 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:19,233 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:19,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:19,503 INFO ]: Checked inductivity of 409 backedges. 42 proven. 205 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:19:19,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:19,503 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:19:19,509 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:19:19,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:19:19,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:19,683 INFO ]: Computing forward predicates... [2018-06-22 11:19:20,162 INFO ]: Checked inductivity of 409 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:19:20,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:20,181 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2018-06-22 11:19:20,181 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:19:20,181 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:19:20,182 INFO ]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:19:20,182 INFO ]: Start difference. First operand 46 states and 51 transitions. Second operand 40 states. [2018-06-22 11:19:21,784 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:21,784 INFO ]: Finished difference Result 152 states and 166 transitions. [2018-06-22 11:19:21,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-06-22 11:19:21,784 INFO ]: Start accepts. Automaton has 40 states. Word has length 69 [2018-06-22 11:19:21,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:21,785 INFO ]: With dead ends: 152 [2018-06-22 11:19:21,785 INFO ]: Without dead ends: 152 [2018-06-22 11:19:21,788 INFO ]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2156, Invalid=7350, Unknown=0, NotChecked=0, Total=9506 [2018-06-22 11:19:21,788 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 11:19:21,793 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 44. [2018-06-22 11:19:21,793 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:19:21,794 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-06-22 11:19:21,794 INFO ]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 69 [2018-06-22 11:19:21,794 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:21,794 INFO ]: Abstraction has 44 states and 48 transitions. [2018-06-22 11:19:21,794 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:19:21,794 INFO ]: Start isEmpty. Operand 44 states and 48 transitions. [2018-06-22 11:19:21,795 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:19:21,795 INFO ]: Found error trace [2018-06-22 11:19:21,795 INFO ]: trace histogram [16, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:21,795 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:21,795 INFO ]: Analyzing trace with hash 1492733783, now seen corresponding path program 22 times [2018-06-22 11:19:21,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:21,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:21,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:21,795 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:21,795 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:21,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:22,046 INFO ]: Checked inductivity of 409 backedges. 72 proven. 181 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-06-22 11:19:22,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:22,046 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:19:22,052 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:19:22,100 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:19:22,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:22,105 INFO ]: Computing forward predicates... [2018-06-22 11:19:22,626 INFO ]: Checked inductivity of 409 backedges. 48 proven. 205 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-06-22 11:19:22,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:22,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2018-06-22 11:19:22,665 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:19:22,665 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:19:22,665 INFO ]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:19:22,665 INFO ]: Start difference. First operand 44 states and 48 transitions. Second operand 40 states. [2018-06-22 11:19:23,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:23,409 INFO ]: Finished difference Result 64 states and 69 transitions. [2018-06-22 11:19:23,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:19:23,409 INFO ]: Start accepts. Automaton has 40 states. Word has length 69 [2018-06-22 11:19:23,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:23,409 INFO ]: With dead ends: 64 [2018-06-22 11:19:23,409 INFO ]: Without dead ends: 48 [2018-06-22 11:19:23,411 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=425, Invalid=2767, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:19:23,411 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:19:23,413 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 11:19:23,413 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:19:23,413 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-06-22 11:19:23,413 INFO ]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 69 [2018-06-22 11:19:23,413 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:23,413 INFO ]: Abstraction has 46 states and 50 transitions. [2018-06-22 11:19:23,413 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:19:23,414 INFO ]: Start isEmpty. Operand 46 states and 50 transitions. [2018-06-22 11:19:23,414 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:19:23,414 INFO ]: Found error trace [2018-06-22 11:19:23,414 INFO ]: trace histogram [17, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:23,414 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:23,414 INFO ]: Analyzing trace with hash -136244063, now seen corresponding path program 23 times [2018-06-22 11:19:23,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:23,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:23,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:23,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:23,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:23,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:23,906 INFO ]: Checked inductivity of 464 backedges. 0 proven. 263 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-06-22 11:19:23,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:23,906 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:19:23,912 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:19:23,970 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-06-22 11:19:23,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:23,975 INFO ]: Computing forward predicates... [2018-06-22 11:19:24,357 INFO ]: Checked inductivity of 464 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 11:19:24,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:24,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 32 [2018-06-22 11:19:24,377 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:19:24,377 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:19:24,377 INFO ]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:19:24,377 INFO ]: Start difference. First operand 46 states and 50 transitions. Second operand 32 states. [2018-06-22 11:19:24,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:24,768 INFO ]: Finished difference Result 68 states and 74 transitions. [2018-06-22 11:19:24,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:19:24,768 INFO ]: Start accepts. Automaton has 32 states. Word has length 73 [2018-06-22 11:19:24,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:24,769 INFO ]: With dead ends: 68 [2018-06-22 11:19:24,769 INFO ]: Without dead ends: 68 [2018-06-22 11:19:24,769 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 23 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=2080, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:19:24,770 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:19:24,772 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 50. [2018-06-22 11:19:24,772 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:19:24,773 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-06-22 11:19:24,773 INFO ]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 73 [2018-06-22 11:19:24,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:24,773 INFO ]: Abstraction has 50 states and 55 transitions. [2018-06-22 11:19:24,773 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:19:24,773 INFO ]: Start isEmpty. Operand 50 states and 55 transitions. [2018-06-22 11:19:24,774 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:19:24,774 INFO ]: Found error trace [2018-06-22 11:19:24,774 INFO ]: trace histogram [18, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:24,774 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:24,774 INFO ]: Analyzing trace with hash 2054680043, now seen corresponding path program 24 times [2018-06-22 11:19:24,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:24,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:24,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:24,775 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:24,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:24,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:25,186 INFO ]: Checked inductivity of 523 backedges. 56 proven. 258 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-06-22 11:19:25,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:25,186 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:19:25,192 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:19:25,257 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-06-22 11:19:25,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:25,261 INFO ]: Computing forward predicates... [2018-06-22 11:19:25,672 INFO ]: Checked inductivity of 523 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-06-22 11:19:25,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:25,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2018-06-22 11:19:25,691 INFO ]: Interpolant automaton has 44 states [2018-06-22 11:19:25,691 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 11:19:25,691 INFO ]: CoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:19:25,691 INFO ]: Start difference. First operand 50 states and 55 transitions. Second operand 44 states. [2018-06-22 11:19:27,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:27,767 INFO ]: Finished difference Result 178 states and 193 transitions. [2018-06-22 11:19:27,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-06-22 11:19:27,768 INFO ]: Start accepts. Automaton has 44 states. Word has length 77 [2018-06-22 11:19:27,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:27,769 INFO ]: With dead ends: 178 [2018-06-22 11:19:27,769 INFO ]: Without dead ends: 178 [2018-06-22 11:19:27,770 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2969, Invalid=9913, Unknown=0, NotChecked=0, Total=12882 [2018-06-22 11:19:27,771 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 11:19:27,777 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 48. [2018-06-22 11:19:27,777 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:19:27,777 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-22 11:19:27,777 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 77 [2018-06-22 11:19:27,778 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:27,778 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-22 11:19:27,778 INFO ]: Interpolant automaton has 44 states. [2018-06-22 11:19:27,778 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-22 11:19:27,778 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:19:27,778 INFO ]: Found error trace [2018-06-22 11:19:27,778 INFO ]: trace histogram [18, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:27,779 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:27,779 INFO ]: Analyzing trace with hash -1840794269, now seen corresponding path program 25 times [2018-06-22 11:19:27,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:27,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:27,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:27,779 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:27,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:27,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:28,229 INFO ]: Checked inductivity of 523 backedges. 90 proven. 231 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-06-22 11:19:28,229 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:28,229 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:19:28,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:28,285 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:28,290 INFO ]: Computing forward predicates... [2018-06-22 11:19:28,970 INFO ]: Checked inductivity of 523 backedges. 63 proven. 258 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-06-22 11:19:28,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:28,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2018-06-22 11:19:28,989 INFO ]: Interpolant automaton has 44 states [2018-06-22 11:19:28,989 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-22 11:19:28,989 INFO ]: CoverageRelationStatistics Valid=181, Invalid=1711, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:19:28,989 INFO ]: Start difference. First operand 48 states and 52 transitions. Second operand 44 states. [2018-06-22 11:19:29,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:29,873 INFO ]: Finished difference Result 70 states and 75 transitions. [2018-06-22 11:19:29,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:19:29,873 INFO ]: Start accepts. Automaton has 44 states. Word has length 77 [2018-06-22 11:19:29,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:29,874 INFO ]: With dead ends: 70 [2018-06-22 11:19:29,874 INFO ]: Without dead ends: 52 [2018-06-22 11:19:29,874 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=512, Invalid=3394, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 11:19:29,875 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:19:29,876 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:19:29,876 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:19:29,877 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-06-22 11:19:29,877 INFO ]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 77 [2018-06-22 11:19:29,877 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:29,877 INFO ]: Abstraction has 50 states and 54 transitions. [2018-06-22 11:19:29,877 INFO ]: Interpolant automaton has 44 states. [2018-06-22 11:19:29,877 INFO ]: Start isEmpty. Operand 50 states and 54 transitions. [2018-06-22 11:19:29,880 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:19:29,880 INFO ]: Found error trace [2018-06-22 11:19:29,880 INFO ]: trace histogram [19, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:29,880 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:29,880 INFO ]: Analyzing trace with hash -1972992851, now seen corresponding path program 26 times [2018-06-22 11:19:29,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:29,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:29,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:29,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:29,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:29,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:30,505 INFO ]: Checked inductivity of 585 backedges. 0 proven. 332 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-06-22 11:19:30,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:30,505 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:19:30,510 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:19:30,563 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:19:30,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:30,569 INFO ]: Computing forward predicates... [2018-06-22 11:19:31,010 INFO ]: Checked inductivity of 585 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-06-22 11:19:31,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:31,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 35 [2018-06-22 11:19:31,030 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:19:31,030 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:19:31,031 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:19:31,031 INFO ]: Start difference. First operand 50 states and 54 transitions. Second operand 35 states. [2018-06-22 11:19:31,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:31,447 INFO ]: Finished difference Result 74 states and 80 transitions. [2018-06-22 11:19:31,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:19:31,447 INFO ]: Start accepts. Automaton has 35 states. Word has length 81 [2018-06-22 11:19:31,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:31,448 INFO ]: With dead ends: 74 [2018-06-22 11:19:31,448 INFO ]: Without dead ends: 74 [2018-06-22 11:19:31,448 INFO ]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 26 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=2560, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 11:19:31,448 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:19:31,451 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 54. [2018-06-22 11:19:31,451 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:19:31,452 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-06-22 11:19:31,452 INFO ]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 81 [2018-06-22 11:19:31,452 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:31,452 INFO ]: Abstraction has 54 states and 59 transitions. [2018-06-22 11:19:31,452 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:19:31,453 INFO ]: Start isEmpty. Operand 54 states and 59 transitions. [2018-06-22 11:19:31,453 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:19:31,453 INFO ]: Found error trace [2018-06-22 11:19:31,453 INFO ]: trace histogram [20, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:31,453 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:31,454 INFO ]: Analyzing trace with hash -1659705353, now seen corresponding path program 27 times [2018-06-22 11:19:31,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:31,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:31,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:31,454 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:31,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:31,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:31,818 INFO ]: Checked inductivity of 651 backedges. 72 proven. 317 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-22 11:19:31,818 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:31,818 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:19:31,825 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:19:31,890 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 11:19:31,890 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:31,895 INFO ]: Computing forward predicates... [2018-06-22 11:19:32,423 INFO ]: Checked inductivity of 651 backedges. 0 proven. 389 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-06-22 11:19:32,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:32,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2018-06-22 11:19:32,443 INFO ]: Interpolant automaton has 48 states [2018-06-22 11:19:32,443 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 11:19:32,443 INFO ]: CoverageRelationStatistics Valid=324, Invalid=1932, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:19:32,443 INFO ]: Start difference. First operand 54 states and 59 transitions. Second operand 48 states. [2018-06-22 11:19:34,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:34,757 INFO ]: Finished difference Result 206 states and 222 transitions. [2018-06-22 11:19:34,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-06-22 11:19:34,760 INFO ]: Start accepts. Automaton has 48 states. Word has length 85 [2018-06-22 11:19:34,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:34,762 INFO ]: With dead ends: 206 [2018-06-22 11:19:34,762 INFO ]: Without dead ends: 206 [2018-06-22 11:19:34,765 INFO ]: 0 DeclaredPredicates, 209 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5383 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3985, Invalid=13045, Unknown=0, NotChecked=0, Total=17030 [2018-06-22 11:19:34,765 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-22 11:19:34,771 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 52. [2018-06-22 11:19:34,771 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:19:34,771 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-06-22 11:19:34,771 INFO ]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 85 [2018-06-22 11:19:34,771 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:34,773 INFO ]: Abstraction has 52 states and 56 transitions. [2018-06-22 11:19:34,773 INFO ]: Interpolant automaton has 48 states. [2018-06-22 11:19:34,773 INFO ]: Start isEmpty. Operand 52 states and 56 transitions. [2018-06-22 11:19:34,774 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:19:34,774 INFO ]: Found error trace [2018-06-22 11:19:34,774 INFO ]: trace histogram [20, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:34,774 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:34,774 INFO ]: Analyzing trace with hash 1314870127, now seen corresponding path program 28 times [2018-06-22 11:19:34,774 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:34,774 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:34,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:34,774 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:34,775 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:34,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:35,346 INFO ]: Checked inductivity of 651 backedges. 110 proven. 287 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-06-22 11:19:35,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:35,346 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:19:35,351 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:19:35,408 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:19:35,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:35,415 INFO ]: Computing forward predicates... [2018-06-22 11:19:37,048 INFO ]: Checked inductivity of 651 backedges. 80 proven. 317 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-06-22 11:19:37,067 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:37,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 48 [2018-06-22 11:19:37,067 INFO ]: Interpolant automaton has 48 states [2018-06-22 11:19:37,068 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-22 11:19:37,068 INFO ]: CoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:19:37,068 INFO ]: Start difference. First operand 52 states and 56 transitions. Second operand 48 states. [2018-06-22 11:19:37,908 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:37,908 INFO ]: Finished difference Result 76 states and 81 transitions. [2018-06-22 11:19:37,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:19:37,909 INFO ]: Start accepts. Automaton has 48 states. Word has length 85 [2018-06-22 11:19:37,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:37,909 INFO ]: With dead ends: 76 [2018-06-22 11:19:37,909 INFO ]: Without dead ends: 56 [2018-06-22 11:19:37,910 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=607, Invalid=4085, Unknown=0, NotChecked=0, Total=4692 [2018-06-22 11:19:37,910 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:19:37,912 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-06-22 11:19:37,912 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:19:37,912 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-06-22 11:19:37,913 INFO ]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 85 [2018-06-22 11:19:37,913 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:37,913 INFO ]: Abstraction has 54 states and 58 transitions. [2018-06-22 11:19:37,913 INFO ]: Interpolant automaton has 48 states. [2018-06-22 11:19:37,913 INFO ]: Start isEmpty. Operand 54 states and 58 transitions. [2018-06-22 11:19:37,913 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:19:37,913 INFO ]: Found error trace [2018-06-22 11:19:37,913 INFO ]: trace histogram [21, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:37,913 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:37,914 INFO ]: Analyzing trace with hash -294605639, now seen corresponding path program 29 times [2018-06-22 11:19:37,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:37,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:37,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:37,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:37,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:37,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:38,293 INFO ]: Checked inductivity of 720 backedges. 0 proven. 409 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-06-22 11:19:38,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:38,293 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:19:38,298 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:19:38,367 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-06-22 11:19:38,367 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:38,373 INFO ]: Computing forward predicates... [2018-06-22 11:19:38,930 INFO ]: Checked inductivity of 720 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-06-22 11:19:38,949 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:38,949 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 38 [2018-06-22 11:19:38,949 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:19:38,950 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:19:38,950 INFO ]: CoverageRelationStatistics Valid=96, Invalid=1310, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:19:38,950 INFO ]: Start difference. First operand 54 states and 58 transitions. Second operand 38 states. [2018-06-22 11:19:39,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:39,534 INFO ]: Finished difference Result 80 states and 86 transitions. [2018-06-22 11:19:39,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:19:39,535 INFO ]: Start accepts. Automaton has 38 states. Word has length 89 [2018-06-22 11:19:39,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:39,535 INFO ]: With dead ends: 80 [2018-06-22 11:19:39,535 INFO ]: Without dead ends: 80 [2018-06-22 11:19:39,536 INFO ]: 0 DeclaredPredicates, 152 GetRequests, 67 SyntacticMatches, 29 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=3090, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:19:39,536 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 11:19:39,540 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 58. [2018-06-22 11:19:39,540 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:19:39,540 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-06-22 11:19:39,540 INFO ]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 89 [2018-06-22 11:19:39,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:39,541 INFO ]: Abstraction has 58 states and 63 transitions. [2018-06-22 11:19:39,541 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:19:39,541 INFO ]: Start isEmpty. Operand 58 states and 63 transitions. [2018-06-22 11:19:39,541 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:19:39,541 INFO ]: Found error trace [2018-06-22 11:19:39,541 INFO ]: trace histogram [22, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:39,541 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:39,541 INFO ]: Analyzing trace with hash 812521987, now seen corresponding path program 30 times [2018-06-22 11:19:39,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:39,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:39,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:39,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:39,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:39,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:40,804 INFO ]: Checked inductivity of 793 backedges. 90 proven. 382 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-06-22 11:19:40,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:40,804 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:19:40,810 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:19:40,896 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-06-22 11:19:40,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:40,901 INFO ]: Computing forward predicates... [2018-06-22 11:19:41,471 INFO ]: Checked inductivity of 793 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-06-22 11:19:41,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:41,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 52 [2018-06-22 11:19:41,492 INFO ]: Interpolant automaton has 52 states [2018-06-22 11:19:41,492 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 11:19:41,492 INFO ]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:19:41,492 INFO ]: Start difference. First operand 58 states and 63 transitions. Second operand 52 states. [2018-06-22 11:19:44,411 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:44,411 INFO ]: Finished difference Result 236 states and 253 transitions. [2018-06-22 11:19:44,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-06-22 11:19:44,411 INFO ]: Start accepts. Automaton has 52 states. Word has length 93 [2018-06-22 11:19:44,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:44,413 INFO ]: With dead ends: 236 [2018-06-22 11:19:44,413 INFO ]: Without dead ends: 236 [2018-06-22 11:19:44,414 INFO ]: 0 DeclaredPredicates, 235 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7186 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5234, Invalid=16818, Unknown=0, NotChecked=0, Total=22052 [2018-06-22 11:19:44,414 INFO ]: Start minimizeSevpa. Operand 236 states. [2018-06-22 11:19:44,421 INFO ]: Finished minimizeSevpa. Reduced states from 236 to 56. [2018-06-22 11:19:44,421 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:19:44,422 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-06-22 11:19:44,422 INFO ]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 93 [2018-06-22 11:19:44,422 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:44,422 INFO ]: Abstraction has 56 states and 60 transitions. [2018-06-22 11:19:44,422 INFO ]: Interpolant automaton has 52 states. [2018-06-22 11:19:44,422 INFO ]: Start isEmpty. Operand 56 states and 60 transitions. [2018-06-22 11:19:44,423 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:19:44,423 INFO ]: Found error trace [2018-06-22 11:19:44,423 INFO ]: trace histogram [22, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:44,423 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:44,423 INFO ]: Analyzing trace with hash -1004754565, now seen corresponding path program 31 times [2018-06-22 11:19:44,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:44,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:44,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:44,424 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:44,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:44,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:46,186 INFO ]: Checked inductivity of 793 backedges. 132 proven. 349 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-06-22 11:19:46,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:46,186 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:19:46,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:46,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:46,260 INFO ]: Computing forward predicates... [2018-06-22 11:19:46,990 INFO ]: Checked inductivity of 793 backedges. 99 proven. 382 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-06-22 11:19:47,012 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:47,012 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 52 [2018-06-22 11:19:47,012 INFO ]: Interpolant automaton has 52 states [2018-06-22 11:19:47,012 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-22 11:19:47,012 INFO ]: CoverageRelationStatistics Valid=250, Invalid=2402, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 11:19:47,013 INFO ]: Start difference. First operand 56 states and 60 transitions. Second operand 52 states. [2018-06-22 11:19:47,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:47,985 INFO ]: Finished difference Result 82 states and 87 transitions. [2018-06-22 11:19:47,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:19:47,985 INFO ]: Start accepts. Automaton has 52 states. Word has length 93 [2018-06-22 11:19:47,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:47,985 INFO ]: With dead ends: 82 [2018-06-22 11:19:47,986 INFO ]: Without dead ends: 60 [2018-06-22 11:19:47,986 INFO ]: 0 DeclaredPredicates, 159 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=710, Invalid=4840, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 11:19:47,986 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:19:47,987 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-06-22 11:19:47,987 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:19:47,988 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-06-22 11:19:47,988 INFO ]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 93 [2018-06-22 11:19:47,988 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:47,988 INFO ]: Abstraction has 58 states and 62 transitions. [2018-06-22 11:19:47,988 INFO ]: Interpolant automaton has 52 states. [2018-06-22 11:19:47,988 INFO ]: Start isEmpty. Operand 58 states and 62 transitions. [2018-06-22 11:19:47,988 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:19:47,988 INFO ]: Found error trace [2018-06-22 11:19:47,988 INFO ]: trace histogram [23, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:47,988 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:47,988 INFO ]: Analyzing trace with hash -84144955, now seen corresponding path program 32 times [2018-06-22 11:19:47,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:47,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:47,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:47,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:19:47,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:48,005 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:48,408 INFO ]: Checked inductivity of 869 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-06-22 11:19:48,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:19:48,408 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:19:48,413 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:19:48,487 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:19:48,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:19:48,493 INFO ]: Computing forward predicates... [2018-06-22 11:19:49,053 INFO ]: Checked inductivity of 869 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-06-22 11:19:49,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:19:49,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 41 [2018-06-22 11:19:49,073 INFO ]: Interpolant automaton has 41 states [2018-06-22 11:19:49,073 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 11:19:49,073 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1536, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:19:49,073 INFO ]: Start difference. First operand 58 states and 62 transitions. Second operand 41 states. [2018-06-22 11:19:49,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:19:49,983 INFO ]: Finished difference Result 86 states and 92 transitions. [2018-06-22 11:19:49,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 11:19:49,983 INFO ]: Start accepts. Automaton has 41 states. Word has length 97 [2018-06-22 11:19:49,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:19:49,984 INFO ]: With dead ends: 86 [2018-06-22 11:19:49,984 INFO ]: Without dead ends: 86 [2018-06-22 11:19:49,984 INFO ]: 0 DeclaredPredicates, 166 GetRequests, 73 SyntacticMatches, 32 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=3670, Unknown=0, NotChecked=0, Total=3906 [2018-06-22 11:19:49,984 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:19:49,987 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 62. [2018-06-22 11:19:49,987 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:19:49,987 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-06-22 11:19:49,987 INFO ]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 97 [2018-06-22 11:19:49,987 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:19:49,988 INFO ]: Abstraction has 62 states and 67 transitions. [2018-06-22 11:19:49,988 INFO ]: Interpolant automaton has 41 states. [2018-06-22 11:19:49,988 INFO ]: Start isEmpty. Operand 62 states and 67 transitions. [2018-06-22 11:19:49,988 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:19:49,988 INFO ]: Found error trace [2018-06-22 11:19:49,988 INFO ]: trace histogram [24, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:19:49,988 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:19:49,988 INFO ]: Analyzing trace with hash 509360007, now seen corresponding path program 33 times [2018-06-22 11:19:49,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:19:49,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:19:49,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:49,989 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:19:49,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:19:50,008 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:19:50,456 WARN ]: Verification canceled [2018-06-22 11:19:50,460 WARN ]: Timeout [2018-06-22 11:19:50,460 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:19:50 BoogieIcfgContainer [2018-06-22 11:19:50,460 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:19:50,461 INFO ]: Toolchain (without parser) took 58933.73 ms. Allocated memory was 304.6 MB in the beginning and 854.6 MB in the end (delta: 550.0 MB). Free memory was 261.0 MB in the beginning and 298.4 MB in the end (delta: -37.4 MB). Peak memory consumption was 512.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:19:50,462 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:19:50,462 INFO ]: ChcToBoogie took 42.45 ms. Allocated memory is still 304.6 MB. Free memory was 261.0 MB in the beginning and 259.0 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:19:50,462 INFO ]: Boogie Preprocessor took 35.06 ms. Allocated memory is still 304.6 MB. Free memory was 259.0 MB in the beginning and 257.0 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:19:50,464 INFO ]: RCFGBuilder took 257.68 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 249.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:19:50,464 INFO ]: TraceAbstraction took 58588.97 ms. Allocated memory was 304.6 MB in the beginning and 854.6 MB in the end (delta: 550.0 MB). Free memory was 249.0 MB in the beginning and 298.4 MB in the end (delta: -49.4 MB). Peak memory consumption was 500.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:19:50,466 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 42.45 ms. Allocated memory is still 304.6 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.06 ms. Allocated memory is still 304.6 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 257.68 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 249.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58588.97 ms. Allocated memory was 304.6 MB in the beginning and 854.6 MB in the end (delta: 550.0 MB). Free memory was 249.0 MB in the beginning and 298.4 MB in the end (delta: -49.4 MB). Peak memory consumption was 500.6 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 102 with TraceHistMax 24, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 15 locations, 1 error locations. TIMEOUT Result, 58.5s OverallTime, 40 OverallIterations, 24 TraceHistogramMax, 26.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 831 SDtfs, 967 SDslu, 9044 SDs, 0 SdLazy, 10978 SolverSat, 1693 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3439 GetRequests, 1560 SyntacticMatches, 199 SemanticMatches, 1680 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33020 ImplicationChecksByTransitivity, 41.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=39, 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.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 1076 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 3734 NumberOfCodeBlocks, 3686 NumberOfCodeBlocksAsserted, 237 NumberOfCheckSat, 3660 ConstructedInterpolants, 18 QuantifiedInterpolants, 1545844 SizeOfPredicates, 677 NumberOfNonLiveVariables, 13037 ConjunctsInSsa, 2413 ConjunctsInUnsatCore, 74 InterpolantComputations, 4 PerfectInterpolantSequences, 9512/20354 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/020b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-19-50-477.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/020b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-19-50-477.csv Completed graceful shutdown