java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:23:59,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:23:59,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:23:59,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:23:59,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:23:59,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:23:59,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:23:59,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:23:59,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:23:59,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:23:59,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:23:59,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:23:59,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:23:59,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:23:59,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:23:59,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:23:59,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:23:59,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:23:59,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:23:59,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:23:59,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:23:59,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:23:59,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:23:59,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:23:59,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:23:59,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:23:59,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:23:59,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:23:59,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:23:59,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:23:59,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:23:59,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:23:59,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:23:59,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:23:59,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:23:59,309 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:23:59,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:23:59,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:23:59,337 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:23:59,337 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:23:59,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:23:59,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:23:59,339 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:23:59,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:23:59,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:23:59,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:23:59,340 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:23:59,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:23:59,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:23:59,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:23:59,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:23:59,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:23:59,345 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:23:59,346 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:23:59,346 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:23:59,403 INFO ]: Repository-Root is: /tmp [2018-06-22 01:23:59,420 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:23:59,424 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:23:59,426 INFO ]: Initializing SmtParser... [2018-06-22 01:23:59,426 INFO ]: SmtParser initialized [2018-06-22 01:23:59,426 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-22 01:23:59,428 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:23:59,518 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 unknown [2018-06-22 01:23:59,754 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-22 01:23:59,759 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:23:59,765 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:23:59,766 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:23:59,766 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:23:59,766 INFO ]: ChcToBoogie initialized [2018-06-22 01:23:59,768 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,825 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59 Unit [2018-06-22 01:23:59,825 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:23:59,825 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:23:59,825 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:23:59,826 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:23:59,846 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,846 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,853 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,853 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,868 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,870 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,872 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... [2018-06-22 01:23:59,873 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:23:59,883 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:23:59,883 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:23:59,883 INFO ]: RCFGBuilder initialized [2018-06-22 01:23:59,884 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:23:59,900 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:23:59,900 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:23:59,900 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:23:59,900 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:23:59,900 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:23:59,900 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:24:00,275 INFO ]: Using library mode [2018-06-22 01:24:00,275 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:00 BoogieIcfgContainer [2018-06-22 01:24:00,275 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:24:00,280 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:24:00,280 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:24:00,283 INFO ]: TraceAbstraction initialized [2018-06-22 01:24:00,284 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:23:59" (1/3) ... [2018-06-22 01:24:00,284 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8f2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:24:00, skipping insertion in model container [2018-06-22 01:24:00,284 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:23:59" (2/3) ... [2018-06-22 01:24:00,285 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc8f2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:24:00, skipping insertion in model container [2018-06-22 01:24:00,285 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:24:00" (3/3) ... [2018-06-22 01:24:00,287 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:24:00,298 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:24:00,310 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:24:00,347 INFO ]: Using default assertion order modulation [2018-06-22 01:24:00,348 INFO ]: Interprodecural is true [2018-06-22 01:24:00,348 INFO ]: Hoare is false [2018-06-22 01:24:00,348 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:24:00,348 INFO ]: Backedges is TWOTRACK [2018-06-22 01:24:00,348 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:24:00,348 INFO ]: Difference is false [2018-06-22 01:24:00,348 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:24:00,348 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:24:00,363 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 01:24:00,373 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:24:00,373 INFO ]: Found error trace [2018-06-22 01:24:00,374 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:00,374 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:00,378 INFO ]: Analyzing trace with hash -1869166318, now seen corresponding path program 1 times [2018-06-22 01:24:00,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:00,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:00,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:00,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:00,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:00,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:00,509 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:00,511 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:00,511 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:00,512 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:00,526 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:00,526 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:00,528 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 01:24:00,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:00,739 INFO ]: Finished difference Result 9 states and 29 transitions. [2018-06-22 01:24:00,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:00,743 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:24:00,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:00,750 INFO ]: With dead ends: 9 [2018-06-22 01:24:00,750 INFO ]: Without dead ends: 9 [2018-06-22 01:24:00,752 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:00,766 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:24:00,792 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:24:00,793 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:24:00,793 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-06-22 01:24:00,794 INFO ]: Start accepts. Automaton has 9 states and 29 transitions. Word has length 7 [2018-06-22 01:24:00,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:00,795 INFO ]: Abstraction has 9 states and 29 transitions. [2018-06-22 01:24:00,795 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:00,795 INFO ]: Start isEmpty. Operand 9 states and 29 transitions. [2018-06-22 01:24:00,795 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:00,795 INFO ]: Found error trace [2018-06-22 01:24:00,795 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:00,795 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:00,796 INFO ]: Analyzing trace with hash -2096657307, now seen corresponding path program 1 times [2018-06-22 01:24:00,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:00,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:00,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:00,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:00,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:00,809 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:00,843 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:00,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:00,844 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:00,845 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:00,845 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:00,845 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:00,845 INFO ]: Start difference. First operand 9 states and 29 transitions. Second operand 3 states. [2018-06-22 01:24:00,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:00,989 INFO ]: Finished difference Result 11 states and 47 transitions. [2018-06-22 01:24:00,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:00,989 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:24:00,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:00,990 INFO ]: With dead ends: 11 [2018-06-22 01:24:00,990 INFO ]: Without dead ends: 11 [2018-06-22 01:24:00,990 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:00,990 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:24:00,992 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-22 01:24:00,992 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:24:00,993 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2018-06-22 01:24:00,993 INFO ]: Start accepts. Automaton has 10 states and 38 transitions. Word has length 8 [2018-06-22 01:24:00,993 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:00,993 INFO ]: Abstraction has 10 states and 38 transitions. [2018-06-22 01:24:00,993 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:00,993 INFO ]: Start isEmpty. Operand 10 states and 38 transitions. [2018-06-22 01:24:00,994 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:00,994 INFO ]: Found error trace [2018-06-22 01:24:00,994 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:00,994 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:00,994 INFO ]: Analyzing trace with hash -2107739559, now seen corresponding path program 1 times [2018-06-22 01:24:00,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:00,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:00,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:00,995 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:00,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:01,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:01,125 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:01,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:01,125 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) [2018-06-22 01:24:01,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:24:01,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:01,195 INFO ]: Computing forward predicates... [2018-06-22 01:24:01,252 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:01,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:01,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:24:01,271 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:24:01,271 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:24:01,271 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:24:01,271 INFO ]: Start difference. First operand 10 states and 38 transitions. Second operand 4 states. [2018-06-22 01:24:01,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:01,455 INFO ]: Finished difference Result 14 states and 78 transitions. [2018-06-22 01:24:01,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:24:01,456 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:24:01,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:01,456 INFO ]: With dead ends: 14 [2018-06-22 01:24:01,456 INFO ]: Without dead ends: 14 [2018-06-22 01:24:01,457 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:24:01,457 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:24:01,459 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-22 01:24:01,459 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:24:01,459 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-06-22 01:24:01,460 INFO ]: Start accepts. Automaton has 12 states and 60 transitions. Word has length 8 [2018-06-22 01:24:01,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:01,460 INFO ]: Abstraction has 12 states and 60 transitions. [2018-06-22 01:24:01,460 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:24:01,460 INFO ]: Start isEmpty. Operand 12 states and 60 transitions. [2018-06-22 01:24:01,460 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:01,460 INFO ]: Found error trace [2018-06-22 01:24:01,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:01,460 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:01,460 INFO ]: Analyzing trace with hash -2104045475, now seen corresponding path program 1 times [2018-06-22 01:24:01,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:01,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:01,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:01,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:01,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:01,480 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:01,506 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:01,506 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:01,506 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:01,507 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:01,507 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:01,507 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:01,507 INFO ]: Start difference. First operand 12 states and 60 transitions. Second operand 3 states. [2018-06-22 01:24:01,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:01,808 INFO ]: Finished difference Result 14 states and 74 transitions. [2018-06-22 01:24:01,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:01,808 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:24:01,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:01,809 INFO ]: With dead ends: 14 [2018-06-22 01:24:01,809 INFO ]: Without dead ends: 14 [2018-06-22 01:24:01,809 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:01,809 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:24:01,811 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-22 01:24:01,811 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:24:01,812 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2018-06-22 01:24:01,812 INFO ]: Start accepts. Automaton has 14 states and 74 transitions. Word has length 8 [2018-06-22 01:24:01,812 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:01,812 INFO ]: Abstraction has 14 states and 74 transitions. [2018-06-22 01:24:01,812 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:01,812 INFO ]: Start isEmpty. Operand 14 states and 74 transitions. [2018-06-22 01:24:01,813 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:01,813 INFO ]: Found error trace [2018-06-22 01:24:01,813 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:01,813 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:01,813 INFO ]: Analyzing trace with hash -2117898290, now seen corresponding path program 1 times [2018-06-22 01:24:01,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:01,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:01,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:01,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:01,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:01,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:01,857 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:01,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:01,857 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 01:24:01,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:01,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:01,888 INFO ]: Computing forward predicates... [2018-06-22 01:24:02,058 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:02,077 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:02,078 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:24:02,097 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:24:02,098 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:24:02,098 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:24:02,098 INFO ]: Start difference. First operand 14 states and 74 transitions. Second operand 5 states. [2018-06-22 01:24:02,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:02,820 INFO ]: Finished difference Result 29 states and 174 transitions. [2018-06-22 01:24:02,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:24:02,821 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:24:02,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:02,823 INFO ]: With dead ends: 29 [2018-06-22 01:24:02,823 INFO ]: Without dead ends: 29 [2018-06-22 01:24:02,824 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:02,824 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:24:02,828 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 01:24:02,828 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:24:02,829 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 126 transitions. [2018-06-22 01:24:02,829 INFO ]: Start accepts. Automaton has 21 states and 126 transitions. Word has length 8 [2018-06-22 01:24:02,829 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:02,829 INFO ]: Abstraction has 21 states and 126 transitions. [2018-06-22 01:24:02,829 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:24:02,829 INFO ]: Start isEmpty. Operand 21 states and 126 transitions. [2018-06-22 01:24:02,829 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:24:02,829 INFO ]: Found error trace [2018-06-22 01:24:02,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:02,829 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:02,830 INFO ]: Analyzing trace with hash -2114204206, now seen corresponding path program 1 times [2018-06-22 01:24:02,830 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:02,830 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:02,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:02,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:02,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:02,838 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:02,873 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:02,873 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:02,873 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 01:24:02,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:02,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:02,894 INFO ]: Computing forward predicates... [2018-06-22 01:24:02,920 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:02,943 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:02,943 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:24:02,943 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:24:02,943 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:24:02,943 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:24:02,944 INFO ]: Start difference. First operand 21 states and 126 transitions. Second operand 5 states. [2018-06-22 01:24:03,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:03,086 INFO ]: Finished difference Result 33 states and 205 transitions. [2018-06-22 01:24:03,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:24:03,086 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:24:03,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:03,088 INFO ]: With dead ends: 33 [2018-06-22 01:24:03,088 INFO ]: Without dead ends: 33 [2018-06-22 01:24:03,088 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:03,088 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:24:03,092 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-06-22 01:24:03,093 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:24:03,094 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 176 transitions. [2018-06-22 01:24:03,094 INFO ]: Start accepts. Automaton has 28 states and 176 transitions. Word has length 8 [2018-06-22 01:24:03,094 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:03,094 INFO ]: Abstraction has 28 states and 176 transitions. [2018-06-22 01:24:03,094 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:24:03,094 INFO ]: Start isEmpty. Operand 28 states and 176 transitions. [2018-06-22 01:24:03,096 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:03,096 INFO ]: Found error trace [2018-06-22 01:24:03,096 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:03,096 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:03,096 INFO ]: Analyzing trace with hash -913575438, now seen corresponding path program 2 times [2018-06-22 01:24:03,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:03,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:03,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:03,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:03,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:03,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:03,247 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:03,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:03,247 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) [2018-06-22 01:24:03,264 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:24:03,284 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:03,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:03,285 INFO ]: Computing forward predicates... [2018-06-22 01:24:03,314 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:03,340 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:24:03,340 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-22 01:24:03,341 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:24:03,341 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:24:03,341 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:24:03,341 INFO ]: Start difference. First operand 28 states and 176 transitions. Second operand 6 states. [2018-06-22 01:24:03,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:03,488 INFO ]: Finished difference Result 28 states and 132 transitions. [2018-06-22 01:24:03,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:24:03,488 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-22 01:24:03,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:03,489 INFO ]: With dead ends: 28 [2018-06-22 01:24:03,489 INFO ]: Without dead ends: 28 [2018-06-22 01:24:03,489 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:24:03,490 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:24:03,493 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-06-22 01:24:03,493 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:24:03,494 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 106 transitions. [2018-06-22 01:24:03,494 INFO ]: Start accepts. Automaton has 23 states and 106 transitions. Word has length 9 [2018-06-22 01:24:03,494 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:03,494 INFO ]: Abstraction has 23 states and 106 transitions. [2018-06-22 01:24:03,494 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:24:03,494 INFO ]: Start isEmpty. Operand 23 states and 106 transitions. [2018-06-22 01:24:03,495 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:03,495 INFO ]: Found error trace [2018-06-22 01:24:03,495 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:03,495 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:03,495 INFO ]: Analyzing trace with hash -906187270, now seen corresponding path program 1 times [2018-06-22 01:24:03,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:03,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:03,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:03,496 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:03,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:03,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:03,623 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:03,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:03,623 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 01:24:03,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:03,652 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:03,654 INFO ]: Computing forward predicates... [2018-06-22 01:24:03,985 WARN ]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:03,990 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:04,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:04,009 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:24:04,009 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:24:04,009 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:24:04,009 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:04,009 INFO ]: Start difference. First operand 23 states and 106 transitions. Second operand 7 states. [2018-06-22 01:24:04,654 WARN ]: Spent 546.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-06-22 01:24:05,193 WARN ]: Spent 501.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-06-22 01:24:05,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:05,419 INFO ]: Finished difference Result 41 states and 164 transitions. [2018-06-22 01:24:05,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:24:05,419 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:24:05,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:05,420 INFO ]: With dead ends: 41 [2018-06-22 01:24:05,420 INFO ]: Without dead ends: 41 [2018-06-22 01:24:05,420 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:05,421 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 01:24:05,426 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-06-22 01:24:05,426 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:24:05,427 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 139 transitions. [2018-06-22 01:24:05,427 INFO ]: Start accepts. Automaton has 31 states and 139 transitions. Word has length 9 [2018-06-22 01:24:05,427 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:05,427 INFO ]: Abstraction has 31 states and 139 transitions. [2018-06-22 01:24:05,427 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:24:05,427 INFO ]: Start isEmpty. Operand 31 states and 139 transitions. [2018-06-22 01:24:05,429 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:05,429 INFO ]: Found error trace [2018-06-22 01:24:05,429 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:05,429 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:05,429 INFO ]: Analyzing trace with hash -1353171434, now seen corresponding path program 1 times [2018-06-22 01:24:05,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:05,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:05,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:05,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:05,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:05,447 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:05,479 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:05,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:05,479 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 01:24:05,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:05,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:05,497 INFO ]: Computing forward predicates... [2018-06-22 01:24:05,522 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:05,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:05,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:24:05,541 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:24:05,541 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:24:05,541 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:24:05,541 INFO ]: Start difference. First operand 31 states and 139 transitions. Second operand 6 states. [2018-06-22 01:24:05,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:05,674 INFO ]: Finished difference Result 42 states and 173 transitions. [2018-06-22 01:24:05,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:24:05,675 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-22 01:24:05,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:05,675 INFO ]: With dead ends: 42 [2018-06-22 01:24:05,676 INFO ]: Without dead ends: 42 [2018-06-22 01:24:05,676 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:05,676 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:24:05,679 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-06-22 01:24:05,679 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:24:05,680 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 145 transitions. [2018-06-22 01:24:05,681 INFO ]: Start accepts. Automaton has 33 states and 145 transitions. Word has length 9 [2018-06-22 01:24:05,681 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:05,681 INFO ]: Abstraction has 33 states and 145 transitions. [2018-06-22 01:24:05,681 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:24:05,681 INFO ]: Start isEmpty. Operand 33 states and 145 transitions. [2018-06-22 01:24:05,681 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:05,681 INFO ]: Found error trace [2018-06-22 01:24:05,681 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:05,681 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:05,682 INFO ]: Analyzing trace with hash -1349477350, now seen corresponding path program 1 times [2018-06-22 01:24:05,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:05,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:05,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:05,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:05,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:05,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:05,729 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:05,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:05,729 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 01:24:05,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:05,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:05,756 INFO ]: Computing forward predicates... [2018-06-22 01:24:05,767 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:05,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:05,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-22 01:24:05,791 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:24:05,792 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:24:05,792 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:24:05,792 INFO ]: Start difference. First operand 33 states and 145 transitions. Second operand 6 states. [2018-06-22 01:24:06,248 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:06,248 INFO ]: Finished difference Result 47 states and 218 transitions. [2018-06-22 01:24:06,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:24:06,248 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-22 01:24:06,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:06,249 INFO ]: With dead ends: 47 [2018-06-22 01:24:06,249 INFO ]: Without dead ends: 47 [2018-06-22 01:24:06,249 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:06,249 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:24:06,254 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 35. [2018-06-22 01:24:06,254 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:24:06,255 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2018-06-22 01:24:06,255 INFO ]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 9 [2018-06-22 01:24:06,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:06,255 INFO ]: Abstraction has 35 states and 155 transitions. [2018-06-22 01:24:06,255 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:24:06,255 INFO ]: Start isEmpty. Operand 35 states and 155 transitions. [2018-06-22 01:24:06,256 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:06,256 INFO ]: Found error trace [2018-06-22 01:24:06,256 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:06,256 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:06,256 INFO ]: Analyzing trace with hash -340992418, now seen corresponding path program 1 times [2018-06-22 01:24:06,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:06,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:06,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:06,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,268 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:06,289 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:06,289 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:06,289 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:06,289 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:06,289 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:06,289 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:06,289 INFO ]: Start difference. First operand 35 states and 155 transitions. Second operand 3 states. [2018-06-22 01:24:06,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:06,343 INFO ]: Finished difference Result 39 states and 155 transitions. [2018-06-22 01:24:06,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:06,344 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:06,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:06,344 INFO ]: With dead ends: 39 [2018-06-22 01:24:06,344 INFO ]: Without dead ends: 39 [2018-06-22 01:24:06,345 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:06,345 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:24:06,348 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-06-22 01:24:06,348 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:24:06,349 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 146 transitions. [2018-06-22 01:24:06,349 INFO ]: Start accepts. Automaton has 36 states and 146 transitions. Word has length 9 [2018-06-22 01:24:06,349 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:06,349 INFO ]: Abstraction has 36 states and 146 transitions. [2018-06-22 01:24:06,349 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:06,349 INFO ]: Start isEmpty. Operand 36 states and 146 transitions. [2018-06-22 01:24:06,349 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:24:06,349 INFO ]: Found error trace [2018-06-22 01:24:06,349 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:06,349 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:06,350 INFO ]: Analyzing trace with hash -169217512, now seen corresponding path program 1 times [2018-06-22 01:24:06,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:06,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:06,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:06,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:06,379 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:06,379 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:24:06,379 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:24:06,379 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:24:06,379 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:24:06,379 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:06,380 INFO ]: Start difference. First operand 36 states and 146 transitions. Second operand 3 states. [2018-06-22 01:24:06,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:06,399 INFO ]: Finished difference Result 30 states and 56 transitions. [2018-06-22 01:24:06,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:24:06,400 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:24:06,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:06,400 INFO ]: With dead ends: 30 [2018-06-22 01:24:06,400 INFO ]: Without dead ends: 15 [2018-06-22 01:24:06,401 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:24:06,401 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:06,402 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:24:06,402 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:24:06,402 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-22 01:24:06,402 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-22 01:24:06,402 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:06,402 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-22 01:24:06,402 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:24:06,402 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-22 01:24:06,402 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:24:06,402 INFO ]: Found error trace [2018-06-22 01:24:06,402 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:06,402 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:06,403 INFO ]: Analyzing trace with hash 1325508786, now seen corresponding path program 1 times [2018-06-22 01:24:06,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:06,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:06,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,403 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:06,403 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,415 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:06,506 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:06,506 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:06,506 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 01:24:06,512 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:06,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:06,541 INFO ]: Computing forward predicates... [2018-06-22 01:24:06,659 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:06,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:06,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 01:24:06,680 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:24:06,680 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:24:06,680 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:24:06,681 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 8 states. [2018-06-22 01:24:06,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:06,725 INFO ]: Finished difference Result 17 states and 28 transitions. [2018-06-22 01:24:06,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:24:06,726 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:24:06,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:06,726 INFO ]: With dead ends: 17 [2018-06-22 01:24:06,726 INFO ]: Without dead ends: 13 [2018-06-22 01:24:06,726 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:24:06,726 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:24:06,727 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-22 01:24:06,727 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:24:06,727 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-22 01:24:06,727 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2018-06-22 01:24:06,727 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:06,727 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-22 01:24:06,727 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:24:06,727 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-22 01:24:06,728 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:24:06,728 INFO ]: Found error trace [2018-06-22 01:24:06,728 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:06,728 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:06,728 INFO ]: Analyzing trace with hash 878524622, now seen corresponding path program 2 times [2018-06-22 01:24:06,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:06,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:06,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:06,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:06,786 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:06,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:06,786 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 01:24:06,792 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:06,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:06,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:06,837 INFO ]: Computing forward predicates... [2018-06-22 01:24:06,865 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:06,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:06,885 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:24:06,885 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:24:06,885 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:24:06,885 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:06,885 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-06-22 01:24:06,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:06,958 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-22 01:24:06,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:24:06,958 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 01:24:06,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:06,958 INFO ]: With dead ends: 14 [2018-06-22 01:24:06,958 INFO ]: Without dead ends: 14 [2018-06-22 01:24:06,959 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:24:06,959 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:24:06,960 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-22 01:24:06,960 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:24:06,960 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-22 01:24:06,960 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-22 01:24:06,960 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:06,960 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-22 01:24:06,960 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:24:06,960 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-22 01:24:06,961 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:24:06,961 INFO ]: Found error trace [2018-06-22 01:24:06,961 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:06,961 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:06,961 INFO ]: Analyzing trace with hash 882218706, now seen corresponding path program 2 times [2018-06-22 01:24:06,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:06,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:06,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:06,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:06,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,020 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:07,020 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 01:24:07,027 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:07,063 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:07,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,064 INFO ]: Computing forward predicates... [2018-06-22 01:24:07,144 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,164 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:24:07,171 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-22 01:24:07,171 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:24:07,171 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:24:07,171 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:24:07,171 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 6 states. [2018-06-22 01:24:07,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:07,196 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-22 01:24:07,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:24:07,196 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:24:07,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:07,196 INFO ]: With dead ends: 15 [2018-06-22 01:24:07,196 INFO ]: Without dead ends: 15 [2018-06-22 01:24:07,197 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:24:07,197 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:07,198 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:24:07,198 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:24:07,198 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-22 01:24:07,198 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-22 01:24:07,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:07,198 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-22 01:24:07,198 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:24:07,198 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-22 01:24:07,198 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:24:07,198 INFO ]: Found error trace [2018-06-22 01:24:07,198 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:07,198 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:07,198 INFO ]: Analyzing trace with hash 1788609786, now seen corresponding path program 2 times [2018-06-22 01:24:07,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:07,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:07,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,199 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:07,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,265 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:07,265 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 01:24:07,271 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:07,300 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:07,300 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,302 INFO ]: Computing forward predicates... [2018-06-22 01:24:07,423 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:07,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:24:07,454 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:24:07,454 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:24:07,454 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:24:07,454 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 9 states. [2018-06-22 01:24:07,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:07,533 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-22 01:24:07,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:24:07,533 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-22 01:24:07,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:07,533 INFO ]: With dead ends: 16 [2018-06-22 01:24:07,533 INFO ]: Without dead ends: 13 [2018-06-22 01:24:07,534 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:07,534 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:24:07,534 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 01:24:07,534 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:24:07,535 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-22 01:24:07,535 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-22 01:24:07,535 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:07,535 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-22 01:24:07,535 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:24:07,535 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-22 01:24:07,535 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:24:07,535 INFO ]: Found error trace [2018-06-22 01:24:07,535 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:07,535 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:07,535 INFO ]: Analyzing trace with hash 1341625622, now seen corresponding path program 3 times [2018-06-22 01:24:07,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:07,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:07,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:07,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,572 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:07,572 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 01:24:07,577 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:07,606 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:24:07,606 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,608 INFO ]: Computing forward predicates... [2018-06-22 01:24:07,650 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,672 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:24:07,672 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-22 01:24:07,673 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:24:07,673 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:24:07,673 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:07,673 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 7 states. [2018-06-22 01:24:07,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:07,704 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-22 01:24:07,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:24:07,704 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:24:07,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:07,705 INFO ]: With dead ends: 15 [2018-06-22 01:24:07,705 INFO ]: Without dead ends: 15 [2018-06-22 01:24:07,705 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:24:07,705 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:07,706 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-22 01:24:07,706 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:24:07,706 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-22 01:24:07,706 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-22 01:24:07,706 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:07,706 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-22 01:24:07,706 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:24:07,706 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-22 01:24:07,706 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:24:07,706 INFO ]: Found error trace [2018-06-22 01:24:07,706 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:07,707 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:07,707 INFO ]: Analyzing trace with hash 1903126390, now seen corresponding path program 1 times [2018-06-22 01:24:07,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:07,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:07,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,707 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:07,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,798 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:07,799 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 01:24:07,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:07,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:07,821 INFO ]: Computing forward predicates... [2018-06-22 01:24:07,836 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:07,855 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:07,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:24:07,855 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:24:07,855 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:24:07,855 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:24:07,855 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 7 states. [2018-06-22 01:24:07,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:07,922 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-22 01:24:07,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:24:07,922 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:24:07,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:07,922 INFO ]: With dead ends: 15 [2018-06-22 01:24:07,922 INFO ]: Without dead ends: 15 [2018-06-22 01:24:07,923 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:24:07,923 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:07,923 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 01:24:07,923 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 01:24:07,924 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-22 01:24:07,924 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-06-22 01:24:07,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:07,924 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-22 01:24:07,924 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:24:07,924 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-22 01:24:07,924 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:24:07,924 INFO ]: Found error trace [2018-06-22 01:24:07,924 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:07,924 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:07,924 INFO ]: Analyzing trace with hash -1035128398, now seen corresponding path program 3 times [2018-06-22 01:24:07,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:07,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:07,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:07,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:07,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:08,023 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:08,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:08,023 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 01:24:08,029 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:08,047 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:24:08,047 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:08,049 INFO ]: Computing forward predicates... [2018-06-22 01:24:08,074 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:08,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:08,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 01:24:08,104 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:24:08,104 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:24:08,104 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:24:08,104 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 9 states. [2018-06-22 01:24:08,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:08,162 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-22 01:24:08,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:24:08,162 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:24:08,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:08,162 INFO ]: With dead ends: 19 [2018-06-22 01:24:08,162 INFO ]: Without dead ends: 19 [2018-06-22 01:24:08,163 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:08,163 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:08,164 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 01:24:08,164 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:08,164 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-22 01:24:08,164 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 12 [2018-06-22 01:24:08,164 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:08,164 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-22 01:24:08,164 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:24:08,164 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-22 01:24:08,164 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:24:08,164 INFO ]: Found error trace [2018-06-22 01:24:08,164 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:08,164 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:08,164 INFO ]: Analyzing trace with hash -920611794, now seen corresponding path program 2 times [2018-06-22 01:24:08,164 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:08,164 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:08,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:08,165 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:08,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:08,174 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:08,362 INFO ]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:08,362 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:08,362 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 01:24:08,369 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:08,387 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:08,388 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:08,389 INFO ]: Computing forward predicates... [2018-06-22 01:24:08,517 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:08,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:08,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:24:08,536 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:24:08,536 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:24:08,536 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:24:08,536 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 9 states. [2018-06-22 01:24:08,604 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:08,604 INFO ]: Finished difference Result 18 states and 27 transitions. [2018-06-22 01:24:08,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:24:08,605 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-22 01:24:08,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:08,605 INFO ]: With dead ends: 18 [2018-06-22 01:24:08,605 INFO ]: Without dead ends: 18 [2018-06-22 01:24:08,605 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:08,605 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:24:08,606 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-22 01:24:08,606 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:08,607 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-22 01:24:08,607 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 12 [2018-06-22 01:24:08,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:08,607 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-22 01:24:08,607 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:24:08,607 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-22 01:24:08,607 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:24:08,607 INFO ]: Found error trace [2018-06-22 01:24:08,607 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:08,607 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:08,607 INFO ]: Analyzing trace with hash -1350049059, now seen corresponding path program 1 times [2018-06-22 01:24:08,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:08,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:08,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:08,608 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:08,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:08,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:09,203 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:09,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:09,203 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) [2018-06-22 01:24:09,218 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:24:09,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:09,255 INFO ]: Computing forward predicates... [2018-06-22 01:24:09,422 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:09,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:09,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:24:09,441 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:24:09,441 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:24:09,441 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:09,441 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 10 states. [2018-06-22 01:24:09,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:09,492 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-22 01:24:09,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:24:09,492 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-22 01:24:09,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:09,492 INFO ]: With dead ends: 19 [2018-06-22 01:24:09,492 INFO ]: Without dead ends: 15 [2018-06-22 01:24:09,493 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:09,493 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:09,494 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:24:09,494 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:09,494 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 01:24:09,494 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 12 [2018-06-22 01:24:09,494 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:09,494 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 01:24:09,494 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:24:09,494 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 01:24:09,495 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:24:09,495 INFO ]: Found error trace [2018-06-22 01:24:09,495 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:09,495 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:09,495 INFO ]: Analyzing trace with hash -1235532455, now seen corresponding path program 1 times [2018-06-22 01:24:09,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:09,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:09,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:09,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:09,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:09,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:09,665 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:09,665 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:09,665 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 01:24:09,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:09,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:09,690 INFO ]: Computing forward predicates... [2018-06-22 01:24:10,549 WARN ]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:24:10,552 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:10,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:10,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:24:10,571 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:24:10,571 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:24:10,571 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:10,571 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 10 states. [2018-06-22 01:24:10,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:10,613 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-22 01:24:10,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:24:10,614 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-22 01:24:10,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:10,614 INFO ]: With dead ends: 18 [2018-06-22 01:24:10,614 INFO ]: Without dead ends: 15 [2018-06-22 01:24:10,615 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:10,615 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:24:10,615 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 01:24:10,615 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:10,615 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-22 01:24:10,615 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 12 [2018-06-22 01:24:10,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:10,616 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-22 01:24:10,616 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:24:10,616 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-22 01:24:10,616 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:24:10,616 INFO ]: Found error trace [2018-06-22 01:24:10,616 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:10,616 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:10,616 INFO ]: Analyzing trace with hash -2014979647, now seen corresponding path program 4 times [2018-06-22 01:24:10,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:10,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:10,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:10,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:10,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:10,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:11,357 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:11,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:11,358 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) [2018-06-22 01:24:11,371 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:24:11,425 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:24:11,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:11,427 INFO ]: Computing forward predicates... [2018-06-22 01:24:11,984 WARN ]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:12,799 WARN ]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:12,802 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:12,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:12,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-22 01:24:12,822 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:24:12,822 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:24:12,822 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:12,822 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 12 states. [2018-06-22 01:24:13,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:13,812 INFO ]: Finished difference Result 22 states and 32 transitions. [2018-06-22 01:24:13,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:24:13,812 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-22 01:24:13,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:13,812 INFO ]: With dead ends: 22 [2018-06-22 01:24:13,812 INFO ]: Without dead ends: 16 [2018-06-22 01:24:13,813 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:24:13,813 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:24:13,814 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-22 01:24:13,814 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:13,814 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-22 01:24:13,814 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 13 [2018-06-22 01:24:13,814 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:13,814 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-22 01:24:13,814 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:24:13,814 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-22 01:24:13,814 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:24:13,814 INFO ]: Found error trace [2018-06-22 01:24:13,814 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:13,815 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:13,815 INFO ]: Analyzing trace with hash 1623301114, now seen corresponding path program 5 times [2018-06-22 01:24:13,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:13,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:13,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:13,815 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:13,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:13,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:13,902 INFO ]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:13,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:13,902 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 01:24:13,910 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:24:13,932 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:24:13,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:13,933 INFO ]: Computing forward predicates... [2018-06-22 01:24:13,986 INFO ]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:14,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:14,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:24:14,006 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:24:14,006 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:24:14,006 INFO ]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:14,006 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 10 states. [2018-06-22 01:24:14,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:14,143 INFO ]: Finished difference Result 18 states and 22 transitions. [2018-06-22 01:24:14,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:24:14,143 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:24:14,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:14,144 INFO ]: With dead ends: 18 [2018-06-22 01:24:14,144 INFO ]: Without dead ends: 18 [2018-06-22 01:24:14,144 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:14,144 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:24:14,145 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-22 01:24:14,145 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 01:24:14,145 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-22 01:24:14,145 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 13 [2018-06-22 01:24:14,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:14,145 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-22 01:24:14,145 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:24:14,145 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-22 01:24:14,145 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:24:14,145 INFO ]: Found error trace [2018-06-22 01:24:14,145 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:14,145 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:14,146 INFO ]: Analyzing trace with hash 1308380453, now seen corresponding path program 2 times [2018-06-22 01:24:14,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:14,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:14,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:14,146 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:14,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:14,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:14,205 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:14,205 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:14,205 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 01:24:14,210 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:14,240 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:14,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:14,241 INFO ]: Computing forward predicates... [2018-06-22 01:24:14,658 WARN ]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:24:14,660 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:14,682 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:14,682 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:24:14,682 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:14,682 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:14,682 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:14,682 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 11 states. [2018-06-22 01:24:15,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:15,313 INFO ]: Finished difference Result 20 states and 28 transitions. [2018-06-22 01:24:15,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:24:15,313 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-22 01:24:15,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:15,314 INFO ]: With dead ends: 20 [2018-06-22 01:24:15,314 INFO ]: Without dead ends: 16 [2018-06-22 01:24:15,314 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:15,314 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:24:15,315 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-22 01:24:15,315 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:15,315 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-22 01:24:15,315 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 13 [2018-06-22 01:24:15,315 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:15,315 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-22 01:24:15,315 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:15,315 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-22 01:24:15,315 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:24:15,315 INFO ]: Found error trace [2018-06-22 01:24:15,316 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:15,316 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:15,316 INFO ]: Analyzing trace with hash 1422897057, now seen corresponding path program 2 times [2018-06-22 01:24:15,316 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:15,316 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:15,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:15,316 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:15,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:15,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:15,476 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:15,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:15,476 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 01:24:15,482 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:15,501 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:15,501 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:15,503 INFO ]: Computing forward predicates... [2018-06-22 01:24:15,606 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:15,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:15,625 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-22 01:24:15,625 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:24:15,625 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:24:15,625 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:24:15,625 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2018-06-22 01:24:15,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:15,751 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-22 01:24:15,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:24:15,751 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 01:24:15,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:15,751 INFO ]: With dead ends: 18 [2018-06-22 01:24:15,751 INFO ]: Without dead ends: 18 [2018-06-22 01:24:15,751 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:15,751 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 01:24:15,752 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-22 01:24:15,752 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:15,753 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-22 01:24:15,753 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 13 [2018-06-22 01:24:15,753 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:15,753 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-22 01:24:15,753 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:24:15,753 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-22 01:24:15,753 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:24:15,753 INFO ]: Found error trace [2018-06-22 01:24:15,753 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:15,753 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:15,753 INFO ]: Analyzing trace with hash -1208043399, now seen corresponding path program 6 times [2018-06-22 01:24:15,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:15,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:15,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:15,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:15,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:15,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:15,822 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:15,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:15,822 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 01:24:15,827 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:24:15,850 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:24:15,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:15,852 INFO ]: Computing forward predicates... [2018-06-22 01:24:16,302 WARN ]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:16,701 WARN ]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:16,706 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:16,725 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:16,725 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 01:24:16,725 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:24:16,725 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:24:16,725 INFO ]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:24:16,725 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 13 states. [2018-06-22 01:24:17,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:17,338 INFO ]: Finished difference Result 23 states and 34 transitions. [2018-06-22 01:24:17,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:24:17,338 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-22 01:24:17,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:17,338 INFO ]: With dead ends: 23 [2018-06-22 01:24:17,338 INFO ]: Without dead ends: 17 [2018-06-22 01:24:17,338 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:24:17,338 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:24:17,339 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-22 01:24:17,339 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 01:24:17,339 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 01:24:17,339 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 14 [2018-06-22 01:24:17,339 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:17,339 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 01:24:17,339 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:24:17,339 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 01:24:17,340 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:24:17,340 INFO ]: Found error trace [2018-06-22 01:24:17,340 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:17,340 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:17,340 INFO ]: Analyzing trace with hash 2115316701, now seen corresponding path program 3 times [2018-06-22 01:24:17,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:17,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:17,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:17,340 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:17,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:17,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:17,783 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:17,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:17,783 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 01:24:17,789 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:17,812 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:24:17,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:17,813 INFO ]: Computing forward predicates... [2018-06-22 01:24:17,862 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:17,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:17,881 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-22 01:24:17,881 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:17,881 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:17,882 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:17,882 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 11 states. [2018-06-22 01:24:17,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:17,966 INFO ]: Finished difference Result 19 states and 27 transitions. [2018-06-22 01:24:17,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:24:17,967 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:24:17,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:17,967 INFO ]: With dead ends: 19 [2018-06-22 01:24:17,967 INFO ]: Without dead ends: 19 [2018-06-22 01:24:17,967 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:17,967 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:17,968 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 01:24:17,968 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:17,969 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 01:24:17,969 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 14 [2018-06-22 01:24:17,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:17,969 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 01:24:17,969 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:17,969 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 01:24:17,969 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:24:17,969 INFO ]: Found error trace [2018-06-22 01:24:17,969 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:17,969 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:17,969 INFO ]: Analyzing trace with hash -2065133991, now seen corresponding path program 3 times [2018-06-22 01:24:17,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:17,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:17,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:17,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:17,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:17,982 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:18,535 INFO ]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:18,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:18,536 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 01:24:18,541 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:18,565 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:24:18,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:18,566 INFO ]: Computing forward predicates... [2018-06-22 01:24:18,684 INFO ]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:18,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:18,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 01:24:18,704 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:18,705 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:18,705 INFO ]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:18,705 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 11 states. [2018-06-22 01:24:18,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:18,775 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-22 01:24:18,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:24:18,776 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-22 01:24:18,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:18,776 INFO ]: With dead ends: 22 [2018-06-22 01:24:18,776 INFO ]: Without dead ends: 22 [2018-06-22 01:24:18,776 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:18,776 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:24:18,778 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-06-22 01:24:18,778 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:18,779 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-22 01:24:18,779 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 14 [2018-06-22 01:24:18,779 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:18,779 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-22 01:24:18,779 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:18,779 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-22 01:24:18,779 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:24:18,779 INFO ]: Found error trace [2018-06-22 01:24:18,779 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:18,779 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:18,779 INFO ]: Analyzing trace with hash -1962823487, now seen corresponding path program 7 times [2018-06-22 01:24:18,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:18,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:18,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:18,780 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:18,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:18,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:19,454 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:19,455 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:19,455 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:24:19,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:24:19,496 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:19,497 INFO ]: Computing forward predicates... [2018-06-22 01:24:20,020 WARN ]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:20,899 WARN ]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:20,917 INFO ]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:20,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:20,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 01:24:20,948 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:24:20,948 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:24:20,948 INFO ]: CoverageRelationStatistics Valid=46, Invalid=135, Unknown=1, NotChecked=0, Total=182 [2018-06-22 01:24:20,948 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 14 states. [2018-06-22 01:24:21,927 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-06-22 01:24:21,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:21,973 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-22 01:24:21,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:24:21,973 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-22 01:24:21,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:21,973 INFO ]: With dead ends: 21 [2018-06-22 01:24:21,973 INFO ]: Without dead ends: 17 [2018-06-22 01:24:21,974 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=52, Invalid=157, Unknown=1, NotChecked=0, Total=210 [2018-06-22 01:24:21,974 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:24:21,975 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:24:21,975 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:21,975 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-22 01:24:21,975 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 15 [2018-06-22 01:24:21,975 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:21,975 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-22 01:24:21,975 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:24:21,975 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-22 01:24:21,975 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:24:21,975 INFO ]: Found error trace [2018-06-22 01:24:21,975 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:21,976 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:21,976 INFO ]: Analyzing trace with hash 1360536613, now seen corresponding path program 4 times [2018-06-22 01:24:21,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:21,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:21,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:21,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:21,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:21,988 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:22,056 INFO ]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:22,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:22,056 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 01:24:22,064 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:24:22,088 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:24:22,088 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:22,089 INFO ]: Computing forward predicates... [2018-06-22 01:24:22,164 INFO ]: Checked inductivity of 36 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:22,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:22,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-22 01:24:22,183 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:24:22,183 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:24:22,183 INFO ]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:22,183 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 12 states. [2018-06-22 01:24:22,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:22,238 INFO ]: Finished difference Result 21 states and 26 transitions. [2018-06-22 01:24:22,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:24:22,240 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-22 01:24:22,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:22,240 INFO ]: With dead ends: 21 [2018-06-22 01:24:22,240 INFO ]: Without dead ends: 21 [2018-06-22 01:24:22,240 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:24:22,241 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:24:22,241 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 01:24:22,241 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:24:22,242 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-22 01:24:22,242 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 15 [2018-06-22 01:24:22,242 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:22,242 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-22 01:24:22,242 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:24:22,242 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-22 01:24:22,242 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:24:22,242 INFO ]: Found error trace [2018-06-22 01:24:22,242 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:22,243 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:22,243 INFO ]: Analyzing trace with hash 1587191237, now seen corresponding path program 3 times [2018-06-22 01:24:22,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:22,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:22,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:22,243 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:22,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:22,259 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:22,564 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:22,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:22,565 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 01:24:22,570 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:22,601 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:24:22,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:22,603 INFO ]: Computing forward predicates... [2018-06-22 01:24:22,688 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:22,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:22,706 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:24:22,706 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:24:22,706 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:24:22,706 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:24:22,706 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 11 states. [2018-06-22 01:24:22,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:22,778 INFO ]: Finished difference Result 20 states and 25 transitions. [2018-06-22 01:24:22,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:24:22,778 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-22 01:24:22,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:22,779 INFO ]: With dead ends: 20 [2018-06-22 01:24:22,779 INFO ]: Without dead ends: 20 [2018-06-22 01:24:22,779 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:24:22,779 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:24:22,780 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 01:24:22,780 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:24:22,780 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-06-22 01:24:22,780 INFO ]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 15 [2018-06-22 01:24:22,780 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:22,780 INFO ]: Abstraction has 18 states and 23 transitions. [2018-06-22 01:24:22,780 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:24:22,780 INFO ]: Start isEmpty. Operand 18 states and 23 transitions. [2018-06-22 01:24:22,780 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:24:22,780 INFO ]: Found error trace [2018-06-22 01:24:22,780 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:22,780 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:22,780 INFO ]: Analyzing trace with hash 408797561, now seen corresponding path program 8 times [2018-06-22 01:24:22,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:22,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:22,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:22,781 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:22,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:22,814 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:22,929 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:22,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:22,930 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 01:24:22,935 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:22,960 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:22,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:22,962 INFO ]: Computing forward predicates... [2018-06-22 01:24:23,012 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:23,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:23,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-22 01:24:23,030 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:24:23,031 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:24:23,031 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:24:23,031 INFO ]: Start difference. First operand 18 states and 23 transitions. Second operand 13 states. [2018-06-22 01:24:23,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:23,162 INFO ]: Finished difference Result 25 states and 34 transitions. [2018-06-22 01:24:23,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:24:23,162 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 01:24:23,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:23,162 INFO ]: With dead ends: 25 [2018-06-22 01:24:23,162 INFO ]: Without dead ends: 25 [2018-06-22 01:24:23,163 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:24:23,163 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:24:23,164 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-06-22 01:24:23,164 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:23,164 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-22 01:24:23,164 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 16 [2018-06-22 01:24:23,164 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:23,164 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-22 01:24:23,164 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:24:23,164 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-22 01:24:23,164 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:24:23,164 INFO ]: Found error trace [2018-06-22 01:24:23,164 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:23,164 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:23,164 INFO ]: Analyzing trace with hash -336155011, now seen corresponding path program 4 times [2018-06-22 01:24:23,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:23,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:23,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:23,165 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:23,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:23,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:23,310 INFO ]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:23,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:23,310 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 01:24:23,316 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:24:23,340 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:24:23,341 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:23,342 INFO ]: Computing forward predicates... [2018-06-22 01:24:23,765 WARN ]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:23,767 INFO ]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:23,786 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:23,787 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 01:24:23,787 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:24:23,787 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:24:23,787 INFO ]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:24:23,787 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 14 states. [2018-06-22 01:24:23,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:23,876 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-22 01:24:23,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:24:23,877 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-22 01:24:23,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:23,877 INFO ]: With dead ends: 24 [2018-06-22 01:24:23,877 INFO ]: Without dead ends: 24 [2018-06-22 01:24:23,878 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:24:23,878 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:24:23,878 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-06-22 01:24:23,879 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:23,879 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-22 01:24:23,879 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 16 [2018-06-22 01:24:23,879 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:23,879 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-22 01:24:23,879 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:24:23,879 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-22 01:24:23,879 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:24:23,879 INFO ]: Found error trace [2018-06-22 01:24:23,879 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:23,879 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:23,879 INFO ]: Analyzing trace with hash -763808338, now seen corresponding path program 5 times [2018-06-22 01:24:23,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:23,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:23,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:23,880 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:23,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:23,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:24,148 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:24,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:24,148 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 01:24:24,159 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:24:24,239 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:24:24,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:24,241 INFO ]: Computing forward predicates... [2018-06-22 01:24:24,718 WARN ]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:24:25,370 WARN ]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 01:24:25,381 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:25,400 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:25,400 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 01:24:25,400 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:24:25,400 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:24:25,400 INFO ]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2018-06-22 01:24:25,400 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 15 states. [2018-06-22 01:24:26,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:26,034 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-22 01:24:26,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:24:26,034 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-22 01:24:26,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:26,034 INFO ]: With dead ends: 24 [2018-06-22 01:24:26,034 INFO ]: Without dead ends: 19 [2018-06-22 01:24:26,034 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2018-06-22 01:24:26,034 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:26,035 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:24:26,035 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:26,035 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-22 01:24:26,035 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 16 [2018-06-22 01:24:26,035 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:26,035 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-22 01:24:26,035 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:24:26,035 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-22 01:24:26,036 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:24:26,036 INFO ]: Found error trace [2018-06-22 01:24:26,036 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:26,036 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:26,036 INFO ]: Analyzing trace with hash -1508760910, now seen corresponding path program 4 times [2018-06-22 01:24:26,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:26,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:26,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:26,036 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:26,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:26,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:26,578 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:26,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:26,578 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) [2018-06-22 01:24:26,593 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:24:26,623 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:24:26,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:26,625 INFO ]: Computing forward predicates... [2018-06-22 01:24:27,266 WARN ]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:24:28,139 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:28,158 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:28,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 01:24:28,176 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:24:28,176 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:24:28,176 INFO ]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2018-06-22 01:24:28,176 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 15 states. [2018-06-22 01:24:28,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:28,278 INFO ]: Finished difference Result 23 states and 30 transitions. [2018-06-22 01:24:28,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:24:28,278 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-22 01:24:28,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:28,278 INFO ]: With dead ends: 23 [2018-06-22 01:24:28,278 INFO ]: Without dead ends: 19 [2018-06-22 01:24:28,278 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2018-06-22 01:24:28,278 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 01:24:28,279 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 01:24:28,279 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:28,279 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-22 01:24:28,279 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2018-06-22 01:24:28,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:28,279 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-22 01:24:28,279 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:24:28,279 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-22 01:24:28,280 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:24:28,280 INFO ]: Found error trace [2018-06-22 01:24:28,280 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:28,280 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:28,280 INFO ]: Analyzing trace with hash -202947878, now seen corresponding path program 9 times [2018-06-22 01:24:28,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:28,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:28,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:28,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:28,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:28,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:28,774 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:28,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:28,774 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 01:24:28,779 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:28,817 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 01:24:28,817 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:28,819 INFO ]: Computing forward predicates... [2018-06-22 01:24:29,363 WARN ]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:31,368 WARN ]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:24:31,371 INFO ]: Checked inductivity of 55 backedges. 0 proven. 53 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:31,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:31,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-06-22 01:24:31,391 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:24:31,391 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:24:31,391 INFO ]: CoverageRelationStatistics Valid=66, Invalid=204, Unknown=2, NotChecked=0, Total=272 [2018-06-22 01:24:31,391 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 17 states. [2018-06-22 01:24:35,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:35,569 INFO ]: Finished difference Result 28 states and 38 transitions. [2018-06-22 01:24:35,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:24:35,569 INFO ]: Start accepts. Automaton has 17 states. Word has length 17 [2018-06-22 01:24:35,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:35,570 INFO ]: With dead ends: 28 [2018-06-22 01:24:35,570 INFO ]: Without dead ends: 20 [2018-06-22 01:24:35,570 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=79, Invalid=261, Unknown=2, NotChecked=0, Total=342 [2018-06-22 01:24:35,570 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:24:35,571 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-22 01:24:35,571 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:35,571 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-22 01:24:35,571 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 17 [2018-06-22 01:24:35,571 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:35,571 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-22 01:24:35,571 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:24:35,571 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-22 01:24:35,571 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:24:35,571 INFO ]: Found error trace [2018-06-22 01:24:35,572 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:35,572 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:35,572 INFO ]: Analyzing trace with hash 914606017, now seen corresponding path program 10 times [2018-06-22 01:24:35,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:35,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:35,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:35,572 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:35,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:35,583 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:36,498 INFO ]: Checked inductivity of 55 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:36,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:36,498 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 01:24:36,506 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:24:36,532 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:24:36,532 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:36,534 INFO ]: Computing forward predicates... [2018-06-22 01:24:36,802 WARN ]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:36,805 INFO ]: Checked inductivity of 55 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:36,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:36,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-22 01:24:36,824 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:24:36,824 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:24:36,824 INFO ]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:24:36,824 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 15 states. [2018-06-22 01:24:36,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:36,985 INFO ]: Finished difference Result 24 states and 28 transitions. [2018-06-22 01:24:36,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:24:36,985 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-22 01:24:36,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:36,986 INFO ]: With dead ends: 24 [2018-06-22 01:24:36,986 INFO ]: Without dead ends: 24 [2018-06-22 01:24:36,986 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:24:36,986 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:24:36,986 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-06-22 01:24:36,986 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:24:36,987 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-22 01:24:36,987 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 17 [2018-06-22 01:24:36,987 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:36,987 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-22 01:24:36,987 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:24:36,987 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-22 01:24:36,987 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:24:36,987 INFO ]: Found error trace [2018-06-22 01:24:36,987 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:36,987 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:36,987 INFO ]: Analyzing trace with hash -257999882, now seen corresponding path program 6 times [2018-06-22 01:24:36,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:36,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:36,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:36,988 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:36,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:37,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:37,200 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:37,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:37,200 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 01:24:37,205 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:24:37,235 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 01:24:37,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:37,237 INFO ]: Computing forward predicates... [2018-06-22 01:24:37,758 WARN ]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:24:38,821 WARN ]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 01:24:38,824 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:38,842 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:38,842 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 01:24:38,842 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:24:38,843 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:24:38,843 INFO ]: CoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2018-06-22 01:24:38,843 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 16 states. [2018-06-22 01:24:39,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:39,420 INFO ]: Finished difference Result 24 states and 32 transitions. [2018-06-22 01:24:39,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:24:39,421 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-22 01:24:39,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:39,421 INFO ]: With dead ends: 24 [2018-06-22 01:24:39,421 INFO ]: Without dead ends: 20 [2018-06-22 01:24:39,421 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2018-06-22 01:24:39,422 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:24:39,422 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:24:39,422 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:24:39,423 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-22 01:24:39,423 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 17 [2018-06-22 01:24:39,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:39,423 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-22 01:24:39,423 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:24:39,423 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-22 01:24:39,423 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:24:39,423 INFO ]: Found error trace [2018-06-22 01:24:39,423 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:39,423 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:39,423 INFO ]: Analyzing trace with hash -1002952454, now seen corresponding path program 5 times [2018-06-22 01:24:39,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:39,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:39,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:39,424 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:39,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:39,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:39,767 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:39,767 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:39,767 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 01:24:39,773 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:24:39,803 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 01:24:39,803 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:39,805 INFO ]: Computing forward predicates... [2018-06-22 01:24:39,927 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:39,945 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:39,945 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-22 01:24:39,945 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:24:39,945 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:24:39,945 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:24:39,946 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 14 states. [2018-06-22 01:24:40,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:40,049 INFO ]: Finished difference Result 23 states and 30 transitions. [2018-06-22 01:24:40,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:24:40,049 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 01:24:40,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:40,050 INFO ]: With dead ends: 23 [2018-06-22 01:24:40,050 INFO ]: Without dead ends: 23 [2018-06-22 01:24:40,050 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:24:40,050 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:24:40,051 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-22 01:24:40,051 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:24:40,051 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-22 01:24:40,051 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 17 [2018-06-22 01:24:40,051 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:40,051 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-22 01:24:40,051 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:24:40,051 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-22 01:24:40,051 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:24:40,051 INFO ]: Found error trace [2018-06-22 01:24:40,051 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:40,051 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:40,052 INFO ]: Analyzing trace with hash -1702754926, now seen corresponding path program 11 times [2018-06-22 01:24:40,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:40,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:40,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:40,052 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:40,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:40,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:40,536 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:40,537 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:40,537 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 01:24:40,542 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:24:40,624 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:24:40,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:40,626 INFO ]: Computing forward predicates... [2018-06-22 01:24:41,196 WARN ]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:42,001 WARN ]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:43,681 WARN ]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:24:43,684 INFO ]: Checked inductivity of 66 backedges. 0 proven. 63 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:43,703 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:43,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-06-22 01:24:43,703 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:24:43,703 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:24:43,703 INFO ]: CoverageRelationStatistics Valid=71, Invalid=232, Unknown=3, NotChecked=0, Total=306 [2018-06-22 01:24:43,703 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 18 states. [2018-06-22 01:24:46,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:46,325 INFO ]: Finished difference Result 25 states and 32 transitions. [2018-06-22 01:24:46,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:24:46,326 INFO ]: Start accepts. Automaton has 18 states. Word has length 18 [2018-06-22 01:24:46,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:46,326 INFO ]: With dead ends: 25 [2018-06-22 01:24:46,326 INFO ]: Without dead ends: 20 [2018-06-22 01:24:46,326 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=78, Invalid=261, Unknown=3, NotChecked=0, Total=342 [2018-06-22 01:24:46,327 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:24:46,327 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:24:46,327 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:24:46,327 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-22 01:24:46,328 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 18 [2018-06-22 01:24:46,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:46,328 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-22 01:24:46,328 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:24:46,328 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-22 01:24:46,328 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:24:46,328 INFO ]: Found error trace [2018-06-22 01:24:46,328 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:46,328 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:46,328 INFO ]: Analyzing trace with hash -1757806930, now seen corresponding path program 7 times [2018-06-22 01:24:46,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:46,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:46,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:46,329 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:46,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:46,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:46,716 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:46,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:46,716 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 01:24:46,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:46,756 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:46,758 INFO ]: Computing forward predicates... [2018-06-22 01:24:46,859 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:46,878 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:46,878 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-22 01:24:46,878 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:24:46,878 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:24:46,878 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:24:46,878 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 15 states. [2018-06-22 01:24:47,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:47,021 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-22 01:24:47,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:24:47,021 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-22 01:24:47,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:47,021 INFO ]: With dead ends: 24 [2018-06-22 01:24:47,021 INFO ]: Without dead ends: 24 [2018-06-22 01:24:47,021 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:24:47,021 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 01:24:47,022 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-06-22 01:24:47,022 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:24:47,022 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-06-22 01:24:47,022 INFO ]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 18 [2018-06-22 01:24:47,023 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:47,023 INFO ]: Abstraction has 21 states and 30 transitions. [2018-06-22 01:24:47,023 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:24:47,023 INFO ]: Start isEmpty. Operand 21 states and 30 transitions. [2018-06-22 01:24:47,023 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:24:47,023 INFO ]: Found error trace [2018-06-22 01:24:47,023 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:47,023 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:47,023 INFO ]: Analyzing trace with hash 1792207794, now seen corresponding path program 6 times [2018-06-22 01:24:47,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:47,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:47,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:47,023 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:47,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:47,035 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:47,157 INFO ]: Checked inductivity of 66 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:47,157 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:47,157 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 01:24:47,163 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:24:47,194 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:24:47,194 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:47,196 INFO ]: Computing forward predicates... [2018-06-22 01:24:47,582 WARN ]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:47,584 INFO ]: Checked inductivity of 66 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:47,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:47,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 01:24:47,602 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:24:47,603 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:24:47,603 INFO ]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:24:47,603 INFO ]: Start difference. First operand 21 states and 30 transitions. Second operand 16 states. [2018-06-22 01:24:47,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:47,697 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-22 01:24:47,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:24:47,697 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-22 01:24:47,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:47,698 INFO ]: With dead ends: 30 [2018-06-22 01:24:47,698 INFO ]: Without dead ends: 30 [2018-06-22 01:24:47,698 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:24:47,698 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:24:47,699 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-06-22 01:24:47,699 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:24:47,699 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-06-22 01:24:47,699 INFO ]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 18 [2018-06-22 01:24:47,699 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:47,699 INFO ]: Abstraction has 21 states and 30 transitions. [2018-06-22 01:24:47,699 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:24:47,699 INFO ]: Start isEmpty. Operand 21 states and 30 transitions. [2018-06-22 01:24:47,699 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:24:47,699 INFO ]: Found error trace [2018-06-22 01:24:47,699 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:47,699 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:47,699 INFO ]: Analyzing trace with hash 973519118, now seen corresponding path program 5 times [2018-06-22 01:24:47,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:47,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:47,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:47,700 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:47,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:47,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:47,834 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:47,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:47,834 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 01:24:47,839 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:24:47,873 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 01:24:47,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:47,875 INFO ]: Computing forward predicates... [2018-06-22 01:24:48,220 WARN ]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:48,658 INFO ]: Checked inductivity of 66 backedges. 0 proven. 65 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:48,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:48,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-22 01:24:48,677 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:24:48,677 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:24:48,677 INFO ]: CoverageRelationStatistics Valid=73, Invalid=198, Unknown=1, NotChecked=0, Total=272 [2018-06-22 01:24:48,677 INFO ]: Start difference. First operand 21 states and 30 transitions. Second operand 17 states. [2018-06-22 01:24:50,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:50,509 INFO ]: Finished difference Result 26 states and 35 transitions. [2018-06-22 01:24:50,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:24:50,511 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-22 01:24:50,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:50,512 INFO ]: With dead ends: 26 [2018-06-22 01:24:50,512 INFO ]: Without dead ends: 21 [2018-06-22 01:24:50,512 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=226, Unknown=1, NotChecked=0, Total=306 [2018-06-22 01:24:50,512 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:24:50,512 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:24:50,512 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:24:50,513 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-22 01:24:50,513 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 18 [2018-06-22 01:24:50,513 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:50,513 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-22 01:24:50,513 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:24:50,513 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-22 01:24:50,513 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:24:50,513 INFO ]: Found error trace [2018-06-22 01:24:50,513 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:50,513 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:50,513 INFO ]: Analyzing trace with hash -952133158, now seen corresponding path program 12 times [2018-06-22 01:24:50,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:50,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:50,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:50,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:50,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:50,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:50,692 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:50,692 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:50,692 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 01:24:50,697 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:24:50,735 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:24:50,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:50,737 INFO ]: Computing forward predicates... [2018-06-22 01:24:51,254 WARN ]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 01:24:51,610 WARN ]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:53,641 WARN ]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 01:24:53,644 INFO ]: Checked inductivity of 78 backedges. 0 proven. 76 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:53,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:53,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-22 01:24:53,664 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:24:53,664 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:24:53,664 INFO ]: CoverageRelationStatistics Valid=81, Invalid=259, Unknown=2, NotChecked=0, Total=342 [2018-06-22 01:24:53,664 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 19 states. [2018-06-22 01:24:54,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:54,662 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-22 01:24:54,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:24:54,662 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-22 01:24:54,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:54,662 INFO ]: With dead ends: 26 [2018-06-22 01:24:54,662 INFO ]: Without dead ends: 21 [2018-06-22 01:24:54,663 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=88, Invalid=290, Unknown=2, NotChecked=0, Total=380 [2018-06-22 01:24:54,663 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:24:54,663 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 01:24:54,663 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:24:54,663 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-22 01:24:54,663 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 19 [2018-06-22 01:24:54,663 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:54,663 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-22 01:24:54,663 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:24:54,663 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-22 01:24:54,664 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:24:54,664 INFO ]: Found error trace [2018-06-22 01:24:54,664 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:54,664 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:54,664 INFO ]: Analyzing trace with hash -1007185162, now seen corresponding path program 8 times [2018-06-22 01:24:54,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:54,664 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:54,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:54,664 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:54,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:54,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:54,822 INFO ]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:54,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:54,822 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 01:24:54,832 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:24:54,864 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:24:54,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:54,865 INFO ]: Computing forward predicates... [2018-06-22 01:24:55,233 WARN ]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 01:24:55,238 INFO ]: Checked inductivity of 78 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:55,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:55,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-22 01:24:55,256 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:24:55,256 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:24:55,256 INFO ]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:24:55,257 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 17 states. [2018-06-22 01:24:55,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:55,409 INFO ]: Finished difference Result 27 states and 32 transitions. [2018-06-22 01:24:55,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:24:55,410 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-22 01:24:55,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:55,410 INFO ]: With dead ends: 27 [2018-06-22 01:24:55,410 INFO ]: Without dead ends: 27 [2018-06-22 01:24:55,410 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:24:55,410 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:24:55,410 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 01:24:55,410 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:24:55,411 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-22 01:24:55,411 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 19 [2018-06-22 01:24:55,411 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:55,411 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-22 01:24:55,411 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:24:55,411 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-22 01:24:55,411 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:24:55,411 INFO ]: Found error trace [2018-06-22 01:24:55,411 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:55,411 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:55,411 INFO ]: Analyzing trace with hash 1724140886, now seen corresponding path program 6 times [2018-06-22 01:24:55,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:55,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:55,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:55,411 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:55,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:55,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:55,898 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:55,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:55,898 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 01:24:55,906 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:24:56,010 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 01:24:56,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:56,012 INFO ]: Computing forward predicates... [2018-06-22 01:24:56,079 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:56,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:56,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 01:24:56,098 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:24:56,098 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:24:56,098 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:24:56,099 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 15 states. [2018-06-22 01:24:56,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:56,229 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-22 01:24:56,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:24:56,229 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-22 01:24:56,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:56,229 INFO ]: With dead ends: 25 [2018-06-22 01:24:56,229 INFO ]: Without dead ends: 25 [2018-06-22 01:24:56,229 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:24:56,229 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 01:24:56,230 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-22 01:24:56,230 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 01:24:56,230 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-06-22 01:24:56,230 INFO ]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2018-06-22 01:24:56,230 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:56,230 INFO ]: Abstraction has 22 states and 27 transitions. [2018-06-22 01:24:56,230 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:24:56,230 INFO ]: Start isEmpty. Operand 22 states and 27 transitions. [2018-06-22 01:24:56,231 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:24:56,231 INFO ]: Found error trace [2018-06-22 01:24:56,231 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:56,231 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:56,231 INFO ]: Analyzing trace with hash 842305170, now seen corresponding path program 13 times [2018-06-22 01:24:56,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:56,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:56,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:56,231 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:24:56,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:56,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:57,144 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:57,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:57,144 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 01:24:57,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:57,188 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:57,191 INFO ]: Computing forward predicates... [2018-06-22 01:24:57,253 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:57,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:57,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-22 01:24:57,286 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:24:57,286 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:24:57,286 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:24:57,286 INFO ]: Start difference. First operand 22 states and 27 transitions. Second operand 17 states. [2018-06-22 01:24:57,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:57,539 INFO ]: Finished difference Result 31 states and 40 transitions. [2018-06-22 01:24:57,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:24:57,539 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-22 01:24:57,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:57,539 INFO ]: With dead ends: 31 [2018-06-22 01:24:57,539 INFO ]: Without dead ends: 31 [2018-06-22 01:24:57,540 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:24:57,540 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 01:24:57,541 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-06-22 01:24:57,541 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:24:57,541 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-22 01:24:57,541 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 20 [2018-06-22 01:24:57,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:57,541 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-22 01:24:57,541 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:24:57,541 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-22 01:24:57,541 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:24:57,541 INFO ]: Found error trace [2018-06-22 01:24:57,541 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:57,541 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:57,541 INFO ]: Analyzing trace with hash -776388082, now seen corresponding path program 7 times [2018-06-22 01:24:57,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:57,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:57,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:57,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:57,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:57,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:57,690 INFO ]: Checked inductivity of 91 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:57,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:57,690 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 01:24:57,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:57,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:57,730 INFO ]: Computing forward predicates... [2018-06-22 01:24:58,241 WARN ]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-22 01:24:58,284 INFO ]: Checked inductivity of 91 backedges. 85 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:58,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:24:58,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-22 01:24:58,302 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:24:58,303 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:24:58,303 INFO ]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:24:58,303 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 19 states. [2018-06-22 01:24:58,562 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:24:58,562 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-22 01:24:58,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:24:58,563 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-22 01:24:58,563 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:24:58,563 INFO ]: With dead ends: 30 [2018-06-22 01:24:58,563 INFO ]: Without dead ends: 30 [2018-06-22 01:24:58,563 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:24:58,563 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:24:58,564 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 23. [2018-06-22 01:24:58,564 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:24:58,564 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-22 01:24:58,564 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 20 [2018-06-22 01:24:58,564 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:24:58,564 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-22 01:24:58,564 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:24:58,564 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-22 01:24:58,565 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:24:58,565 INFO ]: Found error trace [2018-06-22 01:24:58,565 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:24:58,565 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:24:58,565 INFO ]: Analyzing trace with hash -1148739331, now seen corresponding path program 9 times [2018-06-22 01:24:58,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:24:58,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:24:58,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:24:58,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:24:58,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:58,970 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:24:58,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:24:58,970 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 01:24:58,976 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:24:59,014 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-22 01:24:59,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:24:59,016 INFO ]: Computing forward predicates... [2018-06-22 01:24:59,427 WARN ]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 01:25:00,572 WARN ]: Spent 501.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 01:25:01,674 WARN ]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-22 01:25:01,677 INFO ]: Checked inductivity of 91 backedges. 0 proven. 89 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:25:01,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:25:01,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-22 01:25:01,696 INFO ]: Interpolant automaton has 20 states [2018-06-22 01:25:01,696 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 01:25:01,697 INFO ]: CoverageRelationStatistics Valid=92, Invalid=286, Unknown=2, NotChecked=0, Total=380 [2018-06-22 01:25:01,697 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 20 states. Received shutdown request... [2018-06-22 01:25:05,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:25:05,977 WARN ]: Verification canceled [2018-06-22 01:25:05,981 WARN ]: Timeout [2018-06-22 01:25:05,982 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:25:05 BoogieIcfgContainer [2018-06-22 01:25:05,982 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:25:05,982 INFO ]: Toolchain (without parser) took 66222.83 ms. Allocated memory was 306.2 MB in the beginning and 589.8 MB in the end (delta: 283.6 MB). Free memory was 260.6 MB in the beginning and 548.1 MB in the end (delta: -287.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:25:05,983 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:25:05,983 INFO ]: ChcToBoogie took 59.47 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 257.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 01:25:05,984 INFO ]: Boogie Preprocessor took 47.93 ms. Allocated memory is still 306.2 MB. Free memory was 257.6 MB in the beginning and 256.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 01:25:05,984 INFO ]: RCFGBuilder took 392.54 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 242.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:25:05,984 INFO ]: TraceAbstraction took 65701.60 ms. Allocated memory was 306.2 MB in the beginning and 589.8 MB in the end (delta: 283.6 MB). Free memory was 242.6 MB in the beginning and 548.1 MB in the end (delta: -305.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:25:05,986 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 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.47 ms. Allocated memory is still 306.2 MB. Free memory was 259.6 MB in the beginning and 257.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 47.93 ms. Allocated memory is still 306.2 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 392.54 ms. Allocated memory is still 306.2 MB. Free memory was 256.6 MB in the beginning and 242.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 65701.60 ms. Allocated memory was 306.2 MB in the beginning and 589.8 MB in the end (delta: 283.6 MB). Free memory was 242.6 MB in the beginning and 548.1 MB in the end (delta: -305.5 MB). There was no memory consumed. 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 constructing difference of abstraction (23states) and interpolant automaton (currently 19 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (28 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 65.6s OverallTime, 50 OverallIterations, 9 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 432 SDtfs, 214 SDslu, 1463 SDs, 0 SdLazy, 4642 SolverSat, 921 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 396 SyntacticMatches, 201 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=11, 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.1s AutomataMinimizationTime, 49 MinimizatonAttempts, 148 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 190 NumberOfCheckSat, 1208 ConstructedInterpolants, 79 QuantifiedInterpolants, 84821 SizeOfPredicates, 122 NumberOfNonLiveVariables, 9741 ConjunctsInSsa, 1437 ConjunctsInUnsatCore, 95 InterpolantComputations, 8 PerfectInterpolantSequences, 704/3148 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-25-05-995.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-25-05-995.csv Completed graceful shutdown