java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 10:58:22,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 10:58:22,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 10:58:22,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 10:58:22,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 10:58:22,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 10:58:22,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 10:58:22,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 10:58:22,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 10:58:22,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 10:58:22,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 10:58:22,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 10:58:22,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 10:58:22,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 10:58:22,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 10:58:22,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 10:58:22,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 10:58:22,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 10:58:22,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 10:58:22,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 10:58:22,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 10:58:22,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 10:58:22,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 10:58:22,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 10:58:22,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 10:58:22,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 10:58:22,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 10:58:22,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 10:58:22,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 10:58:22,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 10:58:22,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 10:58:22,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 10:58:22,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 10:58:22,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 10:58:22,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 10:58:22,430 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 10:58:22,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 10:58:22,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 10:58:22,454 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 10:58:22,455 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 10:58:22,455 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 10:58:22,456 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 10:58:22,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 10:58:22,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 10:58:22,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 10:58:22,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 10:58:22,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 10:58:22,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 10:58:22,460 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 10:58:22,460 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 10:58:22,460 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 10:58:22,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 10:58:22,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 10:58:22,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 10:58:22,461 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 10:58:22,463 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 10:58:22,463 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 10:58:22,513 INFO ]: Repository-Root is: /tmp [2018-06-22 10:58:22,528 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 10:58:22,533 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 10:58:22,534 INFO ]: Initializing SmtParser... [2018-06-22 10:58:22,534 INFO ]: SmtParser initialized [2018-06-22 10:58:22,535 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 [2018-06-22 10:58:22,536 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 10:58:22,622 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 unknown [2018-06-22 10:58:22,785 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_safe.c-1.smt2 [2018-06-22 10:58:22,789 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 10:58:22,796 INFO ]: Walking toolchain with 4 elements. [2018-06-22 10:58:22,796 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 10:58:22,796 INFO ]: Initializing ChcToBoogie... [2018-06-22 10:58:22,796 INFO ]: ChcToBoogie initialized [2018-06-22 10:58:22,799 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,844 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22 Unit [2018-06-22 10:58:22,844 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 10:58:22,844 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 10:58:22,845 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 10:58:22,845 INFO ]: Boogie Preprocessor initialized [2018-06-22 10:58:22,867 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,867 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,875 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,875 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,877 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,880 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,881 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (1/1) ... [2018-06-22 10:58:22,882 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 10:58:22,883 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 10:58:22,883 INFO ]: Initializing RCFGBuilder... [2018-06-22 10:58:22,883 INFO ]: RCFGBuilder initialized [2018-06-22 10:58:22,890 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (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 10:58:22,904 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 10:58:22,905 INFO ]: Found specification of procedure False [2018-06-22 10:58:22,905 INFO ]: Found implementation of procedure False [2018-06-22 10:58:22,905 INFO ]: Specification and implementation of procedure inv_main29 given in one single declaration [2018-06-22 10:58:22,905 INFO ]: Found specification of procedure inv_main29 [2018-06-22 10:58:22,905 INFO ]: Found implementation of procedure inv_main29 [2018-06-22 10:58:22,905 INFO ]: Specification and implementation of procedure inv_main20 given in one single declaration [2018-06-22 10:58:22,905 INFO ]: Found specification of procedure inv_main20 [2018-06-22 10:58:22,905 INFO ]: Found implementation of procedure inv_main20 [2018-06-22 10:58:22,905 INFO ]: Specification and implementation of procedure inv_main7 given in one single declaration [2018-06-22 10:58:22,905 INFO ]: Found specification of procedure inv_main7 [2018-06-22 10:58:22,905 INFO ]: Found implementation of procedure inv_main7 [2018-06-22 10:58:22,905 INFO ]: Specification and implementation of procedure inv_main3 given in one single declaration [2018-06-22 10:58:22,905 INFO ]: Found specification of procedure inv_main3 [2018-06-22 10:58:22,905 INFO ]: Found implementation of procedure inv_main3 [2018-06-22 10:58:22,905 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 10:58:22,905 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 10:58:22,905 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 10:58:23,295 INFO ]: Using library mode [2018-06-22 10:58:23,296 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:58:23 BoogieIcfgContainer [2018-06-22 10:58:23,296 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 10:58:23,297 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 10:58:23,297 INFO ]: Initializing TraceAbstraction... [2018-06-22 10:58:23,299 INFO ]: TraceAbstraction initialized [2018-06-22 10:58:23,299 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 10:58:22" (1/3) ... [2018-06-22 10:58:23,309 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d917bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 10:58:23, skipping insertion in model container [2018-06-22 10:58:23,309 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 10:58:22" (2/3) ... [2018-06-22 10:58:23,309 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d917bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:58:23, skipping insertion in model container [2018-06-22 10:58:23,309 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:58:23" (3/3) ... [2018-06-22 10:58:23,311 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 10:58:23,320 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 10:58:23,331 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 10:58:23,374 INFO ]: Using default assertion order modulation [2018-06-22 10:58:23,375 INFO ]: Interprodecural is true [2018-06-22 10:58:23,375 INFO ]: Hoare is false [2018-06-22 10:58:23,375 INFO ]: Compute interpolants for FPandBP [2018-06-22 10:58:23,375 INFO ]: Backedges is TWOTRACK [2018-06-22 10:58:23,375 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 10:58:23,375 INFO ]: Difference is false [2018-06-22 10:58:23,375 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 10:58:23,375 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 10:58:23,388 INFO ]: Start isEmpty. Operand 28 states. [2018-06-22 10:58:23,399 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 10:58:23,399 INFO ]: Found error trace [2018-06-22 10:58:23,400 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:23,400 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:23,403 INFO ]: Analyzing trace with hash 1408954944, now seen corresponding path program 1 times [2018-06-22 10:58:23,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:23,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:23,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:23,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:23,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:23,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:23,752 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 10:58:23,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 10:58:23,754 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 10:58:23,756 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:58:23,769 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:58:23,769 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:58:23,771 INFO ]: Start difference. First operand 28 states. Second operand 8 states. [2018-06-22 10:58:24,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:24,263 INFO ]: Finished difference Result 34 states and 46 transitions. [2018-06-22 10:58:24,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:24,266 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 10:58:24,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:24,276 INFO ]: With dead ends: 34 [2018-06-22 10:58:24,276 INFO ]: Without dead ends: 32 [2018-06-22 10:58:24,278 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:58:24,294 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 10:58:24,332 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 10:58:24,333 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 10:58:24,334 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-06-22 10:58:24,335 INFO ]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 21 [2018-06-22 10:58:24,335 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:24,335 INFO ]: Abstraction has 30 states and 39 transitions. [2018-06-22 10:58:24,335 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:58:24,335 INFO ]: Start isEmpty. Operand 30 states and 39 transitions. [2018-06-22 10:58:24,339 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:58:24,339 INFO ]: Found error trace [2018-06-22 10:58:24,339 INFO ]: trace histogram [2, 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 10:58:24,339 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:24,340 INFO ]: Analyzing trace with hash -1033395011, now seen corresponding path program 1 times [2018-06-22 10:58:24,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:24,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:24,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:24,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:24,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:24,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:24,445 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:24,445 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:24,445 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:24,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:24,491 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:24,504 INFO ]: Computing forward predicates... [2018-06-22 10:58:24,618 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:24,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:24,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 10:58:24,644 INFO ]: Interpolant automaton has 8 states [2018-06-22 10:58:24,644 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 10:58:24,644 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:58:24,644 INFO ]: Start difference. First operand 30 states and 39 transitions. Second operand 8 states. [2018-06-22 10:58:24,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:24,817 INFO ]: Finished difference Result 34 states and 45 transitions. [2018-06-22 10:58:24,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 10:58:24,817 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 10:58:24,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:24,819 INFO ]: With dead ends: 34 [2018-06-22 10:58:24,819 INFO ]: Without dead ends: 34 [2018-06-22 10:58:24,820 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:58:24,820 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 10:58:24,826 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 10:58:24,826 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 10:58:24,828 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-06-22 10:58:24,828 INFO ]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 25 [2018-06-22 10:58:24,828 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:24,828 INFO ]: Abstraction has 32 states and 41 transitions. [2018-06-22 10:58:24,828 INFO ]: Interpolant automaton has 8 states. [2018-06-22 10:58:24,828 INFO ]: Start isEmpty. Operand 32 states and 41 transitions. [2018-06-22 10:58:24,829 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:58:24,829 INFO ]: Found error trace [2018-06-22 10:58:24,830 INFO ]: trace histogram [2, 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 10:58:24,830 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:24,830 INFO ]: Analyzing trace with hash -710865345, now seen corresponding path program 1 times [2018-06-22 10:58:24,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:24,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:24,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:24,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:24,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:24,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:24,927 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:24,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:24,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:24,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:24,970 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:24,972 INFO ]: Computing forward predicates... [2018-06-22 10:58:25,044 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:25,070 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:25,070 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 10:58:25,070 INFO ]: Interpolant automaton has 6 states [2018-06-22 10:58:25,070 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 10:58:25,070 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 10:58:25,071 INFO ]: Start difference. First operand 32 states and 41 transitions. Second operand 6 states. [2018-06-22 10:58:25,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:25,521 INFO ]: Finished difference Result 40 states and 52 transitions. [2018-06-22 10:58:25,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:58:25,521 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 10:58:25,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:25,523 INFO ]: With dead ends: 40 [2018-06-22 10:58:25,523 INFO ]: Without dead ends: 40 [2018-06-22 10:58:25,523 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 10:58:25,523 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 10:58:25,529 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-22 10:58:25,529 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 10:58:25,531 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-06-22 10:58:25,531 INFO ]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2018-06-22 10:58:25,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:25,531 INFO ]: Abstraction has 36 states and 47 transitions. [2018-06-22 10:58:25,531 INFO ]: Interpolant automaton has 6 states. [2018-06-22 10:58:25,531 INFO ]: Start isEmpty. Operand 36 states and 47 transitions. [2018-06-22 10:58:25,532 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:58:25,532 INFO ]: Found error trace [2018-06-22 10:58:25,533 INFO ]: trace histogram [2, 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 10:58:25,533 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:25,533 INFO ]: Analyzing trace with hash 628376098, now seen corresponding path program 1 times [2018-06-22 10:58:25,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:25,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:25,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:25,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:25,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:25,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:25,713 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:25,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:25,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:25,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:25,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:25,756 INFO ]: Computing forward predicates... [2018-06-22 10:58:25,860 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:25,884 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:58:25,884 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2018-06-22 10:58:25,885 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:58:25,885 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:58:25,885 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:58:25,885 INFO ]: Start difference. First operand 36 states and 47 transitions. Second operand 12 states. [2018-06-22 10:58:26,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:26,217 INFO ]: Finished difference Result 44 states and 57 transitions. [2018-06-22 10:58:26,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:58:26,217 INFO ]: Start accepts. Automaton has 12 states. Word has length 25 [2018-06-22 10:58:26,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:26,218 INFO ]: With dead ends: 44 [2018-06-22 10:58:26,218 INFO ]: Without dead ends: 44 [2018-06-22 10:58:26,219 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:58:26,219 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 10:58:26,226 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-22 10:58:26,226 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 10:58:26,227 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-06-22 10:58:26,227 INFO ]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2018-06-22 10:58:26,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:26,227 INFO ]: Abstraction has 40 states and 52 transitions. [2018-06-22 10:58:26,227 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:58:26,227 INFO ]: Start isEmpty. Operand 40 states and 52 transitions. [2018-06-22 10:58:26,228 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 10:58:26,228 INFO ]: Found error trace [2018-06-22 10:58:26,228 INFO ]: trace histogram [2, 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 10:58:26,228 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:26,228 INFO ]: Analyzing trace with hash -785950814, now seen corresponding path program 1 times [2018-06-22 10:58:26,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:26,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:26,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:26,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:26,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:26,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:26,329 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:26,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:26,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:26,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:26,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:26,355 INFO ]: Computing forward predicates... [2018-06-22 10:58:26,481 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 10:58:26,500 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:58:26,500 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-06-22 10:58:26,501 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:58:26,501 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:58:26,501 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:58:26,501 INFO ]: Start difference. First operand 40 states and 52 transitions. Second operand 13 states. [2018-06-22 10:58:26,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:26,970 INFO ]: Finished difference Result 44 states and 56 transitions. [2018-06-22 10:58:26,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:26,970 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 10:58:26,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:26,971 INFO ]: With dead ends: 44 [2018-06-22 10:58:26,971 INFO ]: Without dead ends: 44 [2018-06-22 10:58:26,972 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:58:26,972 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 10:58:26,979 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-06-22 10:58:26,979 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 10:58:26,980 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-06-22 10:58:26,980 INFO ]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 25 [2018-06-22 10:58:26,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:26,981 INFO ]: Abstraction has 42 states and 54 transitions. [2018-06-22 10:58:26,981 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:58:26,981 INFO ]: Start isEmpty. Operand 42 states and 54 transitions. [2018-06-22 10:58:26,982 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:58:26,982 INFO ]: Found error trace [2018-06-22 10:58:26,982 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:26,982 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:26,982 INFO ]: Analyzing trace with hash 617516065, now seen corresponding path program 2 times [2018-06-22 10:58:26,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:26,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:26,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:26,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:26,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:26,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:27,054 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:27,054 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:27,054 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:27,072 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:27,089 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:27,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:27,091 INFO ]: Computing forward predicates... [2018-06-22 10:58:27,115 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:27,134 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:27,134 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 10:58:27,135 INFO ]: Interpolant automaton has 7 states [2018-06-22 10:58:27,135 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 10:58:27,135 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 10:58:27,135 INFO ]: Start difference. First operand 42 states and 54 transitions. Second operand 7 states. [2018-06-22 10:58:27,359 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:27,359 INFO ]: Finished difference Result 48 states and 61 transitions. [2018-06-22 10:58:27,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:27,359 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 10:58:27,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:27,360 INFO ]: With dead ends: 48 [2018-06-22 10:58:27,360 INFO ]: Without dead ends: 48 [2018-06-22 10:58:27,361 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:58:27,361 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 10:58:27,367 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 10:58:27,367 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 10:58:27,368 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-06-22 10:58:27,368 INFO ]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 29 [2018-06-22 10:58:27,368 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:27,368 INFO ]: Abstraction has 46 states and 59 transitions. [2018-06-22 10:58:27,368 INFO ]: Interpolant automaton has 7 states. [2018-06-22 10:58:27,368 INFO ]: Start isEmpty. Operand 46 states and 59 transitions. [2018-06-22 10:58:27,370 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:58:27,370 INFO ]: Found error trace [2018-06-22 10:58:27,370 INFO ]: trace histogram [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] [2018-06-22 10:58:27,370 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:27,370 INFO ]: Analyzing trace with hash -1631847164, now seen corresponding path program 1 times [2018-06-22 10:58:27,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:27,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:27,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:27,371 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:27,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:27,382 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:27,707 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:58:27,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:27,707 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:27,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:27,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:27,731 INFO ]: Computing forward predicates... [2018-06-22 10:58:27,828 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 10:58:27,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:27,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 10:58:27,848 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:58:27,848 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:58:27,848 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:58:27,848 INFO ]: Start difference. First operand 46 states and 59 transitions. Second operand 15 states. [2018-06-22 10:58:28,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:28,013 INFO ]: Finished difference Result 52 states and 65 transitions. [2018-06-22 10:58:28,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:58:28,013 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 10:58:28,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:28,014 INFO ]: With dead ends: 52 [2018-06-22 10:58:28,014 INFO ]: Without dead ends: 50 [2018-06-22 10:58:28,015 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:58:28,015 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 10:58:28,021 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 10:58:28,021 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 10:58:28,023 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-06-22 10:58:28,023 INFO ]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 29 [2018-06-22 10:58:28,023 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:28,023 INFO ]: Abstraction has 50 states and 63 transitions. [2018-06-22 10:58:28,023 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:58:28,023 INFO ]: Start isEmpty. Operand 50 states and 63 transitions. [2018-06-22 10:58:28,024 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 10:58:28,024 INFO ]: Found error trace [2018-06-22 10:58:28,024 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:28,024 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:28,025 INFO ]: Analyzing trace with hash 32277791, now seen corresponding path program 2 times [2018-06-22 10:58:28,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:28,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:28,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:28,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,033 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,093 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 10:58:28,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:28,093 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:28,100 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:28,114 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:28,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,117 INFO ]: Computing forward predicates... [2018-06-22 10:58:28,145 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:28,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:28,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-06-22 10:58:28,166 INFO ]: Interpolant automaton has 10 states [2018-06-22 10:58:28,166 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 10:58:28,166 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 10:58:28,166 INFO ]: Start difference. First operand 50 states and 63 transitions. Second operand 10 states. [2018-06-22 10:58:28,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:28,321 INFO ]: Finished difference Result 58 states and 76 transitions. [2018-06-22 10:58:28,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 10:58:28,321 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 10:58:28,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:28,322 INFO ]: With dead ends: 58 [2018-06-22 10:58:28,322 INFO ]: Without dead ends: 58 [2018-06-22 10:58:28,322 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:58:28,322 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 10:58:28,329 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-06-22 10:58:28,329 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 10:58:28,330 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2018-06-22 10:58:28,331 INFO ]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2018-06-22 10:58:28,331 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:28,331 INFO ]: Abstraction has 52 states and 66 transitions. [2018-06-22 10:58:28,331 INFO ]: Interpolant automaton has 10 states. [2018-06-22 10:58:28,331 INFO ]: Start isEmpty. Operand 52 states and 66 transitions. [2018-06-22 10:58:28,332 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:58:28,332 INFO ]: Found error trace [2018-06-22 10:58:28,332 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:28,332 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:28,332 INFO ]: Analyzing trace with hash -1371791485, now seen corresponding path program 3 times [2018-06-22 10:58:28,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:28,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:28,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,333 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:28,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,381 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:58:28,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:28,381 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:28,387 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:28,399 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:58:28,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,402 INFO ]: Computing forward predicates... [2018-06-22 10:58:28,450 INFO ]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:28,469 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 10:58:28,469 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-06-22 10:58:28,470 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:58:28,470 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:58:28,470 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:58:28,470 INFO ]: Start difference. First operand 52 states and 66 transitions. Second operand 12 states. [2018-06-22 10:58:28,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:28,615 INFO ]: Finished difference Result 50 states and 63 transitions. [2018-06-22 10:58:28,616 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:58:28,616 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-22 10:58:28,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:28,617 INFO ]: With dead ends: 50 [2018-06-22 10:58:28,617 INFO ]: Without dead ends: 48 [2018-06-22 10:58:28,617 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:58:28,617 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 10:58:28,627 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 10:58:28,627 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 10:58:28,628 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-06-22 10:58:28,628 INFO ]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 33 [2018-06-22 10:58:28,628 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:28,628 INFO ]: Abstraction has 46 states and 59 transitions. [2018-06-22 10:58:28,628 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:58:28,628 INFO ]: Start isEmpty. Operand 46 states and 59 transitions. [2018-06-22 10:58:28,633 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:58:28,634 INFO ]: Found error trace [2018-06-22 10:58:28,634 INFO ]: trace histogram [3, 2, 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] [2018-06-22 10:58:28,634 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:28,634 INFO ]: Analyzing trace with hash 525924326, now seen corresponding path program 2 times [2018-06-22 10:58:28,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:28,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:28,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:28,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:28,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,820 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:58:28,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:28,820 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:28,826 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:28,840 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:28,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:28,842 INFO ]: Computing forward predicates... [2018-06-22 10:58:29,144 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:58:29,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:29,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-22 10:58:29,163 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:58:29,163 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:58:29,163 INFO ]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:58:29,163 INFO ]: Start difference. First operand 46 states and 59 transitions. Second operand 18 states. [2018-06-22 10:58:29,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:29,475 INFO ]: Finished difference Result 54 states and 68 transitions. [2018-06-22 10:58:29,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:58:29,475 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-22 10:58:29,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:29,477 INFO ]: With dead ends: 54 [2018-06-22 10:58:29,477 INFO ]: Without dead ends: 54 [2018-06-22 10:58:29,477 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-06-22 10:58:29,478 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 10:58:29,485 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 10:58:29,485 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 10:58:29,486 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2018-06-22 10:58:29,486 INFO ]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 33 [2018-06-22 10:58:29,486 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:29,486 INFO ]: Abstraction has 52 states and 66 transitions. [2018-06-22 10:58:29,486 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:58:29,486 INFO ]: Start isEmpty. Operand 52 states and 66 transitions. [2018-06-22 10:58:29,487 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:58:29,487 INFO ]: Found error trace [2018-06-22 10:58:29,487 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:29,488 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:29,488 INFO ]: Analyzing trace with hash 1370797825, now seen corresponding path program 3 times [2018-06-22 10:58:29,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:29,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:29,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:29,488 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:29,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:29,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:29,549 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:58:29,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:29,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:29,565 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:29,632 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 10:58:29,632 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:29,634 INFO ]: Computing forward predicates... [2018-06-22 10:58:29,789 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 10:58:29,808 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:29,808 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-06-22 10:58:29,809 INFO ]: Interpolant automaton has 11 states [2018-06-22 10:58:29,809 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 10:58:29,809 INFO ]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:58:29,809 INFO ]: Start difference. First operand 52 states and 66 transitions. Second operand 11 states. [2018-06-22 10:58:29,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:29,880 INFO ]: Finished difference Result 62 states and 82 transitions. [2018-06-22 10:58:29,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:29,880 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 10:58:29,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:29,881 INFO ]: With dead ends: 62 [2018-06-22 10:58:29,881 INFO ]: Without dead ends: 62 [2018-06-22 10:58:29,882 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 10:58:29,882 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 10:58:29,889 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-06-22 10:58:29,889 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 10:58:29,890 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-06-22 10:58:29,890 INFO ]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 33 [2018-06-22 10:58:29,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:29,890 INFO ]: Abstraction has 54 states and 69 transitions. [2018-06-22 10:58:29,890 INFO ]: Interpolant automaton has 11 states. [2018-06-22 10:58:29,890 INFO ]: Start isEmpty. Operand 54 states and 69 transitions. [2018-06-22 10:58:29,891 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 10:58:29,891 INFO ]: Found error trace [2018-06-22 10:58:29,891 INFO ]: trace histogram [3, 2, 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] [2018-06-22 10:58:29,891 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:29,891 INFO ]: Analyzing trace with hash 2119551334, now seen corresponding path program 3 times [2018-06-22 10:58:29,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:29,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:29,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:29,892 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:29,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:29,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:30,001 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 10:58:30,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:30,001 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:30,010 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:30,021 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 10:58:30,021 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:30,025 INFO ]: Computing forward predicates... [2018-06-22 10:58:30,484 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 10:58:30,503 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:30,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-06-22 10:58:30,504 INFO ]: Interpolant automaton has 19 states [2018-06-22 10:58:30,504 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 10:58:30,504 INFO ]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:58:30,504 INFO ]: Start difference. First operand 54 states and 69 transitions. Second operand 19 states. [2018-06-22 10:58:30,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:30,877 INFO ]: Finished difference Result 58 states and 73 transitions. [2018-06-22 10:58:30,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:58:30,878 INFO ]: Start accepts. Automaton has 19 states. Word has length 33 [2018-06-22 10:58:30,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:30,879 INFO ]: With dead ends: 58 [2018-06-22 10:58:30,879 INFO ]: Without dead ends: 58 [2018-06-22 10:58:30,879 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:58:30,879 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 10:58:30,885 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 10:58:30,885 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 10:58:30,886 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-06-22 10:58:30,886 INFO ]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 33 [2018-06-22 10:58:30,886 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:30,886 INFO ]: Abstraction has 56 states and 71 transitions. [2018-06-22 10:58:30,886 INFO ]: Interpolant automaton has 19 states. [2018-06-22 10:58:30,886 INFO ]: Start isEmpty. Operand 56 states and 71 transitions. [2018-06-22 10:58:30,887 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:58:30,887 INFO ]: Found error trace [2018-06-22 10:58:30,887 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:30,887 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:30,887 INFO ]: Analyzing trace with hash 2054216291, now seen corresponding path program 4 times [2018-06-22 10:58:30,887 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:30,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:30,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:30,888 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:30,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:30,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:31,099 INFO ]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:31,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:31,099 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:31,105 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:31,118 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:31,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:31,119 INFO ]: Computing forward predicates... [2018-06-22 10:58:31,146 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:58:31,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:31,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-06-22 10:58:31,165 INFO ]: Interpolant automaton has 12 states [2018-06-22 10:58:31,165 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 10:58:31,165 INFO ]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-22 10:58:31,165 INFO ]: Start difference. First operand 56 states and 71 transitions. Second operand 12 states. [2018-06-22 10:58:31,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:31,255 INFO ]: Finished difference Result 64 states and 84 transitions. [2018-06-22 10:58:31,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 10:58:31,255 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 10:58:31,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:31,256 INFO ]: With dead ends: 64 [2018-06-22 10:58:31,256 INFO ]: Without dead ends: 64 [2018-06-22 10:58:31,256 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-06-22 10:58:31,256 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 10:58:31,263 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-06-22 10:58:31,263 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 10:58:31,266 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2018-06-22 10:58:31,266 INFO ]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 37 [2018-06-22 10:58:31,266 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:31,266 INFO ]: Abstraction has 58 states and 74 transitions. [2018-06-22 10:58:31,266 INFO ]: Interpolant automaton has 12 states. [2018-06-22 10:58:31,266 INFO ]: Start isEmpty. Operand 58 states and 74 transitions. [2018-06-22 10:58:31,267 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 10:58:31,267 INFO ]: Found error trace [2018-06-22 10:58:31,267 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:31,267 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:31,268 INFO ]: Analyzing trace with hash 785013192, now seen corresponding path program 4 times [2018-06-22 10:58:31,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:31,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:31,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:31,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:31,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:31,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:31,474 INFO ]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 10:58:31,474 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:31,474 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:31,481 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:31,493 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:31,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:31,496 INFO ]: Computing forward predicates... [2018-06-22 10:58:31,699 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 10:58:31,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:31,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2018-06-22 10:58:31,719 INFO ]: Interpolant automaton has 19 states [2018-06-22 10:58:31,719 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 10:58:31,719 INFO ]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:58:31,719 INFO ]: Start difference. First operand 58 states and 74 transitions. Second operand 19 states. [2018-06-22 10:58:32,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:32,030 INFO ]: Finished difference Result 66 states and 82 transitions. [2018-06-22 10:58:32,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 10:58:32,031 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 10:58:32,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:32,032 INFO ]: With dead ends: 66 [2018-06-22 10:58:32,032 INFO ]: Without dead ends: 64 [2018-06-22 10:58:32,032 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:58:32,033 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 10:58:32,040 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-22 10:58:32,040 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 10:58:32,041 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-06-22 10:58:32,041 INFO ]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 37 [2018-06-22 10:58:32,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:32,041 INFO ]: Abstraction has 64 states and 80 transitions. [2018-06-22 10:58:32,041 INFO ]: Interpolant automaton has 19 states. [2018-06-22 10:58:32,041 INFO ]: Start isEmpty. Operand 64 states and 80 transitions. [2018-06-22 10:58:32,043 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:58:32,043 INFO ]: Found error trace [2018-06-22 10:58:32,043 INFO ]: trace histogram [5, 4, 4, 4, 2, 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 10:58:32,043 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:32,043 INFO ]: Analyzing trace with hash 1810603079, now seen corresponding path program 1 times [2018-06-22 10:58:32,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:32,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:32,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:32,044 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:32,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:32,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:32,222 WARN ]: Spent 120.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-06-22 10:58:32,349 INFO ]: Checked inductivity of 39 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:58:32,349 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:32,349 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:32,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:32,393 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:32,395 INFO ]: Computing forward predicates... [2018-06-22 10:58:32,496 INFO ]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 10:58:32,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:32,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 10:58:32,553 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:58:32,553 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:58:32,553 INFO ]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:58:32,553 INFO ]: Start difference. First operand 64 states and 80 transitions. Second operand 17 states. [2018-06-22 10:58:32,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:32,990 INFO ]: Finished difference Result 62 states and 77 transitions. [2018-06-22 10:58:32,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:58:32,991 INFO ]: Start accepts. Automaton has 17 states. Word has length 41 [2018-06-22 10:58:32,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:32,991 INFO ]: With dead ends: 62 [2018-06-22 10:58:32,991 INFO ]: Without dead ends: 58 [2018-06-22 10:58:32,992 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:58:32,992 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 10:58:32,996 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-06-22 10:58:32,996 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 10:58:32,997 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-06-22 10:58:32,997 INFO ]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 41 [2018-06-22 10:58:32,997 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:32,997 INFO ]: Abstraction has 56 states and 71 transitions. [2018-06-22 10:58:32,997 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:58:32,997 INFO ]: Start isEmpty. Operand 56 states and 71 transitions. [2018-06-22 10:58:32,998 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:58:32,998 INFO ]: Found error trace [2018-06-22 10:58:32,998 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:32,999 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:32,999 INFO ]: Analyzing trace with hash 645037994, now seen corresponding path program 5 times [2018-06-22 10:58:32,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:32,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:32,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:32,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:32,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:33,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:33,667 WARN ]: Spent 443.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:58:33,841 INFO ]: Checked inductivity of 31 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:33,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:33,841 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:33,853 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:33,929 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 10:58:33,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:33,932 INFO ]: Computing forward predicates... [2018-06-22 10:58:34,153 INFO ]: Checked inductivity of 31 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:34,173 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:34,173 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-06-22 10:58:34,173 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:58:34,173 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:58:34,173 INFO ]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:58:34,173 INFO ]: Start difference. First operand 56 states and 71 transitions. Second operand 22 states. [2018-06-22 10:58:34,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:34,405 INFO ]: Finished difference Result 64 states and 80 transitions. [2018-06-22 10:58:34,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:58:34,405 INFO ]: Start accepts. Automaton has 22 states. Word has length 41 [2018-06-22 10:58:34,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:34,406 INFO ]: With dead ends: 64 [2018-06-22 10:58:34,406 INFO ]: Without dead ends: 64 [2018-06-22 10:58:34,407 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2018-06-22 10:58:34,407 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 10:58:34,411 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-06-22 10:58:34,411 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 10:58:34,412 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-06-22 10:58:34,412 INFO ]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 41 [2018-06-22 10:58:34,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:34,412 INFO ]: Abstraction has 62 states and 78 transitions. [2018-06-22 10:58:34,412 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:58:34,412 INFO ]: Start isEmpty. Operand 62 states and 78 transitions. [2018-06-22 10:58:34,413 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:58:34,413 INFO ]: Found error trace [2018-06-22 10:58:34,413 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:34,413 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:34,413 INFO ]: Analyzing trace with hash 1291128106, now seen corresponding path program 6 times [2018-06-22 10:58:34,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:34,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:34,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:34,414 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:34,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:34,421 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:34,539 INFO ]: Checked inductivity of 31 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:34,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:34,540 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:34,545 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:58:34,561 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 10:58:34,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:34,563 INFO ]: Computing forward predicates... [2018-06-22 10:58:34,747 INFO ]: Checked inductivity of 31 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 10:58:34,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:34,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-06-22 10:58:34,766 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:58:34,766 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:58:34,766 INFO ]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:58:34,766 INFO ]: Start difference. First operand 62 states and 78 transitions. Second operand 22 states. [2018-06-22 10:58:35,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:35,069 INFO ]: Finished difference Result 66 states and 82 transitions. [2018-06-22 10:58:35,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:58:35,069 INFO ]: Start accepts. Automaton has 22 states. Word has length 41 [2018-06-22 10:58:35,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:35,070 INFO ]: With dead ends: 66 [2018-06-22 10:58:35,070 INFO ]: Without dead ends: 66 [2018-06-22 10:58:35,070 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:58:35,070 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 10:58:35,074 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-06-22 10:58:35,074 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 10:58:35,074 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-06-22 10:58:35,074 INFO ]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 41 [2018-06-22 10:58:35,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:35,075 INFO ]: Abstraction has 64 states and 80 transitions. [2018-06-22 10:58:35,075 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:58:35,075 INFO ]: Start isEmpty. Operand 64 states and 80 transitions. [2018-06-22 10:58:35,075 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 10:58:35,075 INFO ]: Found error trace [2018-06-22 10:58:35,076 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:35,076 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:35,076 INFO ]: Analyzing trace with hash -1549168827, now seen corresponding path program 5 times [2018-06-22 10:58:35,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:35,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:35,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:35,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:35,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:35,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:35,159 INFO ]: Checked inductivity of 55 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 10:58:35,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:35,160 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:35,165 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:35,179 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:58:35,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:35,181 INFO ]: Computing forward predicates... [2018-06-22 10:58:35,204 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:58:35,224 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:35,224 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-06-22 10:58:35,224 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:58:35,224 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:58:35,224 INFO ]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:58:35,225 INFO ]: Start difference. First operand 64 states and 80 transitions. Second operand 13 states. [2018-06-22 10:58:35,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:35,335 INFO ]: Finished difference Result 72 states and 93 transitions. [2018-06-22 10:58:35,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 10:58:35,336 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 10:58:35,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:35,336 INFO ]: With dead ends: 72 [2018-06-22 10:58:35,336 INFO ]: Without dead ends: 72 [2018-06-22 10:58:35,337 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:58:35,337 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 10:58:35,341 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 66. [2018-06-22 10:58:35,341 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 10:58:35,342 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-06-22 10:58:35,342 INFO ]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 41 [2018-06-22 10:58:35,343 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:35,343 INFO ]: Abstraction has 66 states and 83 transitions. [2018-06-22 10:58:35,343 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:58:35,343 INFO ]: Start isEmpty. Operand 66 states and 83 transitions. [2018-06-22 10:58:35,343 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 10:58:35,343 INFO ]: Found error trace [2018-06-22 10:58:35,343 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:35,343 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:35,344 INFO ]: Analyzing trace with hash 324077708, now seen corresponding path program 7 times [2018-06-22 10:58:35,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:35,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:35,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:35,344 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:35,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:35,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:35,518 INFO ]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 10:58:35,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:35,518 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:35,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:35,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:35,539 INFO ]: Computing forward predicates... [2018-06-22 10:58:35,757 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 10:58:35,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:35,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 22 [2018-06-22 10:58:35,777 INFO ]: Interpolant automaton has 22 states [2018-06-22 10:58:35,777 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 10:58:35,777 INFO ]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:58:35,777 INFO ]: Start difference. First operand 66 states and 83 transitions. Second operand 22 states. [2018-06-22 10:58:36,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:36,112 INFO ]: Finished difference Result 76 states and 93 transitions. [2018-06-22 10:58:36,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 10:58:36,112 INFO ]: Start accepts. Automaton has 22 states. Word has length 45 [2018-06-22 10:58:36,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:36,113 INFO ]: With dead ends: 76 [2018-06-22 10:58:36,113 INFO ]: Without dead ends: 74 [2018-06-22 10:58:36,113 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:58:36,113 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 10:58:36,116 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 10:58:36,116 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 10:58:36,117 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-06-22 10:58:36,117 INFO ]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 45 [2018-06-22 10:58:36,117 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:36,117 INFO ]: Abstraction has 74 states and 91 transitions. [2018-06-22 10:58:36,117 INFO ]: Interpolant automaton has 22 states. [2018-06-22 10:58:36,117 INFO ]: Start isEmpty. Operand 74 states and 91 transitions. [2018-06-22 10:58:36,118 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 10:58:36,118 INFO ]: Found error trace [2018-06-22 10:58:36,118 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:36,118 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:36,118 INFO ]: Analyzing trace with hash -1111525977, now seen corresponding path program 6 times [2018-06-22 10:58:36,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:36,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:36,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:36,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:36,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:36,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:36,191 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 10:58:36,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:36,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:36,197 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:58:36,213 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 10:58:36,213 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:36,215 INFO ]: Computing forward predicates... [2018-06-22 10:58:36,244 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 10:58:36,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:36,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 10:58:36,263 INFO ]: Interpolant automaton has 13 states [2018-06-22 10:58:36,264 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 10:58:36,264 INFO ]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-22 10:58:36,264 INFO ]: Start difference. First operand 74 states and 91 transitions. Second operand 13 states. [2018-06-22 10:58:36,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:36,381 INFO ]: Finished difference Result 82 states and 104 transitions. [2018-06-22 10:58:36,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 10:58:36,381 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 10:58:36,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:36,382 INFO ]: With dead ends: 82 [2018-06-22 10:58:36,382 INFO ]: Without dead ends: 82 [2018-06-22 10:58:36,382 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-06-22 10:58:36,383 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 10:58:36,387 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-06-22 10:58:36,387 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 10:58:36,388 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2018-06-22 10:58:36,388 INFO ]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 45 [2018-06-22 10:58:36,388 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:36,388 INFO ]: Abstraction has 76 states and 94 transitions. [2018-06-22 10:58:36,388 INFO ]: Interpolant automaton has 13 states. [2018-06-22 10:58:36,388 INFO ]: Start isEmpty. Operand 76 states and 94 transitions. [2018-06-22 10:58:36,389 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:58:36,389 INFO ]: Found error trace [2018-06-22 10:58:36,389 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:36,389 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:36,389 INFO ]: Analyzing trace with hash 1810574729, now seen corresponding path program 7 times [2018-06-22 10:58:36,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:36,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:36,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:36,390 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:36,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:36,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:36,490 INFO ]: Checked inductivity of 105 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 10:58:36,490 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:36,490 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:36,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:36,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:36,511 INFO ]: Computing forward predicates... [2018-06-22 10:58:36,568 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 10:58:36,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:36,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2018-06-22 10:58:36,589 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:58:36,589 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:58:36,589 INFO ]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:58:36,589 INFO ]: Start difference. First operand 76 states and 94 transitions. Second operand 15 states. [2018-06-22 10:58:36,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:36,985 INFO ]: Finished difference Result 84 states and 107 transitions. [2018-06-22 10:58:36,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 10:58:36,985 INFO ]: Start accepts. Automaton has 15 states. Word has length 49 [2018-06-22 10:58:36,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:36,986 INFO ]: With dead ends: 84 [2018-06-22 10:58:36,986 INFO ]: Without dead ends: 84 [2018-06-22 10:58:36,986 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2018-06-22 10:58:36,986 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 10:58:36,991 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 78. [2018-06-22 10:58:36,991 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 10:58:36,992 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2018-06-22 10:58:36,992 INFO ]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 49 [2018-06-22 10:58:36,992 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:36,992 INFO ]: Abstraction has 78 states and 97 transitions. [2018-06-22 10:58:36,993 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:58:36,993 INFO ]: Start isEmpty. Operand 78 states and 97 transitions. [2018-06-22 10:58:36,993 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:58:36,993 INFO ]: Found error trace [2018-06-22 10:58:36,993 INFO ]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:36,993 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:36,994 INFO ]: Analyzing trace with hash 2092821259, now seen corresponding path program 2 times [2018-06-22 10:58:36,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:36,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:36,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:36,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:36,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:37,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:37,184 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-06-22 10:58:37,442 INFO ]: Checked inductivity of 65 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 10:58:37,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:37,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:37,449 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:37,464 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:37,464 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:37,466 INFO ]: Computing forward predicates... [2018-06-22 10:58:37,651 INFO ]: Checked inductivity of 65 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 10:58:37,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:37,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 10:58:37,670 INFO ]: Interpolant automaton has 20 states [2018-06-22 10:58:37,671 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 10:58:37,671 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-22 10:58:37,671 INFO ]: Start difference. First operand 78 states and 97 transitions. Second operand 20 states. [2018-06-22 10:58:38,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:38,130 INFO ]: Finished difference Result 76 states and 94 transitions. [2018-06-22 10:58:38,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:58:38,132 INFO ]: Start accepts. Automaton has 20 states. Word has length 49 [2018-06-22 10:58:38,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:38,134 INFO ]: With dead ends: 76 [2018-06-22 10:58:38,134 INFO ]: Without dead ends: 70 [2018-06-22 10:58:38,135 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-06-22 10:58:38,135 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 10:58:38,139 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-06-22 10:58:38,139 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 10:58:38,140 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-06-22 10:58:38,140 INFO ]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 49 [2018-06-22 10:58:38,140 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:38,140 INFO ]: Abstraction has 68 states and 86 transitions. [2018-06-22 10:58:38,140 INFO ]: Interpolant automaton has 20 states. [2018-06-22 10:58:38,140 INFO ]: Start isEmpty. Operand 68 states and 86 transitions. [2018-06-22 10:58:38,141 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:58:38,141 INFO ]: Found error trace [2018-06-22 10:58:38,141 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:38,141 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:38,141 INFO ]: Analyzing trace with hash -148121234, now seen corresponding path program 8 times [2018-06-22 10:58:38,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:38,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:38,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:38,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:38,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:38,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:38,818 WARN ]: Spent 439.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:58:39,086 INFO ]: Checked inductivity of 57 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:58:39,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:39,086 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:39,092 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:39,108 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:39,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:39,110 INFO ]: Computing forward predicates... [2018-06-22 10:58:39,329 INFO ]: Checked inductivity of 57 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:58:39,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:39,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2018-06-22 10:58:39,348 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:58:39,348 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:58:39,348 INFO ]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:58:39,348 INFO ]: Start difference. First operand 68 states and 86 transitions. Second operand 26 states. [2018-06-22 10:58:39,653 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:39,653 INFO ]: Finished difference Result 76 states and 95 transitions. [2018-06-22 10:58:39,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:58:39,654 INFO ]: Start accepts. Automaton has 26 states. Word has length 49 [2018-06-22 10:58:39,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:39,655 INFO ]: With dead ends: 76 [2018-06-22 10:58:39,655 INFO ]: Without dead ends: 76 [2018-06-22 10:58:39,656 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 10:58:39,656 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 10:58:39,661 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-06-22 10:58:39,661 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 10:58:39,661 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2018-06-22 10:58:39,662 INFO ]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 49 [2018-06-22 10:58:39,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:39,662 INFO ]: Abstraction has 74 states and 93 transitions. [2018-06-22 10:58:39,662 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:58:39,662 INFO ]: Start isEmpty. Operand 74 states and 93 transitions. [2018-06-22 10:58:39,663 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 10:58:39,663 INFO ]: Found error trace [2018-06-22 10:58:39,663 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:39,663 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:39,663 INFO ]: Analyzing trace with hash -500161810, now seen corresponding path program 9 times [2018-06-22 10:58:39,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:39,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:39,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:39,664 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:39,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:39,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:40,018 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:58:40,120 INFO ]: Checked inductivity of 57 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 10:58:40,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:40,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:40,125 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:40,145 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 10:58:40,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:40,147 INFO ]: Computing forward predicates... [2018-06-22 10:58:40,447 INFO ]: Checked inductivity of 57 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 10:58:40,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:40,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2018-06-22 10:58:40,465 INFO ]: Interpolant automaton has 27 states [2018-06-22 10:58:40,466 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 10:58:40,466 INFO ]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-06-22 10:58:40,466 INFO ]: Start difference. First operand 74 states and 93 transitions. Second operand 27 states. [2018-06-22 10:58:40,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:40,830 INFO ]: Finished difference Result 78 states and 97 transitions. [2018-06-22 10:58:40,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 10:58:40,830 INFO ]: Start accepts. Automaton has 27 states. Word has length 49 [2018-06-22 10:58:40,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:40,831 INFO ]: With dead ends: 78 [2018-06-22 10:58:40,831 INFO ]: Without dead ends: 78 [2018-06-22 10:58:40,831 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 10:58:40,831 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 10:58:40,835 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-06-22 10:58:40,835 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 10:58:40,836 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2018-06-22 10:58:40,836 INFO ]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 49 [2018-06-22 10:58:40,836 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:40,836 INFO ]: Abstraction has 76 states and 95 transitions. [2018-06-22 10:58:40,836 INFO ]: Interpolant automaton has 27 states. [2018-06-22 10:58:40,836 INFO ]: Start isEmpty. Operand 76 states and 95 transitions. [2018-06-22 10:58:40,837 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:58:40,837 INFO ]: Found error trace [2018-06-22 10:58:40,837 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:40,837 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:40,837 INFO ]: Analyzing trace with hash 515574096, now seen corresponding path program 10 times [2018-06-22 10:58:40,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:40,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:40,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:40,838 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:40,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:40,848 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:41,773 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-22 10:58:42,121 INFO ]: Checked inductivity of 72 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 10:58:42,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:42,121 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:42,127 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:42,144 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:42,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:42,146 INFO ]: Computing forward predicates... [2018-06-22 10:58:42,318 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 10:58:42,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:42,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 25 [2018-06-22 10:58:42,348 INFO ]: Interpolant automaton has 25 states [2018-06-22 10:58:42,348 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 10:58:42,348 INFO ]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-06-22 10:58:42,348 INFO ]: Start difference. First operand 76 states and 95 transitions. Second operand 25 states. [2018-06-22 10:58:42,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:42,765 INFO ]: Finished difference Result 88 states and 107 transitions. [2018-06-22 10:58:42,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 10:58:42,765 INFO ]: Start accepts. Automaton has 25 states. Word has length 53 [2018-06-22 10:58:42,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:42,766 INFO ]: With dead ends: 88 [2018-06-22 10:58:42,766 INFO ]: Without dead ends: 86 [2018-06-22 10:58:42,767 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:58:42,767 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 10:58:42,771 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-06-22 10:58:42,771 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 10:58:42,771 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-06-22 10:58:42,771 INFO ]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 53 [2018-06-22 10:58:42,772 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:42,772 INFO ]: Abstraction has 86 states and 105 transitions. [2018-06-22 10:58:42,772 INFO ]: Interpolant automaton has 25 states. [2018-06-22 10:58:42,772 INFO ]: Start isEmpty. Operand 86 states and 105 transitions. [2018-06-22 10:58:42,773 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 10:58:42,773 INFO ]: Found error trace [2018-06-22 10:58:42,773 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:42,773 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:42,773 INFO ]: Analyzing trace with hash 1849513707, now seen corresponding path program 8 times [2018-06-22 10:58:42,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:42,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:42,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:42,773 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:42,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:42,780 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:42,897 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 10:58:42,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:42,897 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:42,902 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:42,918 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:42,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:42,920 INFO ]: Computing forward predicates... [2018-06-22 10:58:42,961 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 10:58:42,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:42,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-22 10:58:42,991 INFO ]: Interpolant automaton has 15 states [2018-06-22 10:58:42,991 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 10:58:42,991 INFO ]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-06-22 10:58:42,991 INFO ]: Start difference. First operand 86 states and 105 transitions. Second operand 15 states. [2018-06-22 10:58:43,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:43,128 INFO ]: Finished difference Result 94 states and 118 transitions. [2018-06-22 10:58:43,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 10:58:43,128 INFO ]: Start accepts. Automaton has 15 states. Word has length 53 [2018-06-22 10:58:43,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:43,129 INFO ]: With dead ends: 94 [2018-06-22 10:58:43,129 INFO ]: Without dead ends: 94 [2018-06-22 10:58:43,129 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:58:43,129 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 10:58:43,135 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-06-22 10:58:43,135 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 10:58:43,135 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2018-06-22 10:58:43,135 INFO ]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 53 [2018-06-22 10:58:43,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:43,135 INFO ]: Abstraction has 88 states and 108 transitions. [2018-06-22 10:58:43,135 INFO ]: Interpolant automaton has 15 states. [2018-06-22 10:58:43,135 INFO ]: Start isEmpty. Operand 88 states and 108 transitions. [2018-06-22 10:58:43,136 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:58:43,136 INFO ]: Found error trace [2018-06-22 10:58:43,136 INFO ]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:43,136 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:43,137 INFO ]: Analyzing trace with hash -660730929, now seen corresponding path program 3 times [2018-06-22 10:58:43,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:43,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:43,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:43,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:43,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:43,147 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:43,307 INFO ]: Checked inductivity of 99 backedges. 32 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 10:58:43,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:43,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:43,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:43,334 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 10:58:43,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:43,337 INFO ]: Computing forward predicates... [2018-06-22 10:58:43,469 INFO ]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 10:58:43,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:43,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-06-22 10:58:43,488 INFO ]: Interpolant automaton has 23 states [2018-06-22 10:58:43,488 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 10:58:43,489 INFO ]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-06-22 10:58:43,489 INFO ]: Start difference. First operand 88 states and 108 transitions. Second operand 23 states. [2018-06-22 10:58:43,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:43,906 INFO ]: Finished difference Result 86 states and 105 transitions. [2018-06-22 10:58:43,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:58:43,906 INFO ]: Start accepts. Automaton has 23 states. Word has length 57 [2018-06-22 10:58:43,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:43,907 INFO ]: With dead ends: 86 [2018-06-22 10:58:43,907 INFO ]: Without dead ends: 78 [2018-06-22 10:58:43,908 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=1169, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:58:43,908 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 10:58:43,911 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-06-22 10:58:43,911 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 10:58:43,912 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2018-06-22 10:58:43,912 INFO ]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 57 [2018-06-22 10:58:43,912 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:43,912 INFO ]: Abstraction has 76 states and 95 transitions. [2018-06-22 10:58:43,912 INFO ]: Interpolant automaton has 23 states. [2018-06-22 10:58:43,912 INFO ]: Start isEmpty. Operand 76 states and 95 transitions. [2018-06-22 10:58:43,913 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:58:43,913 INFO ]: Found error trace [2018-06-22 10:58:43,913 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:43,913 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:43,913 INFO ]: Analyzing trace with hash 1093666098, now seen corresponding path program 11 times [2018-06-22 10:58:43,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:43,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:43,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:43,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:43,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:43,925 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:44,096 INFO ]: Checked inductivity of 91 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 10:58:44,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:44,096 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:44,105 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:44,129 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 10:58:44,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:44,131 INFO ]: Computing forward predicates... [2018-06-22 10:58:44,455 INFO ]: Checked inductivity of 91 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:58:44,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:44,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2018-06-22 10:58:44,475 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:58:44,475 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:58:44,475 INFO ]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:58:44,475 INFO ]: Start difference. First operand 76 states and 95 transitions. Second operand 31 states. [2018-06-22 10:58:44,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:44,840 INFO ]: Finished difference Result 84 states and 104 transitions. [2018-06-22 10:58:44,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 10:58:44,840 INFO ]: Start accepts. Automaton has 31 states. Word has length 57 [2018-06-22 10:58:44,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:44,841 INFO ]: With dead ends: 84 [2018-06-22 10:58:44,841 INFO ]: Without dead ends: 84 [2018-06-22 10:58:44,841 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:58:44,841 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 10:58:44,846 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-06-22 10:58:44,846 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 10:58:44,846 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2018-06-22 10:58:44,846 INFO ]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 57 [2018-06-22 10:58:44,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:44,847 INFO ]: Abstraction has 82 states and 102 transitions. [2018-06-22 10:58:44,847 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:58:44,847 INFO ]: Start isEmpty. Operand 82 states and 102 transitions. [2018-06-22 10:58:44,848 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:58:44,848 INFO ]: Found error trace [2018-06-22 10:58:44,848 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:44,848 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:44,848 INFO ]: Analyzing trace with hash -697169230, now seen corresponding path program 12 times [2018-06-22 10:58:44,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:44,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:44,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:44,849 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:44,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:44,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:45,168 INFO ]: Checked inductivity of 91 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 10:58:45,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:45,169 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:45,176 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:58:45,198 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 10:58:45,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:45,201 INFO ]: Computing forward predicates... [2018-06-22 10:58:45,921 INFO ]: Checked inductivity of 91 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 10:58:45,940 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:45,940 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2018-06-22 10:58:45,940 INFO ]: Interpolant automaton has 31 states [2018-06-22 10:58:45,940 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 10:58:45,940 INFO ]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-06-22 10:58:45,940 INFO ]: Start difference. First operand 82 states and 102 transitions. Second operand 31 states. [2018-06-22 10:58:46,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:46,665 INFO ]: Finished difference Result 86 states and 106 transitions. [2018-06-22 10:58:46,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:58:46,665 INFO ]: Start accepts. Automaton has 31 states. Word has length 57 [2018-06-22 10:58:46,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:46,665 INFO ]: With dead ends: 86 [2018-06-22 10:58:46,665 INFO ]: Without dead ends: 86 [2018-06-22 10:58:46,666 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 10:58:46,666 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 10:58:46,670 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-06-22 10:58:46,670 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 10:58:46,671 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-06-22 10:58:46,671 INFO ]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 57 [2018-06-22 10:58:46,671 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:46,671 INFO ]: Abstraction has 84 states and 104 transitions. [2018-06-22 10:58:46,671 INFO ]: Interpolant automaton has 31 states. [2018-06-22 10:58:46,671 INFO ]: Start isEmpty. Operand 84 states and 104 transitions. [2018-06-22 10:58:46,672 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 10:58:46,672 INFO ]: Found error trace [2018-06-22 10:58:46,672 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:46,672 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:46,672 INFO ]: Analyzing trace with hash -1952542259, now seen corresponding path program 9 times [2018-06-22 10:58:46,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:46,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:46,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:46,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:46,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:46,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:46,837 INFO ]: Checked inductivity of 171 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 10:58:46,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:46,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:46,843 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:46,865 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 10:58:46,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:46,867 INFO ]: Computing forward predicates... [2018-06-22 10:58:46,904 INFO ]: Checked inductivity of 171 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 10:58:46,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:46,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 17 [2018-06-22 10:58:46,923 INFO ]: Interpolant automaton has 17 states [2018-06-22 10:58:46,923 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 10:58:46,923 INFO ]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-06-22 10:58:46,923 INFO ]: Start difference. First operand 84 states and 104 transitions. Second operand 17 states. [2018-06-22 10:58:47,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:47,193 INFO ]: Finished difference Result 92 states and 117 transitions. [2018-06-22 10:58:47,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 10:58:47,193 INFO ]: Start accepts. Automaton has 17 states. Word has length 57 [2018-06-22 10:58:47,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:47,194 INFO ]: With dead ends: 92 [2018-06-22 10:58:47,194 INFO ]: Without dead ends: 92 [2018-06-22 10:58:47,194 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=436, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:58:47,194 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 10:58:47,200 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-06-22 10:58:47,200 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 10:58:47,200 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2018-06-22 10:58:47,200 INFO ]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 57 [2018-06-22 10:58:47,201 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:47,201 INFO ]: Abstraction has 86 states and 107 transitions. [2018-06-22 10:58:47,201 INFO ]: Interpolant automaton has 17 states. [2018-06-22 10:58:47,201 INFO ]: Start isEmpty. Operand 86 states and 107 transitions. [2018-06-22 10:58:47,202 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 10:58:47,202 INFO ]: Found error trace [2018-06-22 10:58:47,202 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:47,202 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:47,202 INFO ]: Analyzing trace with hash -70287825, now seen corresponding path program 10 times [2018-06-22 10:58:47,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:47,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:47,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:47,203 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:47,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:47,210 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:47,427 INFO ]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-22 10:58:47,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:47,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:47,433 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:47,450 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:47,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:47,452 INFO ]: Computing forward predicates... [2018-06-22 10:58:47,476 INFO ]: Checked inductivity of 210 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-06-22 10:58:47,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:47,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2018-06-22 10:58:47,495 INFO ]: Interpolant automaton has 18 states [2018-06-22 10:58:47,495 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 10:58:47,495 INFO ]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-06-22 10:58:47,495 INFO ]: Start difference. First operand 86 states and 107 transitions. Second operand 18 states. [2018-06-22 10:58:47,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:47,734 INFO ]: Finished difference Result 94 states and 120 transitions. [2018-06-22 10:58:47,734 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 10:58:47,734 INFO ]: Start accepts. Automaton has 18 states. Word has length 61 [2018-06-22 10:58:47,734 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:47,735 INFO ]: With dead ends: 94 [2018-06-22 10:58:47,735 INFO ]: Without dead ends: 94 [2018-06-22 10:58:47,735 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:58:47,735 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 10:58:47,740 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-06-22 10:58:47,740 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 10:58:47,740 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-06-22 10:58:47,740 INFO ]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 61 [2018-06-22 10:58:47,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:47,740 INFO ]: Abstraction has 88 states and 110 transitions. [2018-06-22 10:58:47,740 INFO ]: Interpolant automaton has 18 states. [2018-06-22 10:58:47,741 INFO ]: Start isEmpty. Operand 88 states and 110 transitions. [2018-06-22 10:58:47,741 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 10:58:47,741 INFO ]: Found error trace [2018-06-22 10:58:47,741 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:47,741 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:47,742 INFO ]: Analyzing trace with hash 1186159636, now seen corresponding path program 13 times [2018-06-22 10:58:47,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:47,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:47,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:47,742 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:47,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:47,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:48,213 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 10:58:48,213 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:48,231 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:48,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:48,255 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:48,257 INFO ]: Computing forward predicates... [2018-06-22 10:58:48,841 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 10:58:48,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:48,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 27 [2018-06-22 10:58:48,872 INFO ]: Interpolant automaton has 27 states [2018-06-22 10:58:48,872 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 10:58:48,872 INFO ]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-06-22 10:58:48,872 INFO ]: Start difference. First operand 88 states and 110 transitions. Second operand 27 states. [2018-06-22 10:58:49,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:49,598 INFO ]: Finished difference Result 102 states and 124 transitions. [2018-06-22 10:58:49,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 10:58:49,598 INFO ]: Start accepts. Automaton has 27 states. Word has length 61 [2018-06-22 10:58:49,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:49,599 INFO ]: With dead ends: 102 [2018-06-22 10:58:49,599 INFO ]: Without dead ends: 100 [2018-06-22 10:58:49,600 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 10:58:49,600 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 10:58:49,605 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-06-22 10:58:49,605 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 10:58:49,606 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2018-06-22 10:58:49,606 INFO ]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 61 [2018-06-22 10:58:49,606 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:49,606 INFO ]: Abstraction has 100 states and 122 transitions. [2018-06-22 10:58:49,606 INFO ]: Interpolant automaton has 27 states. [2018-06-22 10:58:49,606 INFO ]: Start isEmpty. Operand 100 states and 122 transitions. [2018-06-22 10:58:49,607 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:58:49,607 INFO ]: Found error trace [2018-06-22 10:58:49,607 INFO ]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:49,607 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:49,607 INFO ]: Analyzing trace with hash -893976941, now seen corresponding path program 4 times [2018-06-22 10:58:49,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:49,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:49,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:49,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:49,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:49,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:49,841 INFO ]: Checked inductivity of 141 backedges. 40 proven. 44 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 10:58:49,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:49,841 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:49,846 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:49,868 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:49,868 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:49,869 INFO ]: Computing forward predicates... [2018-06-22 10:58:50,033 INFO ]: Checked inductivity of 141 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 10:58:50,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:50,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-06-22 10:58:50,053 INFO ]: Interpolant automaton has 26 states [2018-06-22 10:58:50,053 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 10:58:50,053 INFO ]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-06-22 10:58:50,053 INFO ]: Start difference. First operand 100 states and 122 transitions. Second operand 26 states. [2018-06-22 10:58:50,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:50,652 INFO ]: Finished difference Result 98 states and 119 transitions. [2018-06-22 10:58:50,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:58:50,652 INFO ]: Start accepts. Automaton has 26 states. Word has length 65 [2018-06-22 10:58:50,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:50,652 INFO ]: With dead ends: 98 [2018-06-22 10:58:50,652 INFO ]: Without dead ends: 88 [2018-06-22 10:58:50,653 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1595, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 10:58:50,653 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 10:58:50,657 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-06-22 10:58:50,657 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 10:58:50,658 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2018-06-22 10:58:50,658 INFO ]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 65 [2018-06-22 10:58:50,658 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:50,658 INFO ]: Abstraction has 86 states and 107 transitions. [2018-06-22 10:58:50,658 INFO ]: Interpolant automaton has 26 states. [2018-06-22 10:58:50,658 INFO ]: Start isEmpty. Operand 86 states and 107 transitions. [2018-06-22 10:58:50,660 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:58:50,660 INFO ]: Found error trace [2018-06-22 10:58:50,660 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:50,660 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:50,660 INFO ]: Analyzing trace with hash 124388086, now seen corresponding path program 14 times [2018-06-22 10:58:50,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:50,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:50,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:50,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:50,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:50,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:50,912 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:58:51,040 INFO ]: Checked inductivity of 133 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 10:58:51,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:51,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:51,046 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:51,068 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:51,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:51,070 INFO ]: Computing forward predicates... [2018-06-22 10:58:51,823 INFO ]: Checked inductivity of 133 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 10:58:51,841 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:51,841 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-06-22 10:58:51,841 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:58:51,842 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:58:51,842 INFO ]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:58:51,842 INFO ]: Start difference. First operand 86 states and 107 transitions. Second operand 34 states. [2018-06-22 10:58:52,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:52,249 INFO ]: Finished difference Result 94 states and 116 transitions. [2018-06-22 10:58:52,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 10:58:52,249 INFO ]: Start accepts. Automaton has 34 states. Word has length 65 [2018-06-22 10:58:52,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:52,250 INFO ]: With dead ends: 94 [2018-06-22 10:58:52,250 INFO ]: Without dead ends: 94 [2018-06-22 10:58:52,251 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=338, Invalid=1824, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 10:58:52,251 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 10:58:52,255 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-06-22 10:58:52,255 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-22 10:58:52,256 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2018-06-22 10:58:52,256 INFO ]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 65 [2018-06-22 10:58:52,256 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:52,256 INFO ]: Abstraction has 92 states and 114 transitions. [2018-06-22 10:58:52,256 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:58:52,256 INFO ]: Start isEmpty. Operand 92 states and 114 transitions. [2018-06-22 10:58:52,256 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:58:52,256 INFO ]: Found error trace [2018-06-22 10:58:52,257 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:52,257 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:52,257 INFO ]: Analyzing trace with hash 358990966, now seen corresponding path program 15 times [2018-06-22 10:58:52,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:52,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:52,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:52,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:52,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:52,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:52,648 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:58:52,771 INFO ]: Checked inductivity of 133 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 10:58:52,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:52,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:52,776 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:58:52,799 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 10:58:52,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:52,802 INFO ]: Computing forward predicates... [2018-06-22 10:58:53,534 INFO ]: Checked inductivity of 133 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 10:58:53,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:53,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-06-22 10:58:53,553 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:58:53,553 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:58:53,553 INFO ]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:58:53,553 INFO ]: Start difference. First operand 92 states and 114 transitions. Second operand 34 states. [2018-06-22 10:58:54,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:54,289 INFO ]: Finished difference Result 96 states and 118 transitions. [2018-06-22 10:58:54,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 10:58:54,289 INFO ]: Start accepts. Automaton has 34 states. Word has length 65 [2018-06-22 10:58:54,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:54,290 INFO ]: With dead ends: 96 [2018-06-22 10:58:54,290 INFO ]: Without dead ends: 96 [2018-06-22 10:58:54,291 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 10:58:54,291 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 10:58:54,295 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-06-22 10:58:54,295 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 10:58:54,296 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2018-06-22 10:58:54,296 INFO ]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 65 [2018-06-22 10:58:54,296 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:54,296 INFO ]: Abstraction has 94 states and 116 transitions. [2018-06-22 10:58:54,296 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:58:54,296 INFO ]: Start isEmpty. Operand 94 states and 116 transitions. [2018-06-22 10:58:54,297 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 10:58:54,297 INFO ]: Found error trace [2018-06-22 10:58:54,297 INFO ]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:54,297 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:54,297 INFO ]: Analyzing trace with hash 1365818385, now seen corresponding path program 11 times [2018-06-22 10:58:54,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:54,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:54,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:54,298 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:54,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:54,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:54,416 INFO ]: Checked inductivity of 253 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-22 10:58:54,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:54,416 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:54,422 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:58:54,446 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 10:58:54,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:54,448 INFO ]: Computing forward predicates... [2018-06-22 10:58:54,517 INFO ]: Checked inductivity of 253 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-22 10:58:54,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:54,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 10:58:54,536 INFO ]: Interpolant automaton has 9 states [2018-06-22 10:58:54,536 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 10:58:54,536 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 10:58:54,536 INFO ]: Start difference. First operand 94 states and 116 transitions. Second operand 9 states. [2018-06-22 10:58:54,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:54,589 INFO ]: Finished difference Result 96 states and 117 transitions. [2018-06-22 10:58:54,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 10:58:54,589 INFO ]: Start accepts. Automaton has 9 states. Word has length 65 [2018-06-22 10:58:54,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:54,589 INFO ]: With dead ends: 96 [2018-06-22 10:58:54,589 INFO ]: Without dead ends: 96 [2018-06-22 10:58:54,590 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 15 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 10:58:54,590 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-22 10:58:54,592 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-06-22 10:58:54,592 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 10:58:54,592 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-06-22 10:58:54,592 INFO ]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 65 [2018-06-22 10:58:54,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:54,592 INFO ]: Abstraction has 94 states and 115 transitions. [2018-06-22 10:58:54,592 INFO ]: Interpolant automaton has 9 states. [2018-06-22 10:58:54,592 INFO ]: Start isEmpty. Operand 94 states and 115 transitions. [2018-06-22 10:58:54,593 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:58:54,593 INFO ]: Found error trace [2018-06-22 10:58:54,593 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:54,593 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:54,593 INFO ]: Analyzing trace with hash 69533912, now seen corresponding path program 16 times [2018-06-22 10:58:54,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:54,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:54,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:54,594 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:54,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:54,603 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:55,574 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 10:58:55,574 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:55,574 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:55,579 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:58:55,604 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:58:55,604 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:55,607 INFO ]: Computing forward predicates... [2018-06-22 10:58:55,861 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 10:58:55,879 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:55,879 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 30 [2018-06-22 10:58:55,880 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:58:55,880 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:58:55,880 INFO ]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:58:55,880 INFO ]: Start difference. First operand 94 states and 115 transitions. Second operand 30 states. [2018-06-22 10:58:56,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:56,740 INFO ]: Finished difference Result 110 states and 131 transitions. [2018-06-22 10:58:56,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:58:56,740 INFO ]: Start accepts. Automaton has 30 states. Word has length 69 [2018-06-22 10:58:56,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:56,740 INFO ]: With dead ends: 110 [2018-06-22 10:58:56,741 INFO ]: Without dead ends: 108 [2018-06-22 10:58:56,741 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 17 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=154, Invalid=2198, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 10:58:56,741 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 10:58:56,747 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-06-22 10:58:56,747 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 10:58:56,748 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2018-06-22 10:58:56,748 INFO ]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 69 [2018-06-22 10:58:56,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:56,748 INFO ]: Abstraction has 108 states and 129 transitions. [2018-06-22 10:58:56,748 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:58:56,748 INFO ]: Start isEmpty. Operand 108 states and 129 transitions. [2018-06-22 10:58:56,752 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 10:58:56,752 INFO ]: Found error trace [2018-06-22 10:58:56,752 INFO ]: trace histogram [12, 11, 11, 11, 2, 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 10:58:56,752 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:56,752 INFO ]: Analyzing trace with hash 1263041971, now seen corresponding path program 1 times [2018-06-22 10:58:56,752 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:56,752 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:56,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:56,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:58:56,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:56,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:57,069 INFO ]: Checked inductivity of 256 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-06-22 10:58:57,069 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:57,069 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:57,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:57,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:57,099 INFO ]: Computing forward predicates... [2018-06-22 10:58:57,431 INFO ]: Checked inductivity of 256 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-06-22 10:58:57,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:57,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 28 [2018-06-22 10:58:57,450 INFO ]: Interpolant automaton has 28 states [2018-06-22 10:58:57,450 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 10:58:57,450 INFO ]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2018-06-22 10:58:57,450 INFO ]: Start difference. First operand 108 states and 129 transitions. Second operand 28 states. [2018-06-22 10:58:58,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:58:58,787 INFO ]: Finished difference Result 178 states and 238 transitions. [2018-06-22 10:58:58,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 10:58:58,809 INFO ]: Start accepts. Automaton has 28 states. Word has length 69 [2018-06-22 10:58:58,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:58:58,811 INFO ]: With dead ends: 178 [2018-06-22 10:58:58,811 INFO ]: Without dead ends: 128 [2018-06-22 10:58:58,811 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=329, Invalid=1927, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 10:58:58,811 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 10:58:58,821 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-06-22 10:58:58,821 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 10:58:58,822 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-06-22 10:58:58,822 INFO ]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 69 [2018-06-22 10:58:58,822 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:58:58,822 INFO ]: Abstraction has 110 states and 140 transitions. [2018-06-22 10:58:58,822 INFO ]: Interpolant automaton has 28 states. [2018-06-22 10:58:58,822 INFO ]: Start isEmpty. Operand 110 states and 140 transitions. [2018-06-22 10:58:58,823 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:58:58,823 INFO ]: Found error trace [2018-06-22 10:58:58,823 INFO ]: trace histogram [12, 11, 11, 11, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:58:58,823 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:58:58,823 INFO ]: Analyzing trace with hash 205292757, now seen corresponding path program 2 times [2018-06-22 10:58:58,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:58:58,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:58:58,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:58,824 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:58:58,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:58:58,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:59,197 INFO ]: Checked inductivity of 263 backedges. 24 proven. 68 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-22 10:58:59,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:58:59,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:58:59,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:58:59,224 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:58:59,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:58:59,228 INFO ]: Computing forward predicates... [2018-06-22 10:58:59,599 INFO ]: Checked inductivity of 263 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 10:58:59,617 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:58:59,617 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 30 [2018-06-22 10:58:59,617 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:58:59,617 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:58:59,617 INFO ]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:58:59,617 INFO ]: Start difference. First operand 110 states and 140 transitions. Second operand 30 states. [2018-06-22 10:59:01,121 WARN ]: Spent 499.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2018-06-22 10:59:01,530 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2018-06-22 10:59:02,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:02,146 INFO ]: Finished difference Result 179 states and 242 transitions. [2018-06-22 10:59:02,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 10:59:02,146 INFO ]: Start accepts. Automaton has 30 states. Word has length 73 [2018-06-22 10:59:02,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:02,147 INFO ]: With dead ends: 179 [2018-06-22 10:59:02,147 INFO ]: Without dead ends: 128 [2018-06-22 10:59:02,148 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=354, Invalid=2616, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 10:59:02,148 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-22 10:59:02,160 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-06-22 10:59:02,160 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 10:59:02,161 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-06-22 10:59:02,161 INFO ]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 73 [2018-06-22 10:59:02,162 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:02,162 INFO ]: Abstraction has 110 states and 140 transitions. [2018-06-22 10:59:02,162 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:59:02,162 INFO ]: Start isEmpty. Operand 110 states and 140 transitions. [2018-06-22 10:59:02,162 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:59:02,162 INFO ]: Found error trace [2018-06-22 10:59:02,162 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:02,162 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:02,163 INFO ]: Analyzing trace with hash 1039552570, now seen corresponding path program 17 times [2018-06-22 10:59:02,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:02,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:02,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:02,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:02,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:02,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:02,477 INFO ]: Checked inductivity of 183 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 10:59:02,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:02,477 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:02,482 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:02,614 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 10:59:02,614 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:02,618 INFO ]: Computing forward predicates... [2018-06-22 10:59:03,370 INFO ]: Checked inductivity of 183 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 10:59:03,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:03,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-06-22 10:59:03,389 INFO ]: Interpolant automaton has 38 states [2018-06-22 10:59:03,389 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 10:59:03,389 INFO ]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 10:59:03,389 INFO ]: Start difference. First operand 110 states and 140 transitions. Second operand 38 states. [2018-06-22 10:59:03,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:03,901 INFO ]: Finished difference Result 126 states and 159 transitions. [2018-06-22 10:59:03,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 10:59:03,901 INFO ]: Start accepts. Automaton has 38 states. Word has length 73 [2018-06-22 10:59:03,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:03,902 INFO ]: With dead ends: 126 [2018-06-22 10:59:03,902 INFO ]: Without dead ends: 122 [2018-06-22 10:59:03,902 INFO ]: 0 DeclaredPredicates, 126 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=547, Invalid=2993, Unknown=0, NotChecked=0, Total=3540 [2018-06-22 10:59:03,902 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 10:59:03,907 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 102. [2018-06-22 10:59:03,907 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 10:59:03,908 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2018-06-22 10:59:03,908 INFO ]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 73 [2018-06-22 10:59:03,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:03,908 INFO ]: Abstraction has 102 states and 132 transitions. [2018-06-22 10:59:03,908 INFO ]: Interpolant automaton has 38 states. [2018-06-22 10:59:03,908 INFO ]: Start isEmpty. Operand 102 states and 132 transitions. [2018-06-22 10:59:03,909 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:59:03,909 INFO ]: Found error trace [2018-06-22 10:59:03,909 INFO ]: trace histogram [9, 8, 8, 8, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:03,909 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:03,909 INFO ]: Analyzing trace with hash 1366541143, now seen corresponding path program 5 times [2018-06-22 10:59:03,909 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:03,909 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:03,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:03,910 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:03,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:03,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:04,096 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2018-06-22 10:59:04,293 INFO ]: Checked inductivity of 191 backedges. 48 proven. 69 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 10:59:04,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:04,293 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:04,298 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 10:59:04,324 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-22 10:59:04,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:04,326 INFO ]: Computing forward predicates... [2018-06-22 10:59:04,566 INFO ]: Checked inductivity of 191 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-22 10:59:04,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:04,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2018-06-22 10:59:04,584 INFO ]: Interpolant automaton has 30 states [2018-06-22 10:59:04,584 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 10:59:04,584 INFO ]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2018-06-22 10:59:04,585 INFO ]: Start difference. First operand 102 states and 132 transitions. Second operand 30 states. [2018-06-22 10:59:05,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:05,184 INFO ]: Finished difference Result 126 states and 155 transitions. [2018-06-22 10:59:05,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 10:59:05,184 INFO ]: Start accepts. Automaton has 30 states. Word has length 73 [2018-06-22 10:59:05,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:05,185 INFO ]: With dead ends: 126 [2018-06-22 10:59:05,185 INFO ]: Without dead ends: 114 [2018-06-22 10:59:05,186 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 10:59:05,186 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-22 10:59:05,191 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 86. [2018-06-22 10:59:05,192 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-22 10:59:05,192 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2018-06-22 10:59:05,192 INFO ]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 73 [2018-06-22 10:59:05,192 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:05,192 INFO ]: Abstraction has 86 states and 114 transitions. [2018-06-22 10:59:05,192 INFO ]: Interpolant automaton has 30 states. [2018-06-22 10:59:05,192 INFO ]: Start isEmpty. Operand 86 states and 114 transitions. [2018-06-22 10:59:05,193 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 10:59:05,193 INFO ]: Found error trace [2018-06-22 10:59:05,193 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:05,193 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:05,193 INFO ]: Analyzing trace with hash 316090, now seen corresponding path program 18 times [2018-06-22 10:59:05,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:05,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:05,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:05,199 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:05,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:05,214 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:05,559 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:59:05,720 INFO ]: Checked inductivity of 183 backedges. 42 proven. 61 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-06-22 10:59:05,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:05,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:05,726 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:59:05,753 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 10:59:05,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:05,755 INFO ]: Computing forward predicates... [2018-06-22 10:59:06,136 INFO ]: Checked inductivity of 183 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 10:59:06,155 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:06,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2018-06-22 10:59:06,155 INFO ]: Interpolant automaton has 39 states [2018-06-22 10:59:06,155 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 10:59:06,156 INFO ]: CoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 10:59:06,156 INFO ]: Start difference. First operand 86 states and 114 transitions. Second operand 39 states. [2018-06-22 10:59:06,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:06,707 INFO ]: Finished difference Result 114 states and 147 transitions. [2018-06-22 10:59:06,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 10:59:06,707 INFO ]: Start accepts. Automaton has 39 states. Word has length 73 [2018-06-22 10:59:06,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:06,708 INFO ]: With dead ends: 114 [2018-06-22 10:59:06,708 INFO ]: Without dead ends: 108 [2018-06-22 10:59:06,708 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=441, Invalid=2421, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 10:59:06,709 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-22 10:59:06,714 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-06-22 10:59:06,714 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 10:59:06,715 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2018-06-22 10:59:06,715 INFO ]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 73 [2018-06-22 10:59:06,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:06,715 INFO ]: Abstraction has 106 states and 135 transitions. [2018-06-22 10:59:06,715 INFO ]: Interpolant automaton has 39 states. [2018-06-22 10:59:06,715 INFO ]: Start isEmpty. Operand 106 states and 135 transitions. [2018-06-22 10:59:06,716 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:59:06,716 INFO ]: Found error trace [2018-06-22 10:59:06,716 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:06,716 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:06,716 INFO ]: Analyzing trace with hash -1287981156, now seen corresponding path program 19 times [2018-06-22 10:59:06,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:06,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:06,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:06,717 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:06,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:06,726 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:07,024 INFO ]: Checked inductivity of 210 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-22 10:59:07,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:07,024 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:07,030 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:07,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:07,057 INFO ]: Computing forward predicates... [2018-06-22 10:59:07,460 INFO ]: Checked inductivity of 210 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 10:59:07,479 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:07,479 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 34 [2018-06-22 10:59:07,479 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:59:07,479 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:59:07,479 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:59:07,479 INFO ]: Start difference. First operand 106 states and 135 transitions. Second operand 34 states. [2018-06-22 10:59:09,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:09,025 INFO ]: Finished difference Result 130 states and 161 transitions. [2018-06-22 10:59:09,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:59:09,026 INFO ]: Start accepts. Automaton has 34 states. Word has length 77 [2018-06-22 10:59:09,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:09,027 INFO ]: With dead ends: 130 [2018-06-22 10:59:09,027 INFO ]: Without dead ends: 124 [2018-06-22 10:59:09,027 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 62 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=2894, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 10:59:09,027 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 10:59:09,035 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 118. [2018-06-22 10:59:09,035 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 10:59:09,036 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2018-06-22 10:59:09,036 INFO ]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 77 [2018-06-22 10:59:09,036 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:09,036 INFO ]: Abstraction has 118 states and 147 transitions. [2018-06-22 10:59:09,036 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:59:09,036 INFO ]: Start isEmpty. Operand 118 states and 147 transitions. [2018-06-22 10:59:09,037 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 10:59:09,037 INFO ]: Found error trace [2018-06-22 10:59:09,037 INFO ]: trace histogram [12, 11, 11, 11, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:09,037 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:09,037 INFO ]: Analyzing trace with hash 147222903, now seen corresponding path program 3 times [2018-06-22 10:59:09,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:09,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:09,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:09,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 10:59:09,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:09,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:09,554 INFO ]: Checked inductivity of 274 backedges. 28 proven. 93 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-06-22 10:59:09,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:09,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:09,559 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:09,589 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-22 10:59:09,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:09,593 INFO ]: Computing forward predicates... [2018-06-22 10:59:09,819 INFO ]: Checked inductivity of 274 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-22 10:59:09,837 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:09,837 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2018-06-22 10:59:09,838 INFO ]: Interpolant automaton has 21 states [2018-06-22 10:59:09,838 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 10:59:09,838 INFO ]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-06-22 10:59:09,838 INFO ]: Start difference. First operand 118 states and 147 transitions. Second operand 21 states. [2018-06-22 10:59:10,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:10,432 INFO ]: Finished difference Result 197 states and 256 transitions. [2018-06-22 10:59:10,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 10:59:10,432 INFO ]: Start accepts. Automaton has 21 states. Word has length 77 [2018-06-22 10:59:10,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:10,433 INFO ]: With dead ends: 197 [2018-06-22 10:59:10,433 INFO ]: Without dead ends: 140 [2018-06-22 10:59:10,433 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 21 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 10:59:10,433 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 10:59:10,439 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 118. [2018-06-22 10:59:10,439 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 10:59:10,440 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2018-06-22 10:59:10,440 INFO ]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 77 [2018-06-22 10:59:10,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:10,440 INFO ]: Abstraction has 118 states and 147 transitions. [2018-06-22 10:59:10,440 INFO ]: Interpolant automaton has 21 states. [2018-06-22 10:59:10,440 INFO ]: Start isEmpty. Operand 118 states and 147 transitions. [2018-06-22 10:59:10,441 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:59:10,441 INFO ]: Found error trace [2018-06-22 10:59:10,441 INFO ]: trace histogram [12, 11, 11, 11, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:10,441 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:10,441 INFO ]: Analyzing trace with hash 352314265, now seen corresponding path program 4 times [2018-06-22 10:59:10,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:10,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:10,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:10,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:10,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:10,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:10,714 INFO ]: Checked inductivity of 289 backedges. 30 proven. 114 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-06-22 10:59:10,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:10,714 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:10,720 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 10:59:10,744 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 10:59:10,744 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:10,747 INFO ]: Computing forward predicates... [2018-06-22 10:59:11,147 INFO ]: Checked inductivity of 289 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-06-22 10:59:11,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:11,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 34 [2018-06-22 10:59:11,165 INFO ]: Interpolant automaton has 34 states [2018-06-22 10:59:11,165 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 10:59:11,165 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 10:59:11,165 INFO ]: Start difference. First operand 118 states and 147 transitions. Second operand 34 states. [2018-06-22 10:59:13,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:13,065 INFO ]: Finished difference Result 201 states and 259 transitions. [2018-06-22 10:59:13,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 10:59:13,065 INFO ]: Start accepts. Automaton has 34 states. Word has length 81 [2018-06-22 10:59:13,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:13,066 INFO ]: With dead ends: 201 [2018-06-22 10:59:13,066 INFO ]: Without dead ends: 144 [2018-06-22 10:59:13,066 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=489, Invalid=4623, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 10:59:13,067 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 10:59:13,073 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 118. [2018-06-22 10:59:13,073 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 10:59:13,074 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2018-06-22 10:59:13,074 INFO ]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 81 [2018-06-22 10:59:13,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:13,074 INFO ]: Abstraction has 118 states and 147 transitions. [2018-06-22 10:59:13,074 INFO ]: Interpolant automaton has 34 states. [2018-06-22 10:59:13,074 INFO ]: Start isEmpty. Operand 118 states and 147 transitions. [2018-06-22 10:59:13,075 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:59:13,075 INFO ]: Found error trace [2018-06-22 10:59:13,076 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:13,076 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:13,076 INFO ]: Analyzing trace with hash 38710782, now seen corresponding path program 20 times [2018-06-22 10:59:13,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:13,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:13,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:13,076 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:13,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:13,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:13,557 INFO ]: Checked inductivity of 241 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 10:59:13,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:13,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:13,563 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 10:59:13,591 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 10:59:13,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:13,595 INFO ]: Computing forward predicates... [2018-06-22 10:59:13,989 INFO ]: Checked inductivity of 241 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 10:59:14,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:14,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-06-22 10:59:14,008 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:59:14,008 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:59:14,008 INFO ]: CoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:59:14,008 INFO ]: Start difference. First operand 118 states and 147 transitions. Second operand 42 states. [2018-06-22 10:59:14,632 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:14,632 INFO ]: Finished difference Result 162 states and 198 transitions. [2018-06-22 10:59:14,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:59:14,632 INFO ]: Start accepts. Automaton has 42 states. Word has length 81 [2018-06-22 10:59:14,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:14,633 INFO ]: With dead ends: 162 [2018-06-22 10:59:14,633 INFO ]: Without dead ends: 154 [2018-06-22 10:59:14,633 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=681, Invalid=3741, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 10:59:14,633 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-22 10:59:14,640 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 112. [2018-06-22 10:59:14,640 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 10:59:14,641 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2018-06-22 10:59:14,641 INFO ]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 81 [2018-06-22 10:59:14,641 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:14,641 INFO ]: Abstraction has 112 states and 141 transitions. [2018-06-22 10:59:14,641 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:59:14,641 INFO ]: Start isEmpty. Operand 112 states and 141 transitions. [2018-06-22 10:59:14,642 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:59:14,642 INFO ]: Found error trace [2018-06-22 10:59:14,642 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:14,642 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:14,642 INFO ]: Analyzing trace with hash -194284418, now seen corresponding path program 21 times [2018-06-22 10:59:14,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:14,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:14,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:14,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:14,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:14,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:15,316 WARN ]: Spent 458.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-06-22 10:59:15,534 INFO ]: Checked inductivity of 241 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 10:59:15,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:15,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:15,543 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 10:59:15,577 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 10:59:15,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:15,581 INFO ]: Computing forward predicates... [2018-06-22 10:59:17,008 INFO ]: Checked inductivity of 241 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 10:59:17,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 10:59:17,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-06-22 10:59:17,027 INFO ]: Interpolant automaton has 42 states [2018-06-22 10:59:17,027 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 10:59:17,027 INFO ]: CoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 10:59:17,028 INFO ]: Start difference. First operand 112 states and 141 transitions. Second operand 42 states. [2018-06-22 10:59:17,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 10:59:17,727 INFO ]: Finished difference Result 154 states and 189 transitions. [2018-06-22 10:59:17,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 10:59:17,728 INFO ]: Start accepts. Automaton has 42 states. Word has length 81 [2018-06-22 10:59:17,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 10:59:17,728 INFO ]: With dead ends: 154 [2018-06-22 10:59:17,728 INFO ]: Without dead ends: 134 [2018-06-22 10:59:17,729 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=729, Invalid=3693, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 10:59:17,729 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-22 10:59:17,734 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 112. [2018-06-22 10:59:17,734 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-22 10:59:17,735 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2018-06-22 10:59:17,735 INFO ]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 81 [2018-06-22 10:59:17,735 INFO ]: Finished accepts. word is rejected. [2018-06-22 10:59:17,735 INFO ]: Abstraction has 112 states and 141 transitions. [2018-06-22 10:59:17,735 INFO ]: Interpolant automaton has 42 states. [2018-06-22 10:59:17,735 INFO ]: Start isEmpty. Operand 112 states and 141 transitions. [2018-06-22 10:59:17,736 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 10:59:17,736 INFO ]: Found error trace [2018-06-22 10:59:17,736 INFO ]: trace histogram [10, 9, 9, 9, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 10:59:17,736 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 10:59:17,736 INFO ]: Analyzing trace with hash 2122275355, now seen corresponding path program 6 times [2018-06-22 10:59:17,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 10:59:17,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 10:59:17,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:17,737 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 10:59:17,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 10:59:17,745 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:18,321 INFO ]: Checked inductivity of 249 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-22 10:59:18,321 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 10:59:18,321 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:18,327 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 10:59:18,357 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 10:59:18,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 10:59:18,359 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-22 10:59:18,521 INFO ]: Timeout while computing interpolants [2018-06-22 10:59:18,722 WARN ]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 10:59:18,722 WARN ]: Verification canceled [2018-06-22 10:59:18,825 WARN ]: Timeout [2018-06-22 10:59:18,825 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:59:18 BoogieIcfgContainer [2018-06-22 10:59:18,825 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 10:59:18,826 INFO ]: Toolchain (without parser) took 56035.78 ms. Allocated memory was 307.2 MB in the beginning and 763.4 MB in the end (delta: 456.1 MB). Free memory was 263.6 MB in the beginning and 737.0 MB in the end (delta: -473.4 MB). Peak memory consumption was 337.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:18,826 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 10:59:18,826 INFO ]: ChcToBoogie took 48.00 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:18,827 INFO ]: Boogie Preprocessor took 37.99 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 260.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 10:59:18,827 INFO ]: RCFGBuilder took 413.23 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 251.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:18,827 INFO ]: TraceAbstraction took 55527.77 ms. Allocated memory was 307.2 MB in the beginning and 763.4 MB in the end (delta: 456.1 MB). Free memory was 251.6 MB in the beginning and 737.0 MB in the end (delta: -485.3 MB). Peak memory consumption was 325.6 MB. Max. memory is 3.6 GB. [2018-06-22 10:59:18,829 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 48.00 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.99 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 260.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 413.23 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 251.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55527.77 ms. Allocated memory was 307.2 MB in the beginning and 763.4 MB in the end (delta: 456.1 MB). Free memory was 251.6 MB in the beginning and 737.0 MB in the end (delta: -485.3 MB). Peak memory consumption was 325.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. TIMEOUT Result, 55.4s OverallTime, 48 OverallIterations, 12 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1634 SDtfs, 749 SDslu, 17861 SDs, 0 SdLazy, 14679 SolverSat, 893 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3810 GetRequests, 2159 SyntacticMatches, 179 SemanticMatches, 1472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10837 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=43, 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.3s AutomataMinimizationTime, 47 MinimizatonAttempts, 308 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 4793 NumberOfCodeBlocks, 4789 NumberOfCodeBlocksAsserted, 213 NumberOfCheckSat, 4700 ConstructedInterpolants, 0 QuantifiedInterpolants, 1078864 SizeOfPredicates, 459 NumberOfNonLiveVariables, 8128 ConjunctsInSsa, 1672 ConjunctsInUnsatCore, 93 InterpolantComputations, 4 PerfectInterpolantSequences, 5912/9698 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_10-59-18-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_10-59-18-843.csv Completed graceful shutdown