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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:06:22,340 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:06:22,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:06:22,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:06:22,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:06:22,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:06:22,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:06:22,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:06:22,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:06:22,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:06:22,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:06:22,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:06:22,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:06:22,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:06:22,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:06:22,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:06:22,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:06:22,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:06:22,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:06:22,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:06:22,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:06:22,393 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:06:22,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:06:22,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:06:22,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:06:22,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:06:22,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:06:22,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:06:22,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:06:22,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:06:22,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:06:22,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:06:22,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:06:22,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:06:22,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:06:22,406 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:06:22,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:06:22,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:06:22,429 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:06:22,430 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:06:22,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:06:22,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:06:22,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:06:22,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:06:22,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:06:22,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:06:22,432 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:06:22,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:06:22,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:06:22,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:06:22,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:06:22,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:06:22,433 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:06:22,434 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:06:22,436 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:06:22,489 INFO ]: Repository-Root is: /tmp [2018-06-22 01:06:22,504 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:06:22,508 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:06:22,510 INFO ]: Initializing SmtParser... [2018-06-22 01:06:22,510 INFO ]: SmtParser initialized [2018-06-22 01:06:22,511 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-22 01:06:22,512 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 01:06:22,592 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 unknown [2018-06-22 01:06:23,010 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-22 01:06:23,015 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:06:23,020 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:06:23,021 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:06:23,021 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:06:23,021 INFO ]: ChcToBoogie initialized [2018-06-22 01:06:23,026 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,177 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23 Unit [2018-06-22 01:06:23,177 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:06:23,178 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:06:23,178 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:06:23,178 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:06:23,202 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,202 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,214 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,214 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,222 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,224 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,226 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... [2018-06-22 01:06:23,230 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:06:23,231 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:06:23,231 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:06:23,231 INFO ]: RCFGBuilder initialized [2018-06-22 01:06:23,232 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:06:23,246 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:06:23,246 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:06:23,246 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:06:23,246 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:06:23,246 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:06:23,246 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:06:24,378 INFO ]: Using library mode [2018-06-22 01:06:24,379 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:06:24 BoogieIcfgContainer [2018-06-22 01:06:24,379 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:06:24,381 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:06:24,381 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:06:24,386 INFO ]: TraceAbstraction initialized [2018-06-22 01:06:24,387 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:06:23" (1/3) ... [2018-06-22 01:06:24,387 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f82296f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:06:24, skipping insertion in model container [2018-06-22 01:06:24,388 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:06:23" (2/3) ... [2018-06-22 01:06:24,388 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f82296f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:06:24, skipping insertion in model container [2018-06-22 01:06:24,388 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:06:24" (3/3) ... [2018-06-22 01:06:24,390 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:06:24,401 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:06:24,410 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:06:24,467 INFO ]: Using default assertion order modulation [2018-06-22 01:06:24,468 INFO ]: Interprodecural is true [2018-06-22 01:06:24,468 INFO ]: Hoare is false [2018-06-22 01:06:24,468 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:06:24,468 INFO ]: Backedges is TWOTRACK [2018-06-22 01:06:24,468 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:06:24,468 INFO ]: Difference is false [2018-06-22 01:06:24,468 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:06:24,468 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:06:24,496 INFO ]: Start isEmpty. Operand 48 states. [2018-06-22 01:06:24,510 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:06:24,510 INFO ]: Found error trace [2018-06-22 01:06:24,512 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:24,512 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:24,517 INFO ]: Analyzing trace with hash 1429556944, now seen corresponding path program 1 times [2018-06-22 01:06:24,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:24,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:24,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:24,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:24,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:24,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:25,370 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:25,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:25,373 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 01:06:25,375 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:06:25,388 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:06:25,389 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:06:25,391 INFO ]: Start difference. First operand 48 states. Second operand 14 states. [2018-06-22 01:06:26,336 WARN ]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:06:26,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:26,471 INFO ]: Finished difference Result 118 states and 143 transitions. [2018-06-22 01:06:26,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:06:26,473 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-22 01:06:26,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:26,486 INFO ]: With dead ends: 118 [2018-06-22 01:06:26,486 INFO ]: Without dead ends: 117 [2018-06-22 01:06:26,488 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:06:26,503 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 01:06:26,526 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 57. [2018-06-22 01:06:26,528 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:06:26,529 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2018-06-22 01:06:26,530 INFO ]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 24 [2018-06-22 01:06:26,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:26,531 INFO ]: Abstraction has 57 states and 70 transitions. [2018-06-22 01:06:26,531 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:06:26,531 INFO ]: Start isEmpty. Operand 57 states and 70 transitions. [2018-06-22 01:06:26,532 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:06:26,532 INFO ]: Found error trace [2018-06-22 01:06:26,532 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:26,532 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:26,532 INFO ]: Analyzing trace with hash -1757198507, now seen corresponding path program 1 times [2018-06-22 01:06:26,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:26,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:26,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:26,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:26,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:26,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:26,798 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:26,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:26,800 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 01:06:26,802 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:06:26,802 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:06:26,802 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:06:26,803 INFO ]: Start difference. First operand 57 states and 70 transitions. Second operand 14 states. [2018-06-22 01:06:27,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:27,327 INFO ]: Finished difference Result 112 states and 136 transitions. [2018-06-22 01:06:27,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:06:27,327 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-22 01:06:27,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:27,329 INFO ]: With dead ends: 112 [2018-06-22 01:06:27,329 INFO ]: Without dead ends: 110 [2018-06-22 01:06:27,330 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:06:27,330 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 01:06:27,336 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 56. [2018-06-22 01:06:27,337 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:06:27,385 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-06-22 01:06:27,385 INFO ]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 24 [2018-06-22 01:06:27,385 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:27,385 INFO ]: Abstraction has 56 states and 68 transitions. [2018-06-22 01:06:27,385 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:06:27,385 INFO ]: Start isEmpty. Operand 56 states and 68 transitions. [2018-06-22 01:06:27,386 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:06:27,386 INFO ]: Found error trace [2018-06-22 01:06:27,386 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:27,386 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:27,387 INFO ]: Analyzing trace with hash 168951792, now seen corresponding path program 1 times [2018-06-22 01:06:27,387 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:27,387 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:27,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:27,387 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:27,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:27,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:27,811 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:27,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:27,811 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:27,812 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:27,812 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:27,812 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:27,812 INFO ]: Start difference. First operand 56 states and 68 transitions. Second operand 15 states. [2018-06-22 01:06:28,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:28,309 INFO ]: Finished difference Result 104 states and 127 transitions. [2018-06-22 01:06:28,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:06:28,310 INFO ]: Start accepts. Automaton has 15 states. Word has length 24 [2018-06-22 01:06:28,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:28,311 INFO ]: With dead ends: 104 [2018-06-22 01:06:28,311 INFO ]: Without dead ends: 101 [2018-06-22 01:06:28,312 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:06:28,312 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 01:06:28,317 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 54. [2018-06-22 01:06:28,317 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:06:28,318 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-06-22 01:06:28,318 INFO ]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 24 [2018-06-22 01:06:28,318 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:28,318 INFO ]: Abstraction has 54 states and 65 transitions. [2018-06-22 01:06:28,318 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:28,318 INFO ]: Start isEmpty. Operand 54 states and 65 transitions. [2018-06-22 01:06:28,319 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:06:28,319 INFO ]: Found error trace [2018-06-22 01:06:28,319 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:28,319 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:28,319 INFO ]: Analyzing trace with hash 2058913688, now seen corresponding path program 1 times [2018-06-22 01:06:28,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:28,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:28,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:28,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:28,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:28,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:28,452 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:28,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:28,452 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 01:06:28,452 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:06:28,452 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:06:28,452 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:06:28,453 INFO ]: Start difference. First operand 54 states and 65 transitions. Second operand 14 states. [2018-06-22 01:06:29,125 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 01:06:29,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:29,361 INFO ]: Finished difference Result 126 states and 152 transitions. [2018-06-22 01:06:29,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:06:29,362 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 01:06:29,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:29,363 INFO ]: With dead ends: 126 [2018-06-22 01:06:29,363 INFO ]: Without dead ends: 125 [2018-06-22 01:06:29,363 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:06:29,364 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 01:06:29,370 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 65. [2018-06-22 01:06:29,370 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:06:29,371 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2018-06-22 01:06:29,371 INFO ]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 25 [2018-06-22 01:06:29,376 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:29,376 INFO ]: Abstraction has 65 states and 79 transitions. [2018-06-22 01:06:29,376 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:06:29,376 INFO ]: Start isEmpty. Operand 65 states and 79 transitions. [2018-06-22 01:06:29,377 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:06:29,377 INFO ]: Found error trace [2018-06-22 01:06:29,377 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:29,377 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:29,377 INFO ]: Analyzing trace with hash -1127841763, now seen corresponding path program 1 times [2018-06-22 01:06:29,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:29,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:29,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:29,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:29,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:29,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:29,732 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:29,732 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:29,732 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 01:06:29,732 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:06:29,732 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:06:29,732 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:06:29,733 INFO ]: Start difference. First operand 65 states and 79 transitions. Second operand 16 states. [2018-06-22 01:06:30,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:30,684 INFO ]: Finished difference Result 149 states and 182 transitions. [2018-06-22 01:06:30,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:06:30,684 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 01:06:30,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:30,685 INFO ]: With dead ends: 149 [2018-06-22 01:06:30,685 INFO ]: Without dead ends: 148 [2018-06-22 01:06:30,686 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:06:30,686 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 01:06:30,692 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 64. [2018-06-22 01:06:30,692 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:06:30,693 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-06-22 01:06:30,693 INFO ]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 25 [2018-06-22 01:06:30,693 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:30,693 INFO ]: Abstraction has 64 states and 77 transitions. [2018-06-22 01:06:30,693 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:06:30,693 INFO ]: Start isEmpty. Operand 64 states and 77 transitions. [2018-06-22 01:06:30,694 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:06:30,694 INFO ]: Found error trace [2018-06-22 01:06:30,694 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:30,694 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:30,694 INFO ]: Analyzing trace with hash 798308536, now seen corresponding path program 1 times [2018-06-22 01:06:30,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:30,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:30,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:30,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:30,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:30,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:30,819 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:30,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:30,819 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 01:06:30,820 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:06:30,820 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:06:30,820 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:06:30,820 INFO ]: Start difference. First operand 64 states and 77 transitions. Second operand 14 states. [2018-06-22 01:06:31,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:31,231 INFO ]: Finished difference Result 127 states and 155 transitions. [2018-06-22 01:06:31,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:06:31,232 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 01:06:31,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:31,233 INFO ]: With dead ends: 127 [2018-06-22 01:06:31,233 INFO ]: Without dead ends: 123 [2018-06-22 01:06:31,233 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:06:31,233 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 01:06:31,239 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 60. [2018-06-22 01:06:31,239 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:06:31,240 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-06-22 01:06:31,240 INFO ]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 25 [2018-06-22 01:06:31,240 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:31,240 INFO ]: Abstraction has 60 states and 73 transitions. [2018-06-22 01:06:31,240 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:06:31,240 INFO ]: Start isEmpty. Operand 60 states and 73 transitions. [2018-06-22 01:06:31,241 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:06:31,241 INFO ]: Found error trace [2018-06-22 01:06:31,241 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:31,241 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:31,241 INFO ]: Analyzing trace with hash -447678504, now seen corresponding path program 1 times [2018-06-22 01:06:31,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:31,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:31,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:31,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:31,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:31,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:31,446 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:31,446 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:31,446 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 01:06:31,446 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:06:31,446 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:06:31,446 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:06:31,446 INFO ]: Start difference. First operand 60 states and 73 transitions. Second operand 16 states. [2018-06-22 01:06:32,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:32,254 INFO ]: Finished difference Result 146 states and 179 transitions. [2018-06-22 01:06:32,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:06:32,256 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 01:06:32,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:32,257 INFO ]: With dead ends: 146 [2018-06-22 01:06:32,257 INFO ]: Without dead ends: 143 [2018-06-22 01:06:32,258 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:06:32,258 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 01:06:32,262 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 50. [2018-06-22 01:06:32,262 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 01:06:32,262 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-06-22 01:06:32,262 INFO ]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 25 [2018-06-22 01:06:32,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:32,263 INFO ]: Abstraction has 50 states and 61 transitions. [2018-06-22 01:06:32,263 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:06:32,263 INFO ]: Start isEmpty. Operand 50 states and 61 transitions. [2018-06-22 01:06:32,263 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:32,263 INFO ]: Found error trace [2018-06-22 01:06:32,264 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:32,264 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:32,264 INFO ]: Analyzing trace with hash 1070947336, now seen corresponding path program 1 times [2018-06-22 01:06:32,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:32,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:32,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:32,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:32,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:32,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:32,567 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:32,567 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:32,586 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:32,587 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:32,587 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:32,587 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:32,587 INFO ]: Start difference. First operand 50 states and 61 transitions. Second operand 13 states. [2018-06-22 01:06:33,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:33,128 INFO ]: Finished difference Result 219 states and 275 transitions. [2018-06-22 01:06:33,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-22 01:06:33,128 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-22 01:06:33,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:33,131 INFO ]: With dead ends: 219 [2018-06-22 01:06:33,131 INFO ]: Without dead ends: 218 [2018-06-22 01:06:33,132 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=495, Invalid=1575, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:06:33,132 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-22 01:06:33,137 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 56. [2018-06-22 01:06:33,137 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 01:06:33,138 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-06-22 01:06:33,138 INFO ]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 35 [2018-06-22 01:06:33,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:33,138 INFO ]: Abstraction has 56 states and 68 transitions. [2018-06-22 01:06:33,138 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:33,138 INFO ]: Start isEmpty. Operand 56 states and 68 transitions. [2018-06-22 01:06:33,139 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:33,139 INFO ]: Found error trace [2018-06-22 01:06:33,139 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:33,139 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:33,139 INFO ]: Analyzing trace with hash -1229984696, now seen corresponding path program 1 times [2018-06-22 01:06:33,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:33,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:33,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:33,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:33,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:33,159 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:33,959 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:33,960 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:33,960 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:33,960 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:33,960 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:33,960 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:33,960 INFO ]: Start difference. First operand 56 states and 68 transitions. Second operand 13 states. [2018-06-22 01:06:34,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:34,361 INFO ]: Finished difference Result 128 states and 158 transitions. [2018-06-22 01:06:34,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:06:34,361 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-22 01:06:34,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:34,362 INFO ]: With dead ends: 128 [2018-06-22 01:06:34,362 INFO ]: Without dead ends: 124 [2018-06-22 01:06:34,362 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:06:34,362 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 01:06:34,366 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 53. [2018-06-22 01:06:34,366 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:06:34,367 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2018-06-22 01:06:34,367 INFO ]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 35 [2018-06-22 01:06:34,367 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:34,367 INFO ]: Abstraction has 53 states and 64 transitions. [2018-06-22 01:06:34,367 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:34,367 INFO ]: Start isEmpty. Operand 53 states and 64 transitions. [2018-06-22 01:06:34,368 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:34,368 INFO ]: Found error trace [2018-06-22 01:06:34,368 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:34,368 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:34,368 INFO ]: Analyzing trace with hash -801514100, now seen corresponding path program 1 times [2018-06-22 01:06:34,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:34,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:34,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:34,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:34,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:34,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:34,557 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:34,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:34,557 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:34,558 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:34,558 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:34,558 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:34,558 INFO ]: Start difference. First operand 53 states and 64 transitions. Second operand 15 states. [2018-06-22 01:06:35,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:35,044 INFO ]: Finished difference Result 218 states and 270 transitions. [2018-06-22 01:06:35,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:06:35,044 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 01:06:35,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:35,046 INFO ]: With dead ends: 218 [2018-06-22 01:06:35,046 INFO ]: Without dead ends: 217 [2018-06-22 01:06:35,046 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=474, Invalid=1166, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:06:35,046 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-22 01:06:35,049 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 65. [2018-06-22 01:06:35,049 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:06:35,050 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-06-22 01:06:35,050 INFO ]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 35 [2018-06-22 01:06:35,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:35,050 INFO ]: Abstraction has 65 states and 77 transitions. [2018-06-22 01:06:35,050 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:35,050 INFO ]: Start isEmpty. Operand 65 states and 77 transitions. [2018-06-22 01:06:35,051 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:35,051 INFO ]: Found error trace [2018-06-22 01:06:35,051 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:35,051 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:35,051 INFO ]: Analyzing trace with hash -89039412, now seen corresponding path program 1 times [2018-06-22 01:06:35,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:35,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:35,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:35,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:35,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:35,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:35,258 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:35,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:35,258 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:35,259 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:35,259 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:35,259 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:35,259 INFO ]: Start difference. First operand 65 states and 77 transitions. Second operand 15 states. [2018-06-22 01:06:35,593 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:35,593 INFO ]: Finished difference Result 111 states and 134 transitions. [2018-06-22 01:06:35,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:06:35,594 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 01:06:35,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:35,594 INFO ]: With dead ends: 111 [2018-06-22 01:06:35,594 INFO ]: Without dead ends: 106 [2018-06-22 01:06:35,594 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:06:35,595 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 01:06:35,597 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 61. [2018-06-22 01:06:35,597 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 01:06:35,597 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-06-22 01:06:35,598 INFO ]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 35 [2018-06-22 01:06:35,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:35,601 INFO ]: Abstraction has 61 states and 72 transitions. [2018-06-22 01:06:35,602 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:35,602 INFO ]: Start isEmpty. Operand 61 states and 72 transitions. [2018-06-22 01:06:35,603 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:35,603 INFO ]: Found error trace [2018-06-22 01:06:35,603 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:35,603 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:35,603 INFO ]: Analyzing trace with hash 1776957058, now seen corresponding path program 1 times [2018-06-22 01:06:35,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:35,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:35,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:35,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:35,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:35,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:35,774 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:35,774 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:35,774 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:35,774 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:35,774 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:35,774 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:35,774 INFO ]: Start difference. First operand 61 states and 72 transitions. Second operand 13 states. [2018-06-22 01:06:36,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:36,489 INFO ]: Finished difference Result 323 states and 404 transitions. [2018-06-22 01:06:36,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:06:36,489 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-22 01:06:36,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:36,491 INFO ]: With dead ends: 323 [2018-06-22 01:06:36,491 INFO ]: Without dead ends: 322 [2018-06-22 01:06:36,491 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=2138, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:06:36,492 INFO ]: Start minimizeSevpa. Operand 322 states. [2018-06-22 01:06:36,497 INFO ]: Finished minimizeSevpa. Reduced states from 322 to 67. [2018-06-22 01:06:36,497 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:06:36,499 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-06-22 01:06:36,499 INFO ]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 35 [2018-06-22 01:06:36,499 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:36,499 INFO ]: Abstraction has 67 states and 80 transitions. [2018-06-22 01:06:36,499 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:36,499 INFO ]: Start isEmpty. Operand 67 states and 80 transitions. [2018-06-22 01:06:36,500 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:36,500 INFO ]: Found error trace [2018-06-22 01:06:36,500 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:36,500 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:36,500 INFO ]: Analyzing trace with hash -523974974, now seen corresponding path program 1 times [2018-06-22 01:06:36,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:36,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:36,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:36,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:36,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:36,516 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:36,642 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:36,642 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:36,642 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:36,642 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:36,642 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:36,642 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:36,642 INFO ]: Start difference. First operand 67 states and 80 transitions. Second operand 13 states. [2018-06-22 01:06:36,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:36,994 INFO ]: Finished difference Result 200 states and 246 transitions. [2018-06-22 01:06:36,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:06:36,995 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-22 01:06:36,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:36,996 INFO ]: With dead ends: 200 [2018-06-22 01:06:36,996 INFO ]: Without dead ends: 196 [2018-06-22 01:06:36,997 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:06:36,997 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-22 01:06:37,001 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 63. [2018-06-22 01:06:37,001 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:06:37,001 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-06-22 01:06:37,001 INFO ]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 35 [2018-06-22 01:06:37,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:37,001 INFO ]: Abstraction has 63 states and 75 transitions. [2018-06-22 01:06:37,001 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:37,002 INFO ]: Start isEmpty. Operand 63 states and 75 transitions. [2018-06-22 01:06:37,002 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:37,002 INFO ]: Found error trace [2018-06-22 01:06:37,002 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:37,002 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:37,003 INFO ]: Analyzing trace with hash -95504378, now seen corresponding path program 1 times [2018-06-22 01:06:37,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:37,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:37,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:37,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:37,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:37,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:37,273 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:37,273 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:37,273 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:37,273 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:37,273 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:37,273 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:37,273 INFO ]: Start difference. First operand 63 states and 75 transitions. Second operand 15 states. [2018-06-22 01:06:38,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:38,006 INFO ]: Finished difference Result 296 states and 368 transitions. [2018-06-22 01:06:38,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:06:38,109 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 01:06:38,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:38,110 INFO ]: With dead ends: 296 [2018-06-22 01:06:38,110 INFO ]: Without dead ends: 295 [2018-06-22 01:06:38,111 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=498, Invalid=1224, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:06:38,111 INFO ]: Start minimizeSevpa. Operand 295 states. [2018-06-22 01:06:38,114 INFO ]: Finished minimizeSevpa. Reduced states from 295 to 67. [2018-06-22 01:06:38,115 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:06:38,115 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-06-22 01:06:38,115 INFO ]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 35 [2018-06-22 01:06:38,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:38,115 INFO ]: Abstraction has 67 states and 80 transitions. [2018-06-22 01:06:38,115 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:38,115 INFO ]: Start isEmpty. Operand 67 states and 80 transitions. [2018-06-22 01:06:38,116 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:38,116 INFO ]: Found error trace [2018-06-22 01:06:38,116 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:38,116 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:38,116 INFO ]: Analyzing trace with hash 616970310, now seen corresponding path program 1 times [2018-06-22 01:06:38,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:38,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:38,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:38,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:38,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:38,130 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:38,293 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:38,293 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:38,293 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:38,293 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:38,293 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:38,293 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:38,293 INFO ]: Start difference. First operand 67 states and 80 transitions. Second operand 15 states. [2018-06-22 01:06:38,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:38,631 INFO ]: Finished difference Result 138 states and 168 transitions. [2018-06-22 01:06:38,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:06:38,634 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 01:06:38,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:38,635 INFO ]: With dead ends: 138 [2018-06-22 01:06:38,635 INFO ]: Without dead ends: 134 [2018-06-22 01:06:38,635 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:06:38,636 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 01:06:38,641 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 64. [2018-06-22 01:06:38,642 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:06:38,642 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-06-22 01:06:38,642 INFO ]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 35 [2018-06-22 01:06:38,642 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:38,642 INFO ]: Abstraction has 64 states and 76 transitions. [2018-06-22 01:06:38,642 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:38,642 INFO ]: Start isEmpty. Operand 64 states and 76 transitions. [2018-06-22 01:06:38,643 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:38,643 INFO ]: Found error trace [2018-06-22 01:06:38,643 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:38,643 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:38,643 INFO ]: Analyzing trace with hash -2123063614, now seen corresponding path program 1 times [2018-06-22 01:06:38,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:38,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:38,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:38,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:38,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:38,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:38,885 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:38,885 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:38,885 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:38,885 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:38,885 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:38,885 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:38,886 INFO ]: Start difference. First operand 64 states and 76 transitions. Second operand 13 states. [2018-06-22 01:06:39,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:39,686 INFO ]: Finished difference Result 322 states and 402 transitions. [2018-06-22 01:06:39,686 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-22 01:06:39,686 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-22 01:06:39,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:39,687 INFO ]: With dead ends: 322 [2018-06-22 01:06:39,687 INFO ]: Without dead ends: 321 [2018-06-22 01:06:39,688 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=618, Invalid=2138, Unknown=0, NotChecked=0, Total=2756 [2018-06-22 01:06:39,689 INFO ]: Start minimizeSevpa. Operand 321 states. [2018-06-22 01:06:39,694 INFO ]: Finished minimizeSevpa. Reduced states from 321 to 69. [2018-06-22 01:06:39,694 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:06:39,695 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-06-22 01:06:39,695 INFO ]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 35 [2018-06-22 01:06:39,695 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:39,695 INFO ]: Abstraction has 69 states and 82 transitions. [2018-06-22 01:06:39,695 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:39,695 INFO ]: Start isEmpty. Operand 69 states and 82 transitions. [2018-06-22 01:06:39,695 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:39,695 INFO ]: Found error trace [2018-06-22 01:06:39,695 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:39,695 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:39,695 INFO ]: Analyzing trace with hash -129028350, now seen corresponding path program 1 times [2018-06-22 01:06:39,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:39,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:39,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:39,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:39,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:39,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:39,794 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:39,794 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:39,794 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:39,794 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:39,794 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:39,794 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:39,795 INFO ]: Start difference. First operand 69 states and 82 transitions. Second operand 13 states. [2018-06-22 01:06:40,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:40,344 INFO ]: Finished difference Result 199 states and 244 transitions. [2018-06-22 01:06:40,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:06:40,344 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-22 01:06:40,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:40,345 INFO ]: With dead ends: 199 [2018-06-22 01:06:40,345 INFO ]: Without dead ends: 195 [2018-06-22 01:06:40,345 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:06:40,345 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-22 01:06:40,349 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 65. [2018-06-22 01:06:40,349 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:06:40,350 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-06-22 01:06:40,350 INFO ]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 35 [2018-06-22 01:06:40,350 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:40,350 INFO ]: Abstraction has 65 states and 77 transitions. [2018-06-22 01:06:40,350 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:40,350 INFO ]: Start isEmpty. Operand 65 states and 77 transitions. [2018-06-22 01:06:40,350 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:40,350 INFO ]: Found error trace [2018-06-22 01:06:40,350 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:40,350 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:40,351 INFO ]: Analyzing trace with hash 299442246, now seen corresponding path program 1 times [2018-06-22 01:06:40,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:40,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:40,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:40,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:40,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:40,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:40,495 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:40,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:40,495 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:40,495 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:40,495 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:40,495 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:40,495 INFO ]: Start difference. First operand 65 states and 77 transitions. Second operand 15 states. [2018-06-22 01:06:41,134 WARN ]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-22 01:06:41,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:41,547 INFO ]: Finished difference Result 257 states and 318 transitions. [2018-06-22 01:06:41,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:06:41,549 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 01:06:41,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:41,550 INFO ]: With dead ends: 257 [2018-06-22 01:06:41,550 INFO ]: Without dead ends: 256 [2018-06-22 01:06:41,551 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=414, Invalid=992, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:06:41,551 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-22 01:06:41,555 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 68. [2018-06-22 01:06:41,555 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 01:06:41,555 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-06-22 01:06:41,556 INFO ]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 35 [2018-06-22 01:06:41,556 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:41,556 INFO ]: Abstraction has 68 states and 80 transitions. [2018-06-22 01:06:41,556 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:41,556 INFO ]: Start isEmpty. Operand 68 states and 80 transitions. [2018-06-22 01:06:41,556 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-22 01:06:41,556 INFO ]: Found error trace [2018-06-22 01:06:41,556 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:41,556 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:41,556 INFO ]: Analyzing trace with hash 1011916934, now seen corresponding path program 1 times [2018-06-22 01:06:41,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:41,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:41,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:41,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:41,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:41,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:41,826 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:41,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:41,826 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:41,826 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:41,827 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:41,827 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:41,827 INFO ]: Start difference. First operand 68 states and 80 transitions. Second operand 15 states. [2018-06-22 01:06:42,589 WARN ]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-22 01:06:42,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:42,710 INFO ]: Finished difference Result 69 states and 80 transitions. [2018-06-22 01:06:42,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:06:42,710 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-22 01:06:42,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:42,711 INFO ]: With dead ends: 69 [2018-06-22 01:06:42,711 INFO ]: Without dead ends: 55 [2018-06-22 01:06:42,711 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:06:42,711 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:06:42,713 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 01:06:42,713 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:06:42,713 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-06-22 01:06:42,713 INFO ]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 35 [2018-06-22 01:06:42,713 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:42,713 INFO ]: Abstraction has 55 states and 66 transitions. [2018-06-22 01:06:42,713 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:42,713 INFO ]: Start isEmpty. Operand 55 states and 66 transitions. [2018-06-22 01:06:42,714 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:42,714 INFO ]: Found error trace [2018-06-22 01:06:42,716 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:42,716 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:42,716 INFO ]: Analyzing trace with hash 164419524, now seen corresponding path program 1 times [2018-06-22 01:06:42,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:42,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:42,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:42,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:42,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:42,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:43,115 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:43,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:43,131 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:43,132 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:43,132 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:43,132 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:43,132 INFO ]: Start difference. First operand 55 states and 66 transitions. Second operand 15 states. [2018-06-22 01:06:43,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:43,650 INFO ]: Finished difference Result 218 states and 269 transitions. [2018-06-22 01:06:43,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:06:43,650 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-22 01:06:43,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:43,651 INFO ]: With dead ends: 218 [2018-06-22 01:06:43,651 INFO ]: Without dead ends: 217 [2018-06-22 01:06:43,651 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=474, Invalid=1166, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 01:06:43,651 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-22 01:06:43,654 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 67. [2018-06-22 01:06:43,654 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:06:43,655 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-06-22 01:06:43,655 INFO ]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 36 [2018-06-22 01:06:43,655 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:43,655 INFO ]: Abstraction has 67 states and 79 transitions. [2018-06-22 01:06:43,655 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:43,655 INFO ]: Start isEmpty. Operand 67 states and 79 transitions. [2018-06-22 01:06:43,655 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:43,655 INFO ]: Found error trace [2018-06-22 01:06:43,655 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:43,655 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:43,655 INFO ]: Analyzing trace with hash 876894212, now seen corresponding path program 1 times [2018-06-22 01:06:43,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:43,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:43,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:43,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:43,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:43,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:43,882 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:43,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:43,882 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:43,882 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:43,882 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:43,882 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:43,882 INFO ]: Start difference. First operand 67 states and 79 transitions. Second operand 13 states. [2018-06-22 01:06:44,552 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:44,552 INFO ]: Finished difference Result 332 states and 414 transitions. [2018-06-22 01:06:44,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:06:44,552 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:44,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:44,553 INFO ]: With dead ends: 332 [2018-06-22 01:06:44,553 INFO ]: Without dead ends: 331 [2018-06-22 01:06:44,554 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=573, Invalid=1877, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:06:44,554 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-22 01:06:44,558 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 71. [2018-06-22 01:06:44,558 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 01:06:44,559 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2018-06-22 01:06:44,559 INFO ]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 36 [2018-06-22 01:06:44,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:44,559 INFO ]: Abstraction has 71 states and 84 transitions. [2018-06-22 01:06:44,559 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:44,559 INFO ]: Start isEmpty. Operand 71 states and 84 transitions. [2018-06-22 01:06:44,559 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:44,559 INFO ]: Found error trace [2018-06-22 01:06:44,559 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:44,559 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:44,559 INFO ]: Analyzing trace with hash -1424037820, now seen corresponding path program 1 times [2018-06-22 01:06:44,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:44,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:44,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:44,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:44,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:44,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:45,661 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:45,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:45,662 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:45,662 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:45,662 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:45,662 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:45,662 INFO ]: Start difference. First operand 71 states and 84 transitions. Second operand 13 states. [2018-06-22 01:06:46,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:46,168 INFO ]: Finished difference Result 188 states and 230 transitions. [2018-06-22 01:06:46,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:06:46,169 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:46,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:46,169 INFO ]: With dead ends: 188 [2018-06-22 01:06:46,169 INFO ]: Without dead ends: 181 [2018-06-22 01:06:46,170 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:06:46,170 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 01:06:46,173 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 65. [2018-06-22 01:06:46,173 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:06:46,173 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-06-22 01:06:46,173 INFO ]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 36 [2018-06-22 01:06:46,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:46,174 INFO ]: Abstraction has 65 states and 76 transitions. [2018-06-22 01:06:46,174 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:46,174 INFO ]: Start isEmpty. Operand 65 states and 76 transitions. [2018-06-22 01:06:46,174 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:46,174 INFO ]: Found error trace [2018-06-22 01:06:46,174 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:46,174 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:46,174 INFO ]: Analyzing trace with hash 870429246, now seen corresponding path program 1 times [2018-06-22 01:06:46,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:46,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:46,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:46,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:46,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:46,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:46,331 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:46,331 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:46,332 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:46,332 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:46,332 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:46,332 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:46,332 INFO ]: Start difference. First operand 65 states and 76 transitions. Second operand 15 states. [2018-06-22 01:06:46,857 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-22 01:06:47,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:47,175 INFO ]: Finished difference Result 296 states and 366 transitions. [2018-06-22 01:06:47,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:06:47,175 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-22 01:06:47,175 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:47,176 INFO ]: With dead ends: 296 [2018-06-22 01:06:47,176 INFO ]: Without dead ends: 295 [2018-06-22 01:06:47,177 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=498, Invalid=1224, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:06:47,177 INFO ]: Start minimizeSevpa. Operand 295 states. [2018-06-22 01:06:47,180 INFO ]: Finished minimizeSevpa. Reduced states from 295 to 69. [2018-06-22 01:06:47,180 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:06:47,180 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2018-06-22 01:06:47,180 INFO ]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 36 [2018-06-22 01:06:47,180 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:47,180 INFO ]: Abstraction has 69 states and 81 transitions. [2018-06-22 01:06:47,180 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:47,180 INFO ]: Start isEmpty. Operand 69 states and 81 transitions. [2018-06-22 01:06:47,181 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:47,181 INFO ]: Found error trace [2018-06-22 01:06:47,181 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:47,181 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:47,181 INFO ]: Analyzing trace with hash 1582903934, now seen corresponding path program 1 times [2018-06-22 01:06:47,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:47,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:47,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:47,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:47,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:47,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:47,439 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:47,440 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:47,440 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:47,440 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:47,440 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:47,440 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:47,440 INFO ]: Start difference. First operand 69 states and 81 transitions. Second operand 13 states. [2018-06-22 01:06:48,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:48,038 INFO ]: Finished difference Result 475 states and 593 transitions. [2018-06-22 01:06:48,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 01:06:48,039 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:48,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:48,041 INFO ]: With dead ends: 475 [2018-06-22 01:06:48,041 INFO ]: Without dead ends: 474 [2018-06-22 01:06:48,042 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=680, Invalid=2400, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:06:48,042 INFO ]: Start minimizeSevpa. Operand 474 states. [2018-06-22 01:06:48,049 INFO ]: Finished minimizeSevpa. Reduced states from 474 to 73. [2018-06-22 01:06:48,049 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 01:06:48,049 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-06-22 01:06:48,049 INFO ]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 36 [2018-06-22 01:06:48,049 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:48,049 INFO ]: Abstraction has 73 states and 86 transitions. [2018-06-22 01:06:48,049 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:48,049 INFO ]: Start isEmpty. Operand 73 states and 86 transitions. [2018-06-22 01:06:48,050 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:48,050 INFO ]: Found error trace [2018-06-22 01:06:48,050 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:48,050 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:48,050 INFO ]: Analyzing trace with hash -718028098, now seen corresponding path program 1 times [2018-06-22 01:06:48,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:48,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:48,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:48,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:48,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:48,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:48,335 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:48,335 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:48,335 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:48,335 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:48,335 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:48,335 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:48,335 INFO ]: Start difference. First operand 73 states and 86 transitions. Second operand 13 states. [2018-06-22 01:06:48,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:48,948 INFO ]: Finished difference Result 275 states and 338 transitions. [2018-06-22 01:06:48,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:06:48,948 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:48,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:48,949 INFO ]: With dead ends: 275 [2018-06-22 01:06:48,949 INFO ]: Without dead ends: 269 [2018-06-22 01:06:48,950 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=982, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:06:48,950 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-22 01:06:48,952 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 66. [2018-06-22 01:06:48,952 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:06:48,952 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-06-22 01:06:48,952 INFO ]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 36 [2018-06-22 01:06:48,952 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:48,953 INFO ]: Abstraction has 66 states and 77 transitions. [2018-06-22 01:06:48,953 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:48,953 INFO ]: Start isEmpty. Operand 66 states and 77 transitions. [2018-06-22 01:06:48,953 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:48,953 INFO ]: Found error trace [2018-06-22 01:06:48,953 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:48,953 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:48,953 INFO ]: Analyzing trace with hash 1265375870, now seen corresponding path program 1 times [2018-06-22 01:06:48,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:48,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:48,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:48,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:48,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:48,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:49,374 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:49,374 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:49,374 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-22 01:06:49,374 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:06:49,374 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:06:49,374 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:06:49,374 INFO ]: Start difference. First operand 66 states and 77 transitions. Second operand 15 states. [2018-06-22 01:06:49,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:49,810 INFO ]: Finished difference Result 258 states and 318 transitions. [2018-06-22 01:06:49,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:06:49,811 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-22 01:06:49,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:49,812 INFO ]: With dead ends: 258 [2018-06-22 01:06:49,812 INFO ]: Without dead ends: 257 [2018-06-22 01:06:49,812 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=414, Invalid=992, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:06:49,812 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-22 01:06:49,815 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 69. [2018-06-22 01:06:49,815 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:06:49,815 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-06-22 01:06:49,815 INFO ]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 36 [2018-06-22 01:06:49,816 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:49,816 INFO ]: Abstraction has 69 states and 80 transitions. [2018-06-22 01:06:49,816 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:06:49,816 INFO ]: Start isEmpty. Operand 69 states and 80 transitions. [2018-06-22 01:06:49,816 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:49,816 INFO ]: Found error trace [2018-06-22 01:06:49,816 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:49,816 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:49,816 INFO ]: Analyzing trace with hash 1977850558, now seen corresponding path program 1 times [2018-06-22 01:06:49,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:49,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:49,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:49,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:49,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:49,825 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:50,398 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:50,399 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:50,399 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:50,399 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:50,399 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:50,399 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:50,399 INFO ]: Start difference. First operand 69 states and 80 transitions. Second operand 13 states. [2018-06-22 01:06:51,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:51,031 INFO ]: Finished difference Result 474 states and 590 transitions. [2018-06-22 01:06:51,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-22 01:06:51,031 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:51,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:51,034 INFO ]: With dead ends: 474 [2018-06-22 01:06:51,034 INFO ]: Without dead ends: 473 [2018-06-22 01:06:51,035 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=680, Invalid=2400, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 01:06:51,035 INFO ]: Start minimizeSevpa. Operand 473 states. [2018-06-22 01:06:51,040 INFO ]: Finished minimizeSevpa. Reduced states from 473 to 72. [2018-06-22 01:06:51,041 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:06:51,041 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-06-22 01:06:51,041 INFO ]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 36 [2018-06-22 01:06:51,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:51,041 INFO ]: Abstraction has 72 states and 84 transitions. [2018-06-22 01:06:51,041 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:51,041 INFO ]: Start isEmpty. Operand 72 states and 84 transitions. [2018-06-22 01:06:51,041 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:51,041 INFO ]: Found error trace [2018-06-22 01:06:51,041 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:51,041 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:51,042 INFO ]: Analyzing trace with hash -323081474, now seen corresponding path program 1 times [2018-06-22 01:06:51,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:51,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:51,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:51,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:51,042 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:51,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:51,273 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:51,274 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:51,274 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:51,274 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:51,274 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:51,274 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:51,274 INFO ]: Start difference. First operand 72 states and 84 transitions. Second operand 13 states. [2018-06-22 01:06:51,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:51,631 INFO ]: Finished difference Result 274 states and 335 transitions. [2018-06-22 01:06:51,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:06:51,631 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:51,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:51,632 INFO ]: With dead ends: 274 [2018-06-22 01:06:51,632 INFO ]: Without dead ends: 258 [2018-06-22 01:06:51,632 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=982, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:06:51,632 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-22 01:06:51,634 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 55. [2018-06-22 01:06:51,634 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:06:51,634 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-06-22 01:06:51,634 INFO ]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 36 [2018-06-22 01:06:51,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:51,634 INFO ]: Abstraction has 55 states and 65 transitions. [2018-06-22 01:06:51,634 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:51,634 INFO ]: Start isEmpty. Operand 55 states and 65 transitions. [2018-06-22 01:06:51,635 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:51,635 INFO ]: Found error trace [2018-06-22 01:06:51,635 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:51,635 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:51,635 INFO ]: Analyzing trace with hash 888651652, now seen corresponding path program 1 times [2018-06-22 01:06:51,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:51,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:51,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:51,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:51,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:51,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:51,839 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:51,839 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:51,839 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:51,840 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:51,840 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:51,840 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:51,840 INFO ]: Start difference. First operand 55 states and 65 transitions. Second operand 13 states. [2018-06-22 01:06:52,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:52,263 INFO ]: Finished difference Result 240 states and 298 transitions. [2018-06-22 01:06:52,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:06:52,263 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:52,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:52,264 INFO ]: With dead ends: 240 [2018-06-22 01:06:52,264 INFO ]: Without dead ends: 239 [2018-06-22 01:06:52,264 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=1297, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:06:52,264 INFO ]: Start minimizeSevpa. Operand 239 states. [2018-06-22 01:06:52,268 INFO ]: Finished minimizeSevpa. Reduced states from 239 to 59. [2018-06-22 01:06:52,268 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:06:52,268 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-06-22 01:06:52,268 INFO ]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 36 [2018-06-22 01:06:52,268 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:52,268 INFO ]: Abstraction has 59 states and 69 transitions. [2018-06-22 01:06:52,268 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:52,268 INFO ]: Start isEmpty. Operand 59 states and 69 transitions. [2018-06-22 01:06:52,268 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:52,268 INFO ]: Found error trace [2018-06-22 01:06:52,268 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:52,268 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:52,269 INFO ]: Analyzing trace with hash -1412280380, now seen corresponding path program 1 times [2018-06-22 01:06:52,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:52,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:52,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:52,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:52,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:52,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:52,942 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:52,942 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:52,942 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:52,942 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:52,942 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:52,942 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:52,942 INFO ]: Start difference. First operand 59 states and 69 transitions. Second operand 13 states. [2018-06-22 01:06:53,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:53,139 INFO ]: Finished difference Result 67 states and 77 transitions. [2018-06-22 01:06:53,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:06:53,139 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:53,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:53,139 INFO ]: With dead ends: 67 [2018-06-22 01:06:53,139 INFO ]: Without dead ends: 60 [2018-06-22 01:06:53,140 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:06:53,140 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:06:53,141 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-06-22 01:06:53,141 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:06:53,141 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-06-22 01:06:53,141 INFO ]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 36 [2018-06-22 01:06:53,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:53,141 INFO ]: Abstraction has 53 states and 62 transitions. [2018-06-22 01:06:53,141 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:53,141 INFO ]: Start isEmpty. Operand 53 states and 62 transitions. [2018-06-22 01:06:53,141 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:53,141 INFO ]: Found error trace [2018-06-22 01:06:53,142 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:53,142 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:53,142 INFO ]: Analyzing trace with hash 1594661374, now seen corresponding path program 1 times [2018-06-22 01:06:53,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:53,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:53,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:53,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:53,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:53,151 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:53,313 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:53,313 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:53,313 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:53,313 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:53,313 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:53,313 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:53,313 INFO ]: Start difference. First operand 53 states and 62 transitions. Second operand 13 states. [2018-06-22 01:06:53,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:53,755 INFO ]: Finished difference Result 348 states and 434 transitions. [2018-06-22 01:06:53,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:06:53,788 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:53,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:53,789 INFO ]: With dead ends: 348 [2018-06-22 01:06:53,789 INFO ]: Without dead ends: 347 [2018-06-22 01:06:53,790 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=493, Invalid=1577, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:06:53,790 INFO ]: Start minimizeSevpa. Operand 347 states. [2018-06-22 01:06:53,793 INFO ]: Finished minimizeSevpa. Reduced states from 347 to 57. [2018-06-22 01:06:53,793 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:06:53,793 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-06-22 01:06:53,793 INFO ]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 36 [2018-06-22 01:06:53,793 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:53,793 INFO ]: Abstraction has 57 states and 66 transitions. [2018-06-22 01:06:53,793 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:53,793 INFO ]: Start isEmpty. Operand 57 states and 66 transitions. [2018-06-22 01:06:53,793 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:53,793 INFO ]: Found error trace [2018-06-22 01:06:53,794 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:53,794 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:53,794 INFO ]: Analyzing trace with hash -706270658, now seen corresponding path program 1 times [2018-06-22 01:06:53,794 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:53,794 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:53,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:53,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:53,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:53,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:53,911 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:53,911 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:53,911 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:53,912 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:53,912 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:53,912 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:53,912 INFO ]: Start difference. First operand 57 states and 66 transitions. Second operand 13 states. [2018-06-22 01:06:54,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:54,107 INFO ]: Finished difference Result 92 states and 108 transitions. [2018-06-22 01:06:54,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:06:54,107 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:54,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:54,108 INFO ]: With dead ends: 92 [2018-06-22 01:06:54,108 INFO ]: Without dead ends: 86 [2018-06-22 01:06:54,108 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:06:54,108 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 01:06:54,109 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 52. [2018-06-22 01:06:54,109 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:06:54,109 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-06-22 01:06:54,110 INFO ]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 36 [2018-06-22 01:06:54,110 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:54,110 INFO ]: Abstraction has 52 states and 60 transitions. [2018-06-22 01:06:54,110 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:54,110 INFO ]: Start isEmpty. Operand 52 states and 60 transitions. [2018-06-22 01:06:54,110 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:54,110 INFO ]: Found error trace [2018-06-22 01:06:54,110 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:54,110 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:54,110 INFO ]: Analyzing trace with hash 1989607998, now seen corresponding path program 1 times [2018-06-22 01:06:54,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:54,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:54,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:54,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:54,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:54,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:54,257 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:54,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:54,257 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:54,258 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:54,258 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:54,258 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:54,258 INFO ]: Start difference. First operand 52 states and 60 transitions. Second operand 13 states. [2018-06-22 01:06:54,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:54,644 INFO ]: Finished difference Result 311 states and 388 transitions. [2018-06-22 01:06:54,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:06:54,644 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:54,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:54,644 INFO ]: With dead ends: 311 [2018-06-22 01:06:54,645 INFO ]: Without dead ends: 310 [2018-06-22 01:06:54,645 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 01:06:54,646 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-22 01:06:54,647 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 54. [2018-06-22 01:06:54,647 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:06:54,648 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-06-22 01:06:54,648 INFO ]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 36 [2018-06-22 01:06:54,648 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:54,648 INFO ]: Abstraction has 54 states and 62 transitions. [2018-06-22 01:06:54,648 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:54,648 INFO ]: Start isEmpty. Operand 54 states and 62 transitions. [2018-06-22 01:06:54,648 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-22 01:06:54,648 INFO ]: Found error trace [2018-06-22 01:06:54,648 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:06:54,648 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:06:54,648 INFO ]: Analyzing trace with hash -311324034, now seen corresponding path program 1 times [2018-06-22 01:06:54,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:06:54,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:06:54,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:54,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:06:54,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:06:54,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:06:54,803 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:06:54,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:06:54,803 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:06:54,803 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:06:54,803 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:06:54,803 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:06:54,804 INFO ]: Start difference. First operand 54 states and 62 transitions. Second operand 13 states. [2018-06-22 01:06:54,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:06:54,947 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-22 01:06:54,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:06:54,947 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-22 01:06:54,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:06:54,947 INFO ]: With dead ends: 23 [2018-06-22 01:06:54,947 INFO ]: Without dead ends: 0 [2018-06-22 01:06:54,947 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:06:54,947 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:06:54,947 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:06:54,947 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:06:54,947 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:06:54,947 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-06-22 01:06:54,947 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:06:54,947 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:06:54,947 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:06:54,947 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:06:54,948 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:06:54,953 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:06:54 BoogieIcfgContainer [2018-06-22 01:06:54,953 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:06:54,953 INFO ]: Toolchain (without parser) took 31938.43 ms. Allocated memory was 309.9 MB in the beginning and 632.8 MB in the end (delta: 323.0 MB). Free memory was 241.3 MB in the beginning and 258.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 305.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:54,954 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:06:54,954 INFO ]: ChcToBoogie took 157.00 ms. Allocated memory is still 309.9 MB. Free memory was 241.3 MB in the beginning and 238.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:54,954 INFO ]: Boogie Preprocessor took 52.21 ms. Allocated memory is still 309.9 MB. Free memory was 238.3 MB in the beginning and 236.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:54,955 INFO ]: RCFGBuilder took 1148.22 ms. Allocated memory was 309.9 MB in the beginning and 329.3 MB in the end (delta: 19.4 MB). Free memory was 236.3 MB in the beginning and 298.9 MB in the end (delta: -62.7 MB). Peak memory consumption was 53.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:54,955 INFO ]: TraceAbstraction took 30571.45 ms. Allocated memory was 329.3 MB in the beginning and 632.8 MB in the end (delta: 303.6 MB). Free memory was 298.9 MB in the beginning and 258.8 MB in the end (delta: 40.2 MB). Peak memory consumption was 343.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:06:54,957 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 157.00 ms. Allocated memory is still 309.9 MB. Free memory was 241.3 MB in the beginning and 238.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.21 ms. Allocated memory is still 309.9 MB. Free memory was 238.3 MB in the beginning and 236.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1148.22 ms. Allocated memory was 309.9 MB in the beginning and 329.3 MB in the end (delta: 19.4 MB). Free memory was 236.3 MB in the beginning and 298.9 MB in the end (delta: -62.7 MB). Peak memory consumption was 53.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30571.45 ms. Allocated memory was 329.3 MB in the beginning and 632.8 MB in the end (delta: 303.6 MB). Free memory was 298.9 MB in the beginning and 258.8 MB in the end (delta: 40.2 MB). Peak memory consumption was 343.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. SAFE Result, 30.4s OverallTime, 34 OverallIterations, 2 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2062 SDtfs, 21147 SDslu, 27426 SDs, 0 SdLazy, 4413 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 1194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9245 ImplicationChecksByTransitivity, 23.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 5062 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1098 ConstructedInterpolants, 0 QuantifiedInterpolants, 69831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 108/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-06-54-968.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-06-54-968.csv Received shutdown request...