java -Xss4m -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/hopv/lia/mochi/copy_intro.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:23:45,947 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:23:45,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:23:45,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:23:45,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:23:45,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:23:45,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:23:45,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:23:45,969 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:23:45,970 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:23:45,970 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:23:45,971 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:23:45,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:23:45,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:23:45,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:23:45,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:23:45,979 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:23:45,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:23:45,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:23:45,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:23:45,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:23:45,995 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:23:45,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:23:45,996 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:23:45,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:23:45,997 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:23:46,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:23:46,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:23:46,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:23:46,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:23:46,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:23:46,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:23:46,007 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:23:46,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:23:46,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:23:46,013 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:23:46,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:23:46,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:23:46,032 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:23:46,032 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:23:46,034 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:23:46,034 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:23:46,034 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:23:46,034 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:23:46,035 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:23:46,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:23:46,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:23:46,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:23:46,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:23:46,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:23:46,036 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:23:46,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:23:46,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:23:46,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:23:46,037 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:23:46,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:23:46,037 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:23:46,040 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:23:46,040 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:23:46,092 INFO ]: Repository-Root is: /tmp [2018-06-25 09:23:46,111 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:23:46,115 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:23:46,116 INFO ]: Initializing SmtParser... [2018-06-25 09:23:46,117 INFO ]: SmtParser initialized [2018-06-25 09:23:46,117 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 [2018-06-25 09:23:46,119 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-25 09:23:46,214 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 unknown [2018-06-25 09:23:46,342 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/copy_intro.smt2 [2018-06-25 09:23:46,347 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:23:46,352 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:23:46,354 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:23:46,354 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:23:46,354 INFO ]: ChcToBoogie initialized [2018-06-25 09:23:46,358 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,401 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46 Unit [2018-06-25 09:23:46,402 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:23:46,402 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:23:46,402 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:23:46,402 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:23:46,423 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,423 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,428 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,428 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,431 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,433 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,433 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... [2018-06-25 09:23:46,435 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:23:46,436 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:23:46,436 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:23:46,436 INFO ]: RCFGBuilder initialized [2018-06-25 09:23:46,437 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:23:46,456 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:23:46,456 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:23:46,456 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:23:46,456 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:23:46,456 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:23:46,456 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:23:46,634 INFO ]: Using library mode [2018-06-25 09:23:46,635 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:23:46 BoogieIcfgContainer [2018-06-25 09:23:46,635 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:23:46,636 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:23:46,641 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:23:46,649 INFO ]: TraceAbstraction initialized [2018-06-25 09:23:46,649 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:23:46" (1/3) ... [2018-06-25 09:23:46,650 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d21e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:23:46, skipping insertion in model container [2018-06-25 09:23:46,650 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:23:46" (2/3) ... [2018-06-25 09:23:46,650 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d21e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:23:46, skipping insertion in model container [2018-06-25 09:23:46,650 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:23:46" (3/3) ... [2018-06-25 09:23:46,656 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:23:46,665 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:23:46,673 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:23:46,715 INFO ]: Using default assertion order modulation [2018-06-25 09:23:46,716 INFO ]: Interprodecural is true [2018-06-25 09:23:46,716 INFO ]: Hoare is false [2018-06-25 09:23:46,716 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:23:46,716 INFO ]: Backedges is TWOTRACK [2018-06-25 09:23:46,716 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:23:46,716 INFO ]: Difference is false [2018-06-25 09:23:46,716 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:23:46,716 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:23:46,726 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:23:46,737 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:23:46,738 INFO ]: Found error trace [2018-06-25 09:23:46,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:46,739 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:46,746 INFO ]: Analyzing trace with hash -948631399, now seen corresponding path program 1 times [2018-06-25 09:23:46,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:46,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:46,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:46,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:46,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:46,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:46,878 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:23:46,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:23:46,880 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:23:46,881 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:23:46,891 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:23:46,892 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:23:46,893 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-25 09:23:47,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:47,034 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-25 09:23:47,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:23:47,036 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:23:47,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:47,044 INFO ]: With dead ends: 19 [2018-06-25 09:23:47,044 INFO ]: Without dead ends: 19 [2018-06-25 09:23:47,050 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:23:47,064 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:23:47,087 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:23:47,088 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:23:47,090 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-25 09:23:47,091 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 7 [2018-06-25 09:23:47,092 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:47,092 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-25 09:23:47,092 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:23:47,092 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-25 09:23:47,093 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:23:47,093 INFO ]: Found error trace [2018-06-25 09:23:47,093 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:47,094 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:47,094 INFO ]: Analyzing trace with hash 945526498, now seen corresponding path program 1 times [2018-06-25 09:23:47,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:47,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:47,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:47,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:47,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:47,110 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:47,254 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:47,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:47,254 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:23:47,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:47,285 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:47,294 INFO ]: Computing forward predicates... [2018-06-25 09:23:47,435 INFO ]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:47,457 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:47,457 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:23:47,458 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:23:47,458 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:23:47,458 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:23:47,458 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 7 states. [2018-06-25 09:23:47,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:47,925 INFO ]: Finished difference Result 27 states and 33 transitions. [2018-06-25 09:23:47,925 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:23:47,925 INFO ]: Start accepts. Automaton has 7 states. Word has length 15 [2018-06-25 09:23:47,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:47,926 INFO ]: With dead ends: 27 [2018-06-25 09:23:47,926 INFO ]: Without dead ends: 26 [2018-06-25 09:23:47,927 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:23:47,927 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:23:47,932 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 09:23:47,932 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:23:47,933 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-25 09:23:47,933 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2018-06-25 09:23:47,933 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:47,933 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-25 09:23:47,933 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:23:47,933 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-25 09:23:47,934 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:23:47,934 INFO ]: Found error trace [2018-06-25 09:23:47,934 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:47,934 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:47,934 INFO ]: Analyzing trace with hash -752622967, now seen corresponding path program 1 times [2018-06-25 09:23:47,934 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:47,934 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:47,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:47,935 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:47,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:47,946 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:48,181 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:48,181 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:48,181 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-25 09:23:48,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:48,219 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:48,221 INFO ]: Computing forward predicates... [2018-06-25 09:23:48,305 INFO ]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:48,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:48,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-25 09:23:48,325 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:23:48,325 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:23:48,325 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:23:48,325 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 11 states. [2018-06-25 09:23:48,759 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:48,759 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-25 09:23:48,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:23:48,759 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-25 09:23:48,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:48,760 INFO ]: With dead ends: 26 [2018-06-25 09:23:48,760 INFO ]: Without dead ends: 20 [2018-06-25 09:23:48,761 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:23:48,761 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:23:48,764 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:23:48,764 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:23:48,764 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-25 09:23:48,764 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2018-06-25 09:23:48,765 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:48,765 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-25 09:23:48,765 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:23:48,765 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-25 09:23:48,765 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:23:48,765 INFO ]: Found error trace [2018-06-25 09:23:48,765 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:48,765 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:48,765 INFO ]: Analyzing trace with hash 166638355, now seen corresponding path program 2 times [2018-06-25 09:23:48,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:48,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:48,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:48,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:48,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:48,775 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:48,839 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:48,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:48,839 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-25 09:23:48,851 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:23:48,869 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:23:48,869 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:48,871 INFO ]: Computing forward predicates... [2018-06-25 09:23:49,103 INFO ]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:49,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:49,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 09:23:49,122 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:23:49,122 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:23:49,123 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:23:49,123 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 11 states. [2018-06-25 09:23:49,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:49,238 INFO ]: Finished difference Result 34 states and 41 transitions. [2018-06-25 09:23:49,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:23:49,239 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-25 09:23:49,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:49,240 INFO ]: With dead ends: 34 [2018-06-25 09:23:49,240 INFO ]: Without dead ends: 34 [2018-06-25 09:23:49,240 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:23:49,241 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 09:23:49,244 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-06-25 09:23:49,244 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:23:49,245 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-06-25 09:23:49,245 INFO ]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2018-06-25 09:23:49,245 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:49,245 INFO ]: Abstraction has 28 states and 34 transitions. [2018-06-25 09:23:49,245 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:23:49,245 INFO ]: Start isEmpty. Operand 28 states and 34 transitions. [2018-06-25 09:23:49,246 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:23:49,246 INFO ]: Found error trace [2018-06-25 09:23:49,246 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:49,246 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:49,246 INFO ]: Analyzing trace with hash 871648376, now seen corresponding path program 3 times [2018-06-25 09:23:49,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:49,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:49,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:49,247 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:49,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:49,258 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:49,380 INFO ]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:49,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:49,380 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:23:49,389 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:23:49,435 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:23:49,435 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:49,437 INFO ]: Computing forward predicates... [2018-06-25 09:23:49,518 INFO ]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:49,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:49,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:23:49,537 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:23:49,537 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:23:49,537 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:23:49,538 INFO ]: Start difference. First operand 28 states and 34 transitions. Second operand 10 states. [2018-06-25 09:23:49,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:49,660 INFO ]: Finished difference Result 36 states and 43 transitions. [2018-06-25 09:23:49,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:23:49,661 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-25 09:23:49,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:49,662 INFO ]: With dead ends: 36 [2018-06-25 09:23:49,662 INFO ]: Without dead ends: 36 [2018-06-25 09:23:49,663 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:23:49,663 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:23:49,667 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-25 09:23:49,667 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 09:23:49,668 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-06-25 09:23:49,668 INFO ]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-06-25 09:23:49,668 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:49,668 INFO ]: Abstraction has 34 states and 41 transitions. [2018-06-25 09:23:49,668 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:23:49,668 INFO ]: Start isEmpty. Operand 34 states and 41 transitions. [2018-06-25 09:23:49,669 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:23:49,669 INFO ]: Found error trace [2018-06-25 09:23:49,669 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:49,669 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:49,669 INFO ]: Analyzing trace with hash 1252122547, now seen corresponding path program 4 times [2018-06-25 09:23:49,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:49,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:49,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:49,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:49,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:49,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:49,807 INFO ]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:49,807 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:49,807 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-25 09:23:49,814 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:23:49,829 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:23:49,829 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:49,830 INFO ]: Computing forward predicates... [2018-06-25 09:23:49,879 INFO ]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:49,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:49,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 09:23:49,898 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:23:49,898 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:23:49,898 INFO ]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:23:49,898 INFO ]: Start difference. First operand 34 states and 41 transitions. Second operand 13 states. [2018-06-25 09:23:50,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:50,028 INFO ]: Finished difference Result 38 states and 45 transitions. [2018-06-25 09:23:50,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:23:50,030 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 09:23:50,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:50,030 INFO ]: With dead ends: 38 [2018-06-25 09:23:50,030 INFO ]: Without dead ends: 28 [2018-06-25 09:23:50,031 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:23:50,031 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:23:50,034 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 09:23:50,034 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:23:50,034 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-06-25 09:23:50,034 INFO ]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2018-06-25 09:23:50,034 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:50,035 INFO ]: Abstraction has 28 states and 33 transitions. [2018-06-25 09:23:50,035 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:23:50,035 INFO ]: Start isEmpty. Operand 28 states and 33 transitions. [2018-06-25 09:23:50,035 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:23:50,035 INFO ]: Found error trace [2018-06-25 09:23:50,035 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:50,035 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:50,036 INFO ]: Analyzing trace with hash -315547543, now seen corresponding path program 5 times [2018-06-25 09:23:50,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:50,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:50,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:50,036 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:50,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:50,046 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:50,122 INFO ]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:50,122 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:50,122 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-25 09:23:50,139 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:23:50,174 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:23:50,174 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:50,175 INFO ]: Computing forward predicates... [2018-06-25 09:23:50,236 INFO ]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:50,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:50,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-25 09:23:50,260 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:23:50,260 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:23:50,261 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:23:50,261 INFO ]: Start difference. First operand 28 states and 33 transitions. Second operand 13 states. [2018-06-25 09:23:50,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:50,335 INFO ]: Finished difference Result 37 states and 44 transitions. [2018-06-25 09:23:50,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:23:50,335 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-25 09:23:50,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:50,336 INFO ]: With dead ends: 37 [2018-06-25 09:23:50,336 INFO ]: Without dead ends: 37 [2018-06-25 09:23:50,336 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:23:50,336 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:23:50,339 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-06-25 09:23:50,340 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:23:50,340 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-25 09:23:50,340 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2018-06-25 09:23:50,341 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:50,341 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-25 09:23:50,341 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:23:50,341 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-25 09:23:50,341 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:23:50,341 INFO ]: Found error trace [2018-06-25 09:23:50,341 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:50,341 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:50,342 INFO ]: Analyzing trace with hash -1191212574, now seen corresponding path program 6 times [2018-06-25 09:23:50,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:50,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:50,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:50,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:50,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:50,356 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:50,612 INFO ]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:50,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:50,612 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-25 09:23:50,618 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:23:50,639 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:23:50,639 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:50,641 INFO ]: Computing forward predicates... [2018-06-25 09:23:50,684 INFO ]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:50,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:50,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-25 09:23:50,704 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:23:50,704 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:23:50,705 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:23:50,705 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 13 states. [2018-06-25 09:23:50,951 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:50,951 INFO ]: Finished difference Result 41 states and 48 transitions. [2018-06-25 09:23:50,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:23:50,952 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-25 09:23:50,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:50,953 INFO ]: With dead ends: 41 [2018-06-25 09:23:50,953 INFO ]: Without dead ends: 41 [2018-06-25 09:23:50,954 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:23:50,954 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 09:23:50,958 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-25 09:23:50,958 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:23:50,959 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-25 09:23:50,959 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2018-06-25 09:23:50,959 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:50,959 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-25 09:23:50,959 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:23:50,959 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-25 09:23:50,960 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:23:50,960 INFO ]: Found error trace [2018-06-25 09:23:50,960 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:50,960 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:50,960 INFO ]: Analyzing trace with hash 1727942537, now seen corresponding path program 7 times [2018-06-25 09:23:50,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:50,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:50,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:50,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:50,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:50,971 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:51,045 INFO ]: Checked inductivity of 25 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:51,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:51,045 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-25 09:23:51,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:51,068 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:51,070 INFO ]: Computing forward predicates... [2018-06-25 09:23:51,122 INFO ]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:51,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:51,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-25 09:23:51,141 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:23:51,141 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:23:51,141 INFO ]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:23:51,141 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 15 states. [2018-06-25 09:23:51,260 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:51,260 INFO ]: Finished difference Result 43 states and 50 transitions. [2018-06-25 09:23:51,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:23:51,261 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-25 09:23:51,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:51,261 INFO ]: With dead ends: 43 [2018-06-25 09:23:51,261 INFO ]: Without dead ends: 31 [2018-06-25 09:23:51,262 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:23:51,262 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:23:51,264 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 09:23:51,264 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:23:51,264 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-25 09:23:51,265 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2018-06-25 09:23:51,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:51,265 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-25 09:23:51,265 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:23:51,265 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-25 09:23:51,265 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:23:51,265 INFO ]: Found error trace [2018-06-25 09:23:51,265 INFO ]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:51,266 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:51,266 INFO ]: Analyzing trace with hash 374810003, now seen corresponding path program 8 times [2018-06-25 09:23:51,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:51,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:51,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:51,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:51,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:51,285 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:51,396 INFO ]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:51,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:51,396 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-25 09:23:51,402 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:23:51,417 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:23:51,462 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:51,464 INFO ]: Computing forward predicates... [2018-06-25 09:23:51,629 INFO ]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:51,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:51,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-25 09:23:51,650 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:23:51,650 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:23:51,650 INFO ]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:23:51,650 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 19 states. [2018-06-25 09:23:51,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:51,763 INFO ]: Finished difference Result 46 states and 55 transitions. [2018-06-25 09:23:51,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:23:51,763 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-25 09:23:51,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:51,763 INFO ]: With dead ends: 46 [2018-06-25 09:23:51,763 INFO ]: Without dead ends: 46 [2018-06-25 09:23:51,764 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:23:51,764 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-25 09:23:51,768 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-25 09:23:51,768 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:23:51,769 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-06-25 09:23:51,769 INFO ]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 20 [2018-06-25 09:23:51,769 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:51,769 INFO ]: Abstraction has 46 states and 55 transitions. [2018-06-25 09:23:51,769 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:23:51,769 INFO ]: Start isEmpty. Operand 46 states and 55 transitions. [2018-06-25 09:23:51,770 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:23:51,770 INFO ]: Found error trace [2018-06-25 09:23:51,770 INFO ]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:51,770 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:51,770 INFO ]: Analyzing trace with hash -1264965128, now seen corresponding path program 9 times [2018-06-25 09:23:51,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:51,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:51,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:51,771 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:51,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:51,786 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:52,196 INFO ]: Checked inductivity of 32 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:52,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:52,196 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-25 09:23:52,204 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:23:52,224 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:23:52,224 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:52,226 INFO ]: Computing forward predicates... [2018-06-25 09:23:52,306 INFO ]: Checked inductivity of 32 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:52,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:52,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-25 09:23:52,338 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:23:52,338 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:23:52,338 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:23:52,338 INFO ]: Start difference. First operand 46 states and 55 transitions. Second operand 16 states. [2018-06-25 09:23:52,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:52,648 INFO ]: Finished difference Result 46 states and 53 transitions. [2018-06-25 09:23:52,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:23:52,649 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-25 09:23:52,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:52,649 INFO ]: With dead ends: 46 [2018-06-25 09:23:52,649 INFO ]: Without dead ends: 46 [2018-06-25 09:23:52,650 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:23:52,650 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-25 09:23:52,654 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-06-25 09:23:52,654 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:23:52,655 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-06-25 09:23:52,655 INFO ]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 21 [2018-06-25 09:23:52,655 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:52,655 INFO ]: Abstraction has 42 states and 49 transitions. [2018-06-25 09:23:52,655 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:23:52,655 INFO ]: Start isEmpty. Operand 42 states and 49 transitions. [2018-06-25 09:23:52,656 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:23:52,656 INFO ]: Found error trace [2018-06-25 09:23:52,656 INFO ]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:52,656 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:52,656 INFO ]: Analyzing trace with hash 444177769, now seen corresponding path program 10 times [2018-06-25 09:23:52,656 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:52,656 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:52,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:52,657 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:52,657 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:52,674 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:52,795 INFO ]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:52,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:52,795 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-25 09:23:52,801 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:23:52,820 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:23:52,820 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:52,822 INFO ]: Computing forward predicates... [2018-06-25 09:23:52,864 INFO ]: Checked inductivity of 40 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:52,884 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:52,884 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-25 09:23:52,884 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:23:52,884 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:23:52,884 INFO ]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:23:52,885 INFO ]: Start difference. First operand 42 states and 49 transitions. Second operand 16 states. [2018-06-25 09:23:52,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:52,997 INFO ]: Finished difference Result 50 states and 57 transitions. [2018-06-25 09:23:52,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:23:52,998 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-25 09:23:52,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:52,999 INFO ]: With dead ends: 50 [2018-06-25 09:23:52,999 INFO ]: Without dead ends: 50 [2018-06-25 09:23:52,999 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:23:52,999 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 09:23:53,002 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-25 09:23:53,002 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:23:53,004 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-06-25 09:23:53,004 INFO ]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 22 [2018-06-25 09:23:53,004 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:53,004 INFO ]: Abstraction has 42 states and 49 transitions. [2018-06-25 09:23:53,004 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:23:53,004 INFO ]: Start isEmpty. Operand 42 states and 49 transitions. [2018-06-25 09:23:53,004 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:23:53,004 INFO ]: Found error trace [2018-06-25 09:23:53,005 INFO ]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:53,005 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:53,005 INFO ]: Analyzing trace with hash -129289896, now seen corresponding path program 11 times [2018-06-25 09:23:53,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:53,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:53,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:53,005 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:53,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:53,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:53,165 INFO ]: Checked inductivity of 49 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:53,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:53,166 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-25 09:23:53,172 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:23:53,193 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:23:53,193 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:53,195 INFO ]: Computing forward predicates... [2018-06-25 09:23:53,249 INFO ]: Checked inductivity of 49 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:53,267 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:53,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-25 09:23:53,268 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:23:53,268 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:23:53,268 INFO ]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:23:53,268 INFO ]: Start difference. First operand 42 states and 49 transitions. Second operand 17 states. [2018-06-25 09:23:53,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:53,410 INFO ]: Finished difference Result 52 states and 59 transitions. [2018-06-25 09:23:53,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:23:53,411 INFO ]: Start accepts. Automaton has 17 states. Word has length 23 [2018-06-25 09:23:53,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:53,411 INFO ]: With dead ends: 52 [2018-06-25 09:23:53,411 INFO ]: Without dead ends: 36 [2018-06-25 09:23:53,411 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:23:53,412 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:23:53,414 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-25 09:23:53,415 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 09:23:53,415 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-06-25 09:23:53,415 INFO ]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 23 [2018-06-25 09:23:53,415 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:53,415 INFO ]: Abstraction has 36 states and 41 transitions. [2018-06-25 09:23:53,415 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:23:53,415 INFO ]: Start isEmpty. Operand 36 states and 41 transitions. [2018-06-25 09:23:53,416 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:23:53,416 INFO ]: Found error trace [2018-06-25 09:23:53,416 INFO ]: trace histogram [8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:53,416 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:53,416 INFO ]: Analyzing trace with hash 885435618, now seen corresponding path program 12 times [2018-06-25 09:23:53,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:53,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:53,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:53,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:53,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:53,431 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:53,751 INFO ]: Checked inductivity of 49 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:53,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:53,751 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-25 09:23:53,759 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:23:53,812 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:23:53,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:53,814 INFO ]: Computing forward predicates... [2018-06-25 09:23:54,020 INFO ]: Checked inductivity of 49 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:54,039 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:54,039 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-25 09:23:54,039 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:23:54,039 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:23:54,040 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:23:54,040 INFO ]: Start difference. First operand 36 states and 41 transitions. Second operand 22 states. [2018-06-25 09:23:54,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:54,487 INFO ]: Finished difference Result 53 states and 60 transitions. [2018-06-25 09:23:54,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:23:54,488 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-25 09:23:54,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:54,488 INFO ]: With dead ends: 53 [2018-06-25 09:23:54,488 INFO ]: Without dead ends: 37 [2018-06-25 09:23:54,488 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:23:54,488 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:23:54,491 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 09:23:54,491 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 09:23:54,492 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-06-25 09:23:54,492 INFO ]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2018-06-25 09:23:54,492 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:54,492 INFO ]: Abstraction has 37 states and 42 transitions. [2018-06-25 09:23:54,492 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:23:54,492 INFO ]: Start isEmpty. Operand 37 states and 42 transitions. [2018-06-25 09:23:54,492 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:23:54,492 INFO ]: Found error trace [2018-06-25 09:23:54,492 INFO ]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:54,493 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:54,493 INFO ]: Analyzing trace with hash -1600714733, now seen corresponding path program 13 times [2018-06-25 09:23:54,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:54,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:54,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:54,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:54,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:54,503 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:55,257 INFO ]: Checked inductivity of 59 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:55,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:55,257 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-25 09:23:55,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:55,278 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:55,280 INFO ]: Computing forward predicates... [2018-06-25 09:23:55,336 INFO ]: Checked inductivity of 59 backedges. 17 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:55,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:55,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18 [2018-06-25 09:23:55,355 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:23:55,355 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:23:55,355 INFO ]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:23:55,355 INFO ]: Start difference. First operand 37 states and 42 transitions. Second operand 18 states. [2018-06-25 09:23:55,413 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:55,413 INFO ]: Finished difference Result 39 states and 44 transitions. [2018-06-25 09:23:55,413 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:23:55,413 INFO ]: Start accepts. Automaton has 18 states. Word has length 24 [2018-06-25 09:23:55,414 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:55,414 INFO ]: With dead ends: 39 [2018-06-25 09:23:55,414 INFO ]: Without dead ends: 39 [2018-06-25 09:23:55,414 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:23:55,414 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-25 09:23:55,417 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-25 09:23:55,417 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 09:23:55,418 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-25 09:23:55,418 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 24 [2018-06-25 09:23:55,418 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:55,418 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-25 09:23:55,418 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:23:55,418 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-25 09:23:55,418 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 09:23:55,418 INFO ]: Found error trace [2018-06-25 09:23:55,418 INFO ]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:55,418 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:55,419 INFO ]: Analyzing trace with hash 1918277496, now seen corresponding path program 14 times [2018-06-25 09:23:55,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:55,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:55,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:55,419 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:23:55,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:55,446 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:55,883 INFO ]: Checked inductivity of 70 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:55,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:55,883 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-25 09:23:55,888 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:23:55,906 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:23:55,906 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:55,908 INFO ]: Computing forward predicates... [2018-06-25 09:23:56,050 INFO ]: Checked inductivity of 70 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:56,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:56,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 22 [2018-06-25 09:23:56,069 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:23:56,069 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:23:56,069 INFO ]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:23:56,069 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 22 states. [2018-06-25 09:23:56,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:56,407 INFO ]: Finished difference Result 56 states and 63 transitions. [2018-06-25 09:23:56,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:23:56,408 INFO ]: Start accepts. Automaton has 22 states. Word has length 25 [2018-06-25 09:23:56,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:56,408 INFO ]: With dead ends: 56 [2018-06-25 09:23:56,408 INFO ]: Without dead ends: 56 [2018-06-25 09:23:56,408 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:23:56,409 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-25 09:23:56,412 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-06-25 09:23:56,412 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:23:56,413 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-06-25 09:23:56,413 INFO ]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-06-25 09:23:56,413 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:56,413 INFO ]: Abstraction has 46 states and 53 transitions. [2018-06-25 09:23:56,413 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:23:56,413 INFO ]: Start isEmpty. Operand 46 states and 53 transitions. [2018-06-25 09:23:56,413 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:23:56,413 INFO ]: Found error trace [2018-06-25 09:23:56,414 INFO ]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:56,414 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:56,414 INFO ]: Analyzing trace with hash -662113101, now seen corresponding path program 15 times [2018-06-25 09:23:56,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:56,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:56,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:56,414 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:56,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:56,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:56,559 INFO ]: Checked inductivity of 82 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:56,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:56,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:23:56,565 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:23:56,598 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:23:56,598 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:56,600 INFO ]: Computing forward predicates... [2018-06-25 09:23:56,656 INFO ]: Checked inductivity of 82 backedges. 23 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:56,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:56,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2018-06-25 09:23:56,676 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:23:56,676 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:23:56,676 INFO ]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:23:56,677 INFO ]: Start difference. First operand 46 states and 53 transitions. Second operand 20 states. [2018-06-25 09:23:56,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:56,831 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-25 09:23:56,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:23:56,831 INFO ]: Start accepts. Automaton has 20 states. Word has length 26 [2018-06-25 09:23:56,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:56,832 INFO ]: With dead ends: 58 [2018-06-25 09:23:56,832 INFO ]: Without dead ends: 40 [2018-06-25 09:23:56,832 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:23:56,832 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 09:23:56,835 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 09:23:56,835 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 09:23:56,835 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-06-25 09:23:56,835 INFO ]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 26 [2018-06-25 09:23:56,835 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:56,835 INFO ]: Abstraction has 40 states and 45 transitions. [2018-06-25 09:23:56,835 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:23:56,835 INFO ]: Start isEmpty. Operand 40 states and 45 transitions. [2018-06-25 09:23:56,835 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:23:56,835 INFO ]: Found error trace [2018-06-25 09:23:56,836 INFO ]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:56,836 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:56,836 INFO ]: Analyzing trace with hash 729606761, now seen corresponding path program 16 times [2018-06-25 09:23:56,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:56,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:56,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:56,836 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:56,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:56,844 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:57,192 INFO ]: Checked inductivity of 82 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:57,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:57,193 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-25 09:23:57,198 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:23:57,230 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:23:57,230 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:57,233 INFO ]: Computing forward predicates... [2018-06-25 09:23:57,344 INFO ]: Checked inductivity of 82 backedges. 23 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:57,363 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:57,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2018-06-25 09:23:57,364 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:23:57,364 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:23:57,364 INFO ]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:23:57,364 INFO ]: Start difference. First operand 40 states and 45 transitions. Second operand 20 states. [2018-06-25 09:23:58,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:58,696 INFO ]: Finished difference Result 42 states and 47 transitions. [2018-06-25 09:23:58,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:23:58,696 INFO ]: Start accepts. Automaton has 20 states. Word has length 26 [2018-06-25 09:23:58,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:58,696 INFO ]: With dead ends: 42 [2018-06-25 09:23:58,696 INFO ]: Without dead ends: 42 [2018-06-25 09:23:58,697 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:23:58,697 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 09:23:58,699 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-25 09:23:58,699 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 09:23:58,699 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-25 09:23:58,699 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2018-06-25 09:23:58,700 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:58,700 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-25 09:23:58,700 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:23:58,700 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-25 09:23:58,706 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:23:58,706 INFO ]: Found error trace [2018-06-25 09:23:58,706 INFO ]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:58,706 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:58,706 INFO ]: Analyzing trace with hash 1143799778, now seen corresponding path program 17 times [2018-06-25 09:23:58,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:58,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:58,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:58,707 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:58,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:58,724 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:59,070 INFO ]: Checked inductivity of 95 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:59,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:23:59,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:23:59,078 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:23:59,111 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-25 09:23:59,111 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:23:59,113 INFO ]: Computing forward predicates... [2018-06-25 09:23:59,286 INFO ]: Checked inductivity of 95 backedges. 2 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:23:59,305 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:23:59,305 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 25 [2018-06-25 09:23:59,305 INFO ]: Interpolant automaton has 25 states [2018-06-25 09:23:59,305 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 09:23:59,305 INFO ]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:23:59,306 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 25 states. [2018-06-25 09:23:59,852 WARN ]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-25 09:23:59,983 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:23:59,983 INFO ]: Finished difference Result 61 states and 68 transitions. [2018-06-25 09:23:59,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:23:59,984 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-25 09:23:59,984 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:23:59,984 INFO ]: With dead ends: 61 [2018-06-25 09:23:59,984 INFO ]: Without dead ends: 61 [2018-06-25 09:23:59,985 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:23:59,985 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 09:23:59,988 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-06-25 09:23:59,988 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-25 09:23:59,989 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-06-25 09:23:59,989 INFO ]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-06-25 09:23:59,989 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:23:59,989 INFO ]: Abstraction has 49 states and 56 transitions. [2018-06-25 09:23:59,989 INFO ]: Interpolant automaton has 25 states. [2018-06-25 09:23:59,989 INFO ]: Start isEmpty. Operand 49 states and 56 transitions. [2018-06-25 09:23:59,989 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:23:59,989 INFO ]: Found error trace [2018-06-25 09:23:59,989 INFO ]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:23:59,990 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:23:59,990 INFO ]: Analyzing trace with hash 1098881417, now seen corresponding path program 18 times [2018-06-25 09:23:59,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:23:59,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:23:59,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:23:59,990 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:23:59,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:00,000 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:00,198 INFO ]: Checked inductivity of 109 backedges. 17 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:00,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:00,198 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-25 09:24:00,204 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:24:00,228 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-25 09:24:00,228 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:00,230 INFO ]: Computing forward predicates... [2018-06-25 09:24:00,528 INFO ]: Checked inductivity of 109 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:00,548 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:00,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-06-25 09:24:00,548 INFO ]: Interpolant automaton has 35 states [2018-06-25 09:24:00,548 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 09:24:00,548 INFO ]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:24:00,548 INFO ]: Start difference. First operand 49 states and 56 transitions. Second operand 35 states. [2018-06-25 09:24:00,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:00,806 INFO ]: Finished difference Result 61 states and 66 transitions. [2018-06-25 09:24:00,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:24:00,807 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-25 09:24:00,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:00,807 INFO ]: With dead ends: 61 [2018-06-25 09:24:00,807 INFO ]: Without dead ends: 43 [2018-06-25 09:24:00,807 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:24:00,807 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:24:00,809 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-25 09:24:00,809 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 09:24:00,810 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-06-25 09:24:00,810 INFO ]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 28 [2018-06-25 09:24:00,810 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:00,810 INFO ]: Abstraction has 43 states and 48 transitions. [2018-06-25 09:24:00,810 INFO ]: Interpolant automaton has 35 states. [2018-06-25 09:24:00,810 INFO ]: Start isEmpty. Operand 43 states and 48 transitions. [2018-06-25 09:24:00,810 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:24:00,810 INFO ]: Found error trace [2018-06-25 09:24:00,810 INFO ]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:00,810 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:00,810 INFO ]: Analyzing trace with hash 1292524179, now seen corresponding path program 19 times [2018-06-25 09:24:00,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:00,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:00,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:00,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:00,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:00,820 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:01,400 INFO ]: Checked inductivity of 109 backedges. 23 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:01,400 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:01,400 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-25 09:24:01,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:01,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:01,435 INFO ]: Computing forward predicates... [2018-06-25 09:24:01,480 INFO ]: Checked inductivity of 109 backedges. 30 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:01,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:01,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 22 [2018-06-25 09:24:01,574 INFO ]: Interpolant automaton has 22 states [2018-06-25 09:24:01,575 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-25 09:24:01,575 INFO ]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:24:01,575 INFO ]: Start difference. First operand 43 states and 48 transitions. Second operand 22 states. [2018-06-25 09:24:01,646 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:01,647 INFO ]: Finished difference Result 45 states and 50 transitions. [2018-06-25 09:24:01,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:24:01,647 INFO ]: Start accepts. Automaton has 22 states. Word has length 28 [2018-06-25 09:24:01,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:01,647 INFO ]: With dead ends: 45 [2018-06-25 09:24:01,647 INFO ]: Without dead ends: 45 [2018-06-25 09:24:01,647 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:24:01,647 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:24:01,649 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 09:24:01,649 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 09:24:01,650 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-06-25 09:24:01,650 INFO ]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 28 [2018-06-25 09:24:01,650 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:01,650 INFO ]: Abstraction has 45 states and 50 transitions. [2018-06-25 09:24:01,650 INFO ]: Interpolant automaton has 22 states. [2018-06-25 09:24:01,650 INFO ]: Start isEmpty. Operand 45 states and 50 transitions. [2018-06-25 09:24:01,650 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:24:01,650 INFO ]: Found error trace [2018-06-25 09:24:01,650 INFO ]: trace histogram [14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:01,650 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:01,650 INFO ]: Analyzing trace with hash 1414370552, now seen corresponding path program 20 times [2018-06-25 09:24:01,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:01,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:01,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:01,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:01,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:01,665 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:01,927 INFO ]: Checked inductivity of 124 backedges. 2 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:01,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:01,927 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-25 09:24:01,940 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:24:01,961 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:24:01,961 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:01,963 INFO ]: Computing forward predicates... [2018-06-25 09:24:02,142 INFO ]: Checked inductivity of 124 backedges. 2 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:02,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:02,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2018-06-25 09:24:02,162 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:24:02,162 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:24:02,162 INFO ]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:24:02,163 INFO ]: Start difference. First operand 45 states and 50 transitions. Second operand 28 states. [2018-06-25 09:24:02,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:02,518 INFO ]: Finished difference Result 66 states and 73 transitions. [2018-06-25 09:24:02,519 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:24:02,519 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-25 09:24:02,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:02,520 INFO ]: With dead ends: 66 [2018-06-25 09:24:02,520 INFO ]: Without dead ends: 66 [2018-06-25 09:24:02,520 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:24:02,520 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 09:24:02,523 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-06-25 09:24:02,523 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 09:24:02,524 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-06-25 09:24:02,524 INFO ]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 29 [2018-06-25 09:24:02,524 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:02,524 INFO ]: Abstraction has 52 states and 59 transitions. [2018-06-25 09:24:02,524 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:24:02,524 INFO ]: Start isEmpty. Operand 52 states and 59 transitions. [2018-06-25 09:24:02,525 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:24:02,525 INFO ]: Found error trace [2018-06-25 09:24:02,525 INFO ]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:02,525 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:02,525 INFO ]: Analyzing trace with hash 896640819, now seen corresponding path program 21 times [2018-06-25 09:24:02,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:02,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:02,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:02,525 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:02,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:02,535 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:02,687 INFO ]: Checked inductivity of 140 backedges. 23 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:02,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:02,687 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-25 09:24:02,692 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:24:02,720 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:24:02,720 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:02,722 INFO ]: Computing forward predicates... [2018-06-25 09:24:02,816 INFO ]: Checked inductivity of 140 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:02,835 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:02,835 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2018-06-25 09:24:02,836 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:24:02,836 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:24:02,836 INFO ]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:24:02,836 INFO ]: Start difference. First operand 52 states and 59 transitions. Second operand 24 states. [2018-06-25 09:24:03,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:03,055 INFO ]: Finished difference Result 68 states and 75 transitions. [2018-06-25 09:24:03,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:24:03,056 INFO ]: Start accepts. Automaton has 24 states. Word has length 30 [2018-06-25 09:24:03,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:03,056 INFO ]: With dead ends: 68 [2018-06-25 09:24:03,056 INFO ]: Without dead ends: 46 [2018-06-25 09:24:03,056 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:24:03,056 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-25 09:24:03,058 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-25 09:24:03,058 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-25 09:24:03,058 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-06-25 09:24:03,059 INFO ]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 30 [2018-06-25 09:24:03,059 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:03,059 INFO ]: Abstraction has 46 states and 51 transitions. [2018-06-25 09:24:03,059 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:24:03,059 INFO ]: Start isEmpty. Operand 46 states and 51 transitions. [2018-06-25 09:24:03,059 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:24:03,059 INFO ]: Found error trace [2018-06-25 09:24:03,059 INFO ]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:03,059 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:03,059 INFO ]: Analyzing trace with hash -1690368151, now seen corresponding path program 22 times [2018-06-25 09:24:03,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:03,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:03,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:03,060 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:03,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:03,069 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:03,276 INFO ]: Checked inductivity of 140 backedges. 30 proven. 108 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:03,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:03,276 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-25 09:24:03,281 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:24:03,303 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:24:03,303 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:03,305 INFO ]: Computing forward predicates... [2018-06-25 09:24:03,378 INFO ]: Checked inductivity of 140 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:03,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:03,397 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2018-06-25 09:24:03,397 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:24:03,397 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:24:03,397 INFO ]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:24:03,397 INFO ]: Start difference. First operand 46 states and 51 transitions. Second operand 24 states. [2018-06-25 09:24:03,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:03,463 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-25 09:24:03,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 09:24:03,463 INFO ]: Start accepts. Automaton has 24 states. Word has length 30 [2018-06-25 09:24:03,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:03,464 INFO ]: With dead ends: 48 [2018-06-25 09:24:03,464 INFO ]: Without dead ends: 48 [2018-06-25 09:24:03,464 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:24:03,464 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 09:24:03,466 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-25 09:24:03,466 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-25 09:24:03,466 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-06-25 09:24:03,466 INFO ]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2018-06-25 09:24:03,466 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:03,466 INFO ]: Abstraction has 48 states and 53 transitions. [2018-06-25 09:24:03,466 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:24:03,466 INFO ]: Start isEmpty. Operand 48 states and 53 transitions. [2018-06-25 09:24:03,467 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 09:24:03,467 INFO ]: Found error trace [2018-06-25 09:24:03,467 INFO ]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:03,467 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:03,467 INFO ]: Analyzing trace with hash -860978462, now seen corresponding path program 23 times [2018-06-25 09:24:03,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:03,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:03,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:03,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:03,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:03,480 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:03,949 INFO ]: Checked inductivity of 157 backedges. 2 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:03,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:03,949 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-25 09:24:03,954 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:24:03,992 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-25 09:24:03,992 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:03,994 INFO ]: Computing forward predicates... [2018-06-25 09:24:04,209 INFO ]: Checked inductivity of 157 backedges. 2 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:04,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:04,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 31 [2018-06-25 09:24:04,229 INFO ]: Interpolant automaton has 31 states [2018-06-25 09:24:04,229 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-25 09:24:04,229 INFO ]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:24:04,230 INFO ]: Start difference. First operand 48 states and 53 transitions. Second operand 31 states. [2018-06-25 09:24:04,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:04,565 INFO ]: Finished difference Result 71 states and 78 transitions. [2018-06-25 09:24:04,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:24:04,566 INFO ]: Start accepts. Automaton has 31 states. Word has length 31 [2018-06-25 09:24:04,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:04,567 INFO ]: With dead ends: 71 [2018-06-25 09:24:04,567 INFO ]: Without dead ends: 71 [2018-06-25 09:24:04,567 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:24:04,567 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-25 09:24:04,569 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-06-25 09:24:04,569 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 09:24:04,571 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-06-25 09:24:04,571 INFO ]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 31 [2018-06-25 09:24:04,571 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:04,571 INFO ]: Abstraction has 55 states and 62 transitions. [2018-06-25 09:24:04,571 INFO ]: Interpolant automaton has 31 states. [2018-06-25 09:24:04,571 INFO ]: Start isEmpty. Operand 55 states and 62 transitions. [2018-06-25 09:24:04,572 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:24:04,572 INFO ]: Found error trace [2018-06-25 09:24:04,572 INFO ]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:04,572 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:04,572 INFO ]: Analyzing trace with hash -919701879, now seen corresponding path program 24 times [2018-06-25 09:24:04,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:04,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:04,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:04,573 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:04,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:04,582 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:04,804 INFO ]: Checked inductivity of 175 backedges. 30 proven. 143 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:04,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:04,804 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:04,810 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:24:04,856 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 09:24:04,856 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:04,859 INFO ]: Computing forward predicates... [2018-06-25 09:24:05,503 INFO ]: Checked inductivity of 175 backedges. 2 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:05,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:05,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-06-25 09:24:05,522 INFO ]: Interpolant automaton has 43 states [2018-06-25 09:24:05,522 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-25 09:24:05,522 INFO ]: CoverageRelationStatistics Valid=255, Invalid=1551, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:24:05,522 INFO ]: Start difference. First operand 55 states and 62 transitions. Second operand 43 states. [2018-06-25 09:24:06,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:06,108 INFO ]: Finished difference Result 71 states and 76 transitions. [2018-06-25 09:24:06,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:24:06,108 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-25 09:24:06,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:06,109 INFO ]: With dead ends: 71 [2018-06-25 09:24:06,109 INFO ]: Without dead ends: 49 [2018-06-25 09:24:06,109 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=389, Invalid=2581, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:24:06,109 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:24:06,110 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-25 09:24:06,110 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-25 09:24:06,111 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-06-25 09:24:06,111 INFO ]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 32 [2018-06-25 09:24:06,111 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:06,111 INFO ]: Abstraction has 49 states and 54 transitions. [2018-06-25 09:24:06,111 INFO ]: Interpolant automaton has 43 states. [2018-06-25 09:24:06,111 INFO ]: Start isEmpty. Operand 49 states and 54 transitions. [2018-06-25 09:24:06,111 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 09:24:06,111 INFO ]: Found error trace [2018-06-25 09:24:06,111 INFO ]: trace histogram [17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:06,112 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:06,112 INFO ]: Analyzing trace with hash 487398675, now seen corresponding path program 25 times [2018-06-25 09:24:06,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:06,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:06,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:06,112 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:06,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:06,121 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:06,327 INFO ]: Checked inductivity of 175 backedges. 38 proven. 135 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:06,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:06,327 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-25 09:24:06,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:06,357 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:06,359 INFO ]: Computing forward predicates... [2018-06-25 09:24:06,410 INFO ]: Checked inductivity of 175 backedges. 47 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:06,440 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:06,440 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 26 [2018-06-25 09:24:06,440 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:24:06,440 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:24:06,440 INFO ]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-06-25 09:24:06,440 INFO ]: Start difference. First operand 49 states and 54 transitions. Second operand 26 states. [2018-06-25 09:24:06,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:06,538 INFO ]: Finished difference Result 51 states and 56 transitions. [2018-06-25 09:24:06,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 09:24:06,538 INFO ]: Start accepts. Automaton has 26 states. Word has length 32 [2018-06-25 09:24:06,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:06,539 INFO ]: With dead ends: 51 [2018-06-25 09:24:06,539 INFO ]: Without dead ends: 51 [2018-06-25 09:24:06,539 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2018-06-25 09:24:06,539 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-25 09:24:06,541 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-25 09:24:06,541 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-25 09:24:06,541 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-06-25 09:24:06,541 INFO ]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 32 [2018-06-25 09:24:06,541 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:06,541 INFO ]: Abstraction has 51 states and 56 transitions. [2018-06-25 09:24:06,541 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:24:06,541 INFO ]: Start isEmpty. Operand 51 states and 56 transitions. [2018-06-25 09:24:06,542 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 09:24:06,542 INFO ]: Found error trace [2018-06-25 09:24:06,542 INFO ]: trace histogram [18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:06,542 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:06,542 INFO ]: Analyzing trace with hash -2069683592, now seen corresponding path program 26 times [2018-06-25 09:24:06,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:06,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:06,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:06,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:06,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:06,556 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:07,270 INFO ]: Checked inductivity of 194 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:07,270 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:07,270 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-25 09:24:07,276 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:24:07,301 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:24:07,301 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:07,304 INFO ]: Computing forward predicates... [2018-06-25 09:24:07,543 INFO ]: Checked inductivity of 194 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:07,562 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:07,562 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 34 [2018-06-25 09:24:07,562 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:24:07,562 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:24:07,563 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:24:07,563 INFO ]: Start difference. First operand 51 states and 56 transitions. Second operand 34 states. [2018-06-25 09:24:08,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:08,103 INFO ]: Finished difference Result 76 states and 83 transitions. [2018-06-25 09:24:08,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:24:08,103 INFO ]: Start accepts. Automaton has 34 states. Word has length 33 [2018-06-25 09:24:08,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:08,103 INFO ]: With dead ends: 76 [2018-06-25 09:24:08,103 INFO ]: Without dead ends: 76 [2018-06-25 09:24:08,104 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:24:08,104 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-25 09:24:08,106 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-06-25 09:24:08,106 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-25 09:24:08,106 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-06-25 09:24:08,106 INFO ]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 33 [2018-06-25 09:24:08,107 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:08,107 INFO ]: Abstraction has 58 states and 65 transitions. [2018-06-25 09:24:08,107 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:24:08,107 INFO ]: Start isEmpty. Operand 58 states and 65 transitions. [2018-06-25 09:24:08,107 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:24:08,107 INFO ]: Found error trace [2018-06-25 09:24:08,107 INFO ]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:08,107 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:08,107 INFO ]: Analyzing trace with hash 265144755, now seen corresponding path program 27 times [2018-06-25 09:24:08,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:08,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:08,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:08,108 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:08,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:08,119 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:08,587 INFO ]: Checked inductivity of 214 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:08,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:08,587 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-25 09:24:08,595 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:24:08,630 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-25 09:24:08,630 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:08,632 INFO ]: Computing forward predicates... [2018-06-25 09:24:08,681 INFO ]: Checked inductivity of 214 backedges. 57 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:08,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:08,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-06-25 09:24:08,700 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:24:08,700 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:24:08,700 INFO ]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:24:08,701 INFO ]: Start difference. First operand 58 states and 65 transitions. Second operand 28 states. [2018-06-25 09:24:09,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:09,479 INFO ]: Finished difference Result 78 states and 85 transitions. [2018-06-25 09:24:09,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 09:24:09,479 INFO ]: Start accepts. Automaton has 28 states. Word has length 34 [2018-06-25 09:24:09,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:09,480 INFO ]: With dead ends: 78 [2018-06-25 09:24:09,480 INFO ]: Without dead ends: 52 [2018-06-25 09:24:09,480 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=352, Invalid=1288, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:24:09,481 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-25 09:24:09,482 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-25 09:24:09,482 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 09:24:09,483 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-06-25 09:24:09,483 INFO ]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 34 [2018-06-25 09:24:09,483 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:09,483 INFO ]: Abstraction has 52 states and 57 transitions. [2018-06-25 09:24:09,483 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:24:09,483 INFO ]: Start isEmpty. Operand 52 states and 57 transitions. [2018-06-25 09:24:09,483 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 09:24:09,483 INFO ]: Found error trace [2018-06-25 09:24:09,483 INFO ]: trace histogram [19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:09,483 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:09,483 INFO ]: Analyzing trace with hash 935588969, now seen corresponding path program 28 times [2018-06-25 09:24:09,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:09,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:09,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:09,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:09,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:09,495 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:09,838 INFO ]: Checked inductivity of 214 backedges. 47 proven. 165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:09,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:09,838 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-25 09:24:09,844 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:24:09,868 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:24:09,868 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:09,870 INFO ]: Computing forward predicates... [2018-06-25 09:24:09,916 INFO ]: Checked inductivity of 214 backedges. 57 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:09,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:09,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-06-25 09:24:09,935 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:24:09,935 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:24:09,935 INFO ]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:24:09,935 INFO ]: Start difference. First operand 52 states and 57 transitions. Second operand 28 states. [2018-06-25 09:24:10,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:10,041 INFO ]: Finished difference Result 54 states and 59 transitions. [2018-06-25 09:24:10,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 09:24:10,041 INFO ]: Start accepts. Automaton has 28 states. Word has length 34 [2018-06-25 09:24:10,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:10,041 INFO ]: With dead ends: 54 [2018-06-25 09:24:10,041 INFO ]: Without dead ends: 54 [2018-06-25 09:24:10,042 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:24:10,042 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-25 09:24:10,043 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-25 09:24:10,043 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 09:24:10,045 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-06-25 09:24:10,045 INFO ]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2018-06-25 09:24:10,045 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:10,045 INFO ]: Abstraction has 54 states and 59 transitions. [2018-06-25 09:24:10,045 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:24:10,045 INFO ]: Start isEmpty. Operand 54 states and 59 transitions. [2018-06-25 09:24:10,046 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 09:24:10,046 INFO ]: Found error trace [2018-06-25 09:24:10,046 INFO ]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:10,046 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:10,046 INFO ]: Analyzing trace with hash -1060686366, now seen corresponding path program 29 times [2018-06-25 09:24:10,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:10,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:10,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:10,046 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:10,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:10,063 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:10,862 INFO ]: Checked inductivity of 235 backedges. 2 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:10,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:10,862 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-25 09:24:10,867 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:24:10,911 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-25 09:24:10,911 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:10,914 INFO ]: Computing forward predicates... [2018-06-25 09:24:11,271 INFO ]: Checked inductivity of 235 backedges. 2 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:11,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:11,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 37 [2018-06-25 09:24:11,291 INFO ]: Interpolant automaton has 37 states [2018-06-25 09:24:11,291 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-25 09:24:11,291 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1251, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:24:11,292 INFO ]: Start difference. First operand 54 states and 59 transitions. Second operand 37 states. [2018-06-25 09:24:11,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:11,725 INFO ]: Finished difference Result 81 states and 88 transitions. [2018-06-25 09:24:11,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:24:11,726 INFO ]: Start accepts. Automaton has 37 states. Word has length 35 [2018-06-25 09:24:11,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:11,726 INFO ]: With dead ends: 81 [2018-06-25 09:24:11,726 INFO ]: Without dead ends: 81 [2018-06-25 09:24:11,727 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:24:11,727 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-25 09:24:11,729 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 61. [2018-06-25 09:24:11,729 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-25 09:24:11,730 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-06-25 09:24:11,730 INFO ]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 35 [2018-06-25 09:24:11,730 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:11,730 INFO ]: Abstraction has 61 states and 68 transitions. [2018-06-25 09:24:11,730 INFO ]: Interpolant automaton has 37 states. [2018-06-25 09:24:11,730 INFO ]: Start isEmpty. Operand 61 states and 68 transitions. [2018-06-25 09:24:11,731 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:24:11,731 INFO ]: Found error trace [2018-06-25 09:24:11,731 INFO ]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:11,731 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:11,731 INFO ]: Analyzing trace with hash 1479287689, now seen corresponding path program 30 times [2018-06-25 09:24:11,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:11,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:11,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:11,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:11,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:11,741 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:12,088 INFO ]: Checked inductivity of 257 backedges. 47 proven. 208 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:12,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:12,088 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:12,094 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:24:12,131 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-25 09:24:12,131 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:12,133 INFO ]: Computing forward predicates... [2018-06-25 09:24:12,544 INFO ]: Checked inductivity of 257 backedges. 2 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:12,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:12,564 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2018-06-25 09:24:12,564 INFO ]: Interpolant automaton has 51 states [2018-06-25 09:24:12,564 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-25 09:24:12,565 INFO ]: CoverageRelationStatistics Valid=353, Invalid=2197, Unknown=0, NotChecked=0, Total=2550 [2018-06-25 09:24:12,565 INFO ]: Start difference. First operand 61 states and 68 transitions. Second operand 51 states. [2018-06-25 09:24:13,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:13,143 INFO ]: Finished difference Result 81 states and 86 transitions. [2018-06-25 09:24:13,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:24:13,143 INFO ]: Start accepts. Automaton has 51 states. Word has length 36 [2018-06-25 09:24:13,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:13,143 INFO ]: With dead ends: 81 [2018-06-25 09:24:13,143 INFO ]: Without dead ends: 55 [2018-06-25 09:24:13,144 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=524, Invalid=3636, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 09:24:13,145 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 09:24:13,146 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-25 09:24:13,147 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 09:24:13,147 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-06-25 09:24:13,147 INFO ]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 36 [2018-06-25 09:24:13,147 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:13,147 INFO ]: Abstraction has 55 states and 60 transitions. [2018-06-25 09:24:13,147 INFO ]: Interpolant automaton has 51 states. [2018-06-25 09:24:13,147 INFO ]: Start isEmpty. Operand 55 states and 60 transitions. [2018-06-25 09:24:13,148 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 09:24:13,148 INFO ]: Found error trace [2018-06-25 09:24:13,148 INFO ]: trace histogram [21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:13,148 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:13,148 INFO ]: Analyzing trace with hash 788221843, now seen corresponding path program 31 times [2018-06-25 09:24:13,148 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:13,148 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:13,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:13,148 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:13,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:13,161 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:13,945 INFO ]: Checked inductivity of 257 backedges. 57 proven. 198 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:13,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:13,946 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-25 09:24:13,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:13,978 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:13,981 INFO ]: Computing forward predicates... [2018-06-25 09:24:14,038 INFO ]: Checked inductivity of 257 backedges. 68 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:14,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:14,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 30 [2018-06-25 09:24:14,057 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:24:14,058 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:24:14,058 INFO ]: CoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:24:14,058 INFO ]: Start difference. First operand 55 states and 60 transitions. Second operand 30 states. [2018-06-25 09:24:14,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:14,135 INFO ]: Finished difference Result 57 states and 62 transitions. [2018-06-25 09:24:14,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 09:24:14,135 INFO ]: Start accepts. Automaton has 30 states. Word has length 36 [2018-06-25 09:24:14,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:14,136 INFO ]: With dead ends: 57 [2018-06-25 09:24:14,136 INFO ]: Without dead ends: 57 [2018-06-25 09:24:14,136 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:24:14,136 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-25 09:24:14,138 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-06-25 09:24:14,138 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 09:24:14,138 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-25 09:24:14,138 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 36 [2018-06-25 09:24:14,138 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:14,138 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-25 09:24:14,138 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:24:14,138 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-25 09:24:14,139 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 09:24:14,139 INFO ]: Found error trace [2018-06-25 09:24:14,139 INFO ]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:14,139 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:14,139 INFO ]: Analyzing trace with hash -1334099976, now seen corresponding path program 32 times [2018-06-25 09:24:14,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:14,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:14,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:14,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:14,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:14,154 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:15,194 INFO ]: Checked inductivity of 280 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:15,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:15,195 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-25 09:24:15,200 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:24:15,269 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:24:15,269 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:15,273 INFO ]: Computing forward predicates... [2018-06-25 09:24:15,657 INFO ]: Checked inductivity of 280 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:15,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:15,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 40 [2018-06-25 09:24:15,677 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:24:15,677 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:24:15,678 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1472, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:24:15,678 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 40 states. [2018-06-25 09:24:16,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:16,124 INFO ]: Finished difference Result 86 states and 93 transitions. [2018-06-25 09:24:16,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:24:16,126 INFO ]: Start accepts. Automaton has 40 states. Word has length 37 [2018-06-25 09:24:16,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:16,126 INFO ]: With dead ends: 86 [2018-06-25 09:24:16,126 INFO ]: Without dead ends: 86 [2018-06-25 09:24:16,127 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:24:16,127 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-25 09:24:16,129 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-06-25 09:24:16,129 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 09:24:16,130 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-06-25 09:24:16,130 INFO ]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 37 [2018-06-25 09:24:16,130 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:16,130 INFO ]: Abstraction has 64 states and 71 transitions. [2018-06-25 09:24:16,130 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:24:16,130 INFO ]: Start isEmpty. Operand 64 states and 71 transitions. [2018-06-25 09:24:16,130 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:24:16,130 INFO ]: Found error trace [2018-06-25 09:24:16,130 INFO ]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:16,131 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:16,131 INFO ]: Analyzing trace with hash 1593400371, now seen corresponding path program 33 times [2018-06-25 09:24:16,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:16,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:16,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:16,131 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:16,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:16,143 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:16,629 INFO ]: Checked inductivity of 304 backedges. 57 proven. 245 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:16,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:16,629 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-25 09:24:16,635 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:24:16,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-25 09:24:16,677 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:16,679 INFO ]: Computing forward predicates... [2018-06-25 09:24:16,735 INFO ]: Checked inductivity of 304 backedges. 80 proven. 222 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:16,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:16,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 32 [2018-06-25 09:24:16,755 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:24:16,755 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:24:16,756 INFO ]: CoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:24:16,756 INFO ]: Start difference. First operand 64 states and 71 transitions. Second operand 32 states. [2018-06-25 09:24:17,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:17,086 INFO ]: Finished difference Result 88 states and 95 transitions. [2018-06-25 09:24:17,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-25 09:24:17,087 INFO ]: Start accepts. Automaton has 32 states. Word has length 38 [2018-06-25 09:24:17,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:17,087 INFO ]: With dead ends: 88 [2018-06-25 09:24:17,087 INFO ]: Without dead ends: 58 [2018-06-25 09:24:17,088 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 09:24:17,088 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-25 09:24:17,090 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-06-25 09:24:17,090 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-25 09:24:17,090 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-06-25 09:24:17,090 INFO ]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 38 [2018-06-25 09:24:17,090 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:17,090 INFO ]: Abstraction has 58 states and 63 transitions. [2018-06-25 09:24:17,090 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:24:17,090 INFO ]: Start isEmpty. Operand 58 states and 63 transitions. [2018-06-25 09:24:17,091 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 09:24:17,091 INFO ]: Found error trace [2018-06-25 09:24:17,091 INFO ]: trace histogram [23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:17,091 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:17,091 INFO ]: Analyzing trace with hash 1645195625, now seen corresponding path program 34 times [2018-06-25 09:24:17,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:17,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:17,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:17,091 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:17,091 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:17,101 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:17,409 INFO ]: Checked inductivity of 304 backedges. 68 proven. 234 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:17,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:17,409 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-25 09:24:17,414 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:24:17,455 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:24:17,455 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:17,458 INFO ]: Computing forward predicates... [2018-06-25 09:24:17,635 INFO ]: Checked inductivity of 304 backedges. 80 proven. 222 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:17,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:17,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 32 [2018-06-25 09:24:17,654 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:24:17,654 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:24:17,654 INFO ]: CoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:24:17,654 INFO ]: Start difference. First operand 58 states and 63 transitions. Second operand 32 states. [2018-06-25 09:24:17,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:17,768 INFO ]: Finished difference Result 60 states and 65 transitions. [2018-06-25 09:24:17,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:24:17,768 INFO ]: Start accepts. Automaton has 32 states. Word has length 38 [2018-06-25 09:24:17,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:17,768 INFO ]: With dead ends: 60 [2018-06-25 09:24:17,768 INFO ]: Without dead ends: 60 [2018-06-25 09:24:17,769 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 09:24:17,769 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-25 09:24:17,771 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-25 09:24:17,771 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 09:24:17,771 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-06-25 09:24:17,771 INFO ]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 38 [2018-06-25 09:24:17,771 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:17,771 INFO ]: Abstraction has 60 states and 65 transitions. [2018-06-25 09:24:17,771 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:24:17,771 INFO ]: Start isEmpty. Operand 60 states and 65 transitions. [2018-06-25 09:24:17,772 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 09:24:17,772 INFO ]: Found error trace [2018-06-25 09:24:17,772 INFO ]: trace histogram [24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:17,772 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:17,772 INFO ]: Analyzing trace with hash -537716510, now seen corresponding path program 35 times [2018-06-25 09:24:17,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:17,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:17,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:17,773 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:17,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:17,787 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:19,003 INFO ]: Checked inductivity of 329 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:19,003 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:19,003 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-25 09:24:19,009 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:24:19,071 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-06-25 09:24:19,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:19,075 INFO ]: Computing forward predicates... [2018-06-25 09:24:19,906 INFO ]: Checked inductivity of 329 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:19,924 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:19,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 43 [2018-06-25 09:24:19,925 INFO ]: Interpolant automaton has 43 states [2018-06-25 09:24:19,925 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-25 09:24:19,925 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1711, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 09:24:19,925 INFO ]: Start difference. First operand 60 states and 65 transitions. Second operand 43 states. [2018-06-25 09:24:20,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:20,453 INFO ]: Finished difference Result 91 states and 98 transitions. [2018-06-25 09:24:20,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:24:20,454 INFO ]: Start accepts. Automaton has 43 states. Word has length 39 [2018-06-25 09:24:20,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:20,455 INFO ]: With dead ends: 91 [2018-06-25 09:24:20,455 INFO ]: Without dead ends: 91 [2018-06-25 09:24:20,455 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:24:20,456 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-25 09:24:20,458 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-06-25 09:24:20,458 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 09:24:20,459 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-06-25 09:24:20,459 INFO ]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 39 [2018-06-25 09:24:20,460 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:20,460 INFO ]: Abstraction has 67 states and 74 transitions. [2018-06-25 09:24:20,460 INFO ]: Interpolant automaton has 43 states. [2018-06-25 09:24:20,460 INFO ]: Start isEmpty. Operand 67 states and 74 transitions. [2018-06-25 09:24:20,461 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:24:20,461 INFO ]: Found error trace [2018-06-25 09:24:20,461 INFO ]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:20,461 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:20,461 INFO ]: Analyzing trace with hash 511484041, now seen corresponding path program 36 times [2018-06-25 09:24:20,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:20,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:20,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:20,465 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:20,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:20,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:21,218 INFO ]: Checked inductivity of 355 backedges. 68 proven. 285 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:21,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:21,218 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-25 09:24:21,225 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:24:21,268 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-25 09:24:21,268 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:21,271 INFO ]: Computing forward predicates... [2018-06-25 09:24:21,802 INFO ]: Checked inductivity of 355 backedges. 2 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:21,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:21,828 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2018-06-25 09:24:21,828 INFO ]: Interpolant automaton has 59 states [2018-06-25 09:24:21,828 INFO ]: Constructing interpolant automaton starting with 59 interpolants. [2018-06-25 09:24:21,829 INFO ]: CoverageRelationStatistics Valid=467, Invalid=2955, Unknown=0, NotChecked=0, Total=3422 [2018-06-25 09:24:21,829 INFO ]: Start difference. First operand 67 states and 74 transitions. Second operand 59 states. [2018-06-25 09:24:22,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:22,448 INFO ]: Finished difference Result 91 states and 96 transitions. [2018-06-25 09:24:22,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-25 09:24:22,449 INFO ]: Start accepts. Automaton has 59 states. Word has length 40 [2018-06-25 09:24:22,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:22,449 INFO ]: With dead ends: 91 [2018-06-25 09:24:22,449 INFO ]: Without dead ends: 61 [2018-06-25 09:24:22,450 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=679, Invalid=4871, Unknown=0, NotChecked=0, Total=5550 [2018-06-25 09:24:22,450 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 09:24:22,451 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-25 09:24:22,451 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-25 09:24:22,451 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-06-25 09:24:22,451 INFO ]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 40 [2018-06-25 09:24:22,451 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:22,451 INFO ]: Abstraction has 61 states and 66 transitions. [2018-06-25 09:24:22,451 INFO ]: Interpolant automaton has 59 states. [2018-06-25 09:24:22,451 INFO ]: Start isEmpty. Operand 61 states and 66 transitions. [2018-06-25 09:24:22,452 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:24:22,452 INFO ]: Found error trace [2018-06-25 09:24:22,452 INFO ]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:22,452 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:22,452 INFO ]: Analyzing trace with hash 2117136915, now seen corresponding path program 37 times [2018-06-25 09:24:22,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:22,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:22,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:22,453 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:22,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:22,462 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:23,232 INFO ]: Checked inductivity of 355 backedges. 80 proven. 273 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:23,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:23,232 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-25 09:24:23,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:23,269 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:23,272 INFO ]: Computing forward predicates... [2018-06-25 09:24:23,325 INFO ]: Checked inductivity of 355 backedges. 93 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:23,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:23,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 34 [2018-06-25 09:24:23,344 INFO ]: Interpolant automaton has 34 states [2018-06-25 09:24:23,344 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-25 09:24:23,344 INFO ]: CoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 09:24:23,344 INFO ]: Start difference. First operand 61 states and 66 transitions. Second operand 34 states. [2018-06-25 09:24:23,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:23,438 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-25 09:24:23,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 09:24:23,438 INFO ]: Start accepts. Automaton has 34 states. Word has length 40 [2018-06-25 09:24:23,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:23,438 INFO ]: With dead ends: 63 [2018-06-25 09:24:23,438 INFO ]: Without dead ends: 63 [2018-06-25 09:24:23,438 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 09:24:23,438 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-25 09:24:23,440 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-06-25 09:24:23,440 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-25 09:24:23,440 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-06-25 09:24:23,440 INFO ]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2018-06-25 09:24:23,440 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:23,440 INFO ]: Abstraction has 63 states and 68 transitions. [2018-06-25 09:24:23,440 INFO ]: Interpolant automaton has 34 states. [2018-06-25 09:24:23,440 INFO ]: Start isEmpty. Operand 63 states and 68 transitions. [2018-06-25 09:24:23,441 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:24:23,441 INFO ]: Found error trace [2018-06-25 09:24:23,441 INFO ]: trace histogram [26, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:23,441 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:23,441 INFO ]: Analyzing trace with hash 1207561592, now seen corresponding path program 38 times [2018-06-25 09:24:23,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:23,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:23,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:23,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:23,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:23,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:24,634 INFO ]: Checked inductivity of 382 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:24,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:24,634 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) [2018-06-25 09:24:24,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:24,703 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:24:24,703 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:24,707 INFO ]: Computing forward predicates... [2018-06-25 09:24:25,162 INFO ]: Checked inductivity of 382 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:25,180 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:25,180 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 46 [2018-06-25 09:24:25,180 INFO ]: Interpolant automaton has 46 states [2018-06-25 09:24:25,180 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-25 09:24:25,180 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1968, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 09:24:25,181 INFO ]: Start difference. First operand 63 states and 68 transitions. Second operand 46 states. [2018-06-25 09:24:25,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:25,762 INFO ]: Finished difference Result 96 states and 103 transitions. [2018-06-25 09:24:25,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:24:25,763 INFO ]: Start accepts. Automaton has 46 states. Word has length 41 [2018-06-25 09:24:25,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:25,763 INFO ]: With dead ends: 96 [2018-06-25 09:24:25,763 INFO ]: Without dead ends: 96 [2018-06-25 09:24:25,764 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 09:24:25,764 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-25 09:24:25,765 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 70. [2018-06-25 09:24:25,765 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 09:24:25,766 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-06-25 09:24:25,766 INFO ]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 41 [2018-06-25 09:24:25,766 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:25,766 INFO ]: Abstraction has 70 states and 77 transitions. [2018-06-25 09:24:25,766 INFO ]: Interpolant automaton has 46 states. [2018-06-25 09:24:25,766 INFO ]: Start isEmpty. Operand 70 states and 77 transitions. [2018-06-25 09:24:25,766 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:24:25,766 INFO ]: Found error trace [2018-06-25 09:24:25,766 INFO ]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:25,766 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:25,766 INFO ]: Analyzing trace with hash -1219469645, now seen corresponding path program 39 times [2018-06-25 09:24:25,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:25,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:25,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:25,767 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:25,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:25,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:26,364 INFO ]: Checked inductivity of 410 backedges. 80 proven. 328 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:26,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:26,364 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-25 09:24:26,369 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:24:26,416 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-25 09:24:26,416 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:26,418 INFO ]: Computing forward predicates... [2018-06-25 09:24:26,479 INFO ]: Checked inductivity of 410 backedges. 107 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:26,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:26,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-06-25 09:24:26,498 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:24:26,498 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:24:26,498 INFO ]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:24:26,499 INFO ]: Start difference. First operand 70 states and 77 transitions. Second operand 36 states. [2018-06-25 09:24:26,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:26,906 INFO ]: Finished difference Result 98 states and 105 transitions. [2018-06-25 09:24:26,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-25 09:24:26,906 INFO ]: Start accepts. Automaton has 36 states. Word has length 42 [2018-06-25 09:24:26,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:26,907 INFO ]: With dead ends: 98 [2018-06-25 09:24:26,907 INFO ]: Without dead ends: 64 [2018-06-25 09:24:26,907 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=592, Invalid=2164, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 09:24:26,907 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 09:24:26,909 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-25 09:24:26,909 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 09:24:26,909 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-06-25 09:24:26,909 INFO ]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 42 [2018-06-25 09:24:26,909 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:26,909 INFO ]: Abstraction has 64 states and 69 transitions. [2018-06-25 09:24:26,909 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:24:26,909 INFO ]: Start isEmpty. Operand 64 states and 69 transitions. [2018-06-25 09:24:26,910 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:24:26,910 INFO ]: Found error trace [2018-06-25 09:24:26,910 INFO ]: trace histogram [27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:26,910 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:26,910 INFO ]: Analyzing trace with hash 1311129193, now seen corresponding path program 40 times [2018-06-25 09:24:26,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:26,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:26,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:26,910 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:26,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:26,918 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:27,262 INFO ]: Checked inductivity of 410 backedges. 93 proven. 315 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:27,262 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:27,262 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-25 09:24:27,267 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:24:27,300 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:24:27,300 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:27,303 INFO ]: Computing forward predicates... [2018-06-25 09:24:27,465 INFO ]: Checked inductivity of 410 backedges. 107 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:27,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:27,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-06-25 09:24:27,483 INFO ]: Interpolant automaton has 36 states [2018-06-25 09:24:27,483 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-25 09:24:27,484 INFO ]: CoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2018-06-25 09:24:27,484 INFO ]: Start difference. First operand 64 states and 69 transitions. Second operand 36 states. [2018-06-25 09:24:27,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:27,625 INFO ]: Finished difference Result 66 states and 71 transitions. [2018-06-25 09:24:27,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:24:27,625 INFO ]: Start accepts. Automaton has 36 states. Word has length 42 [2018-06-25 09:24:27,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:27,626 INFO ]: With dead ends: 66 [2018-06-25 09:24:27,626 INFO ]: Without dead ends: 66 [2018-06-25 09:24:27,626 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:24:27,626 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-25 09:24:27,628 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-25 09:24:27,628 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 09:24:27,628 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-06-25 09:24:27,628 INFO ]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 42 [2018-06-25 09:24:27,628 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:27,628 INFO ]: Abstraction has 66 states and 71 transitions. [2018-06-25 09:24:27,628 INFO ]: Interpolant automaton has 36 states. [2018-06-25 09:24:27,628 INFO ]: Start isEmpty. Operand 66 states and 71 transitions. [2018-06-25 09:24:27,628 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-25 09:24:27,628 INFO ]: Found error trace [2018-06-25 09:24:27,628 INFO ]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:27,628 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:27,628 INFO ]: Analyzing trace with hash 1991125986, now seen corresponding path program 41 times [2018-06-25 09:24:27,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:27,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:27,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:27,629 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:27,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:27,641 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:28,356 INFO ]: Checked inductivity of 439 backedges. 2 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:28,357 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:28,357 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-25 09:24:28,364 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:24:28,419 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-25 09:24:28,419 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:28,422 INFO ]: Computing forward predicates... [2018-06-25 09:24:29,087 INFO ]: Checked inductivity of 439 backedges. 2 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:29,106 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:29,106 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 49 [2018-06-25 09:24:29,106 INFO ]: Interpolant automaton has 49 states [2018-06-25 09:24:29,107 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-25 09:24:29,107 INFO ]: CoverageRelationStatistics Valid=109, Invalid=2243, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 09:24:29,107 INFO ]: Start difference. First operand 66 states and 71 transitions. Second operand 49 states. [2018-06-25 09:24:29,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:29,781 INFO ]: Finished difference Result 101 states and 108 transitions. [2018-06-25 09:24:29,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:24:29,782 INFO ]: Start accepts. Automaton has 49 states. Word has length 43 [2018-06-25 09:24:29,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:29,782 INFO ]: With dead ends: 101 [2018-06-25 09:24:29,782 INFO ]: Without dead ends: 101 [2018-06-25 09:24:29,783 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:24:29,783 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-25 09:24:29,785 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 73. [2018-06-25 09:24:29,785 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-25 09:24:29,786 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-06-25 09:24:29,786 INFO ]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 43 [2018-06-25 09:24:29,786 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:29,786 INFO ]: Abstraction has 73 states and 80 transitions. [2018-06-25 09:24:29,786 INFO ]: Interpolant automaton has 49 states. [2018-06-25 09:24:29,786 INFO ]: Start isEmpty. Operand 73 states and 80 transitions. [2018-06-25 09:24:29,786 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:24:29,786 INFO ]: Found error trace [2018-06-25 09:24:29,786 INFO ]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:29,786 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:29,787 INFO ]: Analyzing trace with hash 1596190089, now seen corresponding path program 42 times [2018-06-25 09:24:29,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:29,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:29,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:29,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:29,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:29,796 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:30,416 INFO ]: Checked inductivity of 469 backedges. 93 proven. 374 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:30,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:30,416 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-25 09:24:30,422 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:24:30,474 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-25 09:24:30,474 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:30,477 INFO ]: Computing forward predicates... [2018-06-25 09:24:31,179 INFO ]: Checked inductivity of 469 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:31,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:31,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-06-25 09:24:31,199 INFO ]: Interpolant automaton has 67 states [2018-06-25 09:24:31,199 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-25 09:24:31,200 INFO ]: CoverageRelationStatistics Valid=597, Invalid=3825, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 09:24:31,200 INFO ]: Start difference. First operand 73 states and 80 transitions. Second operand 67 states. [2018-06-25 09:24:31,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:31,699 INFO ]: Finished difference Result 101 states and 106 transitions. [2018-06-25 09:24:31,699 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 09:24:31,699 INFO ]: Start accepts. Automaton has 67 states. Word has length 44 [2018-06-25 09:24:31,699 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:31,699 INFO ]: With dead ends: 101 [2018-06-25 09:24:31,699 INFO ]: Without dead ends: 67 [2018-06-25 09:24:31,700 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=854, Invalid=6286, Unknown=0, NotChecked=0, Total=7140 [2018-06-25 09:24:31,700 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-25 09:24:31,702 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-25 09:24:31,702 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 09:24:31,702 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-06-25 09:24:31,702 INFO ]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 44 [2018-06-25 09:24:31,702 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:31,702 INFO ]: Abstraction has 67 states and 72 transitions. [2018-06-25 09:24:31,702 INFO ]: Interpolant automaton has 67 states. [2018-06-25 09:24:31,702 INFO ]: Start isEmpty. Operand 67 states and 72 transitions. [2018-06-25 09:24:31,703 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-25 09:24:31,703 INFO ]: Found error trace [2018-06-25 09:24:31,703 INFO ]: trace histogram [29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:31,703 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:31,703 INFO ]: Analyzing trace with hash -1559624557, now seen corresponding path program 43 times [2018-06-25 09:24:31,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:31,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:31,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:31,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:31,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:31,713 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:32,242 INFO ]: Checked inductivity of 469 backedges. 93 proven. 374 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:32,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:32,242 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-25 09:24:32,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:32,282 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:32,285 INFO ]: Computing forward predicates... [2018-06-25 09:24:32,364 INFO ]: Checked inductivity of 469 backedges. 122 proven. 345 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:32,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:32,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 39 [2018-06-25 09:24:32,383 INFO ]: Interpolant automaton has 39 states [2018-06-25 09:24:32,384 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-25 09:24:32,384 INFO ]: CoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:24:32,384 INFO ]: Start difference. First operand 67 states and 72 transitions. Second operand 39 states. [2018-06-25 09:24:32,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:32,663 INFO ]: Finished difference Result 69 states and 74 transitions. [2018-06-25 09:24:32,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 09:24:32,663 INFO ]: Start accepts. Automaton has 39 states. Word has length 44 [2018-06-25 09:24:32,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:32,663 INFO ]: With dead ends: 69 [2018-06-25 09:24:32,663 INFO ]: Without dead ends: 69 [2018-06-25 09:24:32,664 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:24:32,664 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-25 09:24:32,665 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-06-25 09:24:32,665 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 09:24:32,665 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-06-25 09:24:32,665 INFO ]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 44 [2018-06-25 09:24:32,665 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:32,665 INFO ]: Abstraction has 69 states and 74 transitions. [2018-06-25 09:24:32,665 INFO ]: Interpolant automaton has 39 states. [2018-06-25 09:24:32,665 INFO ]: Start isEmpty. Operand 69 states and 74 transitions. [2018-06-25 09:24:32,666 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:24:32,666 INFO ]: Found error trace [2018-06-25 09:24:32,666 INFO ]: trace histogram [30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:32,666 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:32,666 INFO ]: Analyzing trace with hash -1102894344, now seen corresponding path program 44 times [2018-06-25 09:24:32,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:32,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:32,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:32,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:24:32,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:32,685 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:33,629 INFO ]: Checked inductivity of 500 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:33,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:33,629 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-25 09:24:33,635 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:24:33,673 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:24:33,673 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:33,676 INFO ]: Computing forward predicates... [2018-06-25 09:24:34,271 INFO ]: Checked inductivity of 500 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:34,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:34,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 52 [2018-06-25 09:24:34,290 INFO ]: Interpolant automaton has 52 states [2018-06-25 09:24:34,290 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-25 09:24:34,291 INFO ]: CoverageRelationStatistics Valid=116, Invalid=2536, Unknown=0, NotChecked=0, Total=2652 [2018-06-25 09:24:34,291 INFO ]: Start difference. First operand 69 states and 74 transitions. Second operand 52 states. [2018-06-25 09:24:35,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:35,118 INFO ]: Finished difference Result 106 states and 113 transitions. [2018-06-25 09:24:35,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 09:24:35,119 INFO ]: Start accepts. Automaton has 52 states. Word has length 45 [2018-06-25 09:24:35,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:35,119 INFO ]: With dead ends: 106 [2018-06-25 09:24:35,119 INFO ]: Without dead ends: 106 [2018-06-25 09:24:35,119 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:24:35,120 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-25 09:24:35,122 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 76. [2018-06-25 09:24:35,122 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-25 09:24:35,123 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-06-25 09:24:35,123 INFO ]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 45 [2018-06-25 09:24:35,123 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:35,123 INFO ]: Abstraction has 76 states and 83 transitions. [2018-06-25 09:24:35,123 INFO ]: Interpolant automaton has 52 states. [2018-06-25 09:24:35,123 INFO ]: Start isEmpty. Operand 76 states and 83 transitions. [2018-06-25 09:24:35,124 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:24:35,124 INFO ]: Found error trace [2018-06-25 09:24:35,124 INFO ]: trace histogram [31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:35,124 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:35,124 INFO ]: Analyzing trace with hash 170840371, now seen corresponding path program 45 times [2018-06-25 09:24:35,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:35,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:35,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:35,125 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:35,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:35,136 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:36,058 INFO ]: Checked inductivity of 532 backedges. 107 proven. 423 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:36,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:36,058 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:36,063 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:24:36,121 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-06-25 09:24:36,121 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:36,124 INFO ]: Computing forward predicates... [2018-06-25 09:24:36,244 INFO ]: Checked inductivity of 532 backedges. 138 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:36,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:36,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 41 [2018-06-25 09:24:36,264 INFO ]: Interpolant automaton has 41 states [2018-06-25 09:24:36,264 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 09:24:36,264 INFO ]: CoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:24:36,264 INFO ]: Start difference. First operand 76 states and 83 transitions. Second operand 41 states. [2018-06-25 09:24:36,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:36,645 INFO ]: Finished difference Result 108 states and 115 transitions. [2018-06-25 09:24:36,646 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-25 09:24:36,646 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-25 09:24:36,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:36,647 INFO ]: With dead ends: 108 [2018-06-25 09:24:36,647 INFO ]: Without dead ends: 70 [2018-06-25 09:24:36,648 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=756, Invalid=2784, Unknown=0, NotChecked=0, Total=3540 [2018-06-25 09:24:36,648 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-25 09:24:36,650 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-25 09:24:36,650 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 09:24:36,650 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-06-25 09:24:36,650 INFO ]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 46 [2018-06-25 09:24:36,650 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:36,650 INFO ]: Abstraction has 70 states and 75 transitions. [2018-06-25 09:24:36,650 INFO ]: Interpolant automaton has 41 states. [2018-06-25 09:24:36,650 INFO ]: Start isEmpty. Operand 70 states and 75 transitions. [2018-06-25 09:24:36,651 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-25 09:24:36,651 INFO ]: Found error trace [2018-06-25 09:24:36,651 INFO ]: trace histogram [31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:36,651 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:36,651 INFO ]: Analyzing trace with hash 1124834153, now seen corresponding path program 46 times [2018-06-25 09:24:36,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:36,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:36,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:36,651 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:36,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:36,661 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:37,074 INFO ]: Checked inductivity of 532 backedges. 107 proven. 423 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:37,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:37,087 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:37,092 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:24:37,132 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:24:37,132 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:37,134 INFO ]: Computing forward predicates... [2018-06-25 09:24:37,215 INFO ]: Checked inductivity of 532 backedges. 138 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:37,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:37,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 41 [2018-06-25 09:24:37,234 INFO ]: Interpolant automaton has 41 states [2018-06-25 09:24:37,234 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-25 09:24:37,234 INFO ]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 09:24:37,234 INFO ]: Start difference. First operand 70 states and 75 transitions. Second operand 41 states. [2018-06-25 09:24:37,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:37,447 INFO ]: Finished difference Result 72 states and 77 transitions. [2018-06-25 09:24:37,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-25 09:24:37,447 INFO ]: Start accepts. Automaton has 41 states. Word has length 46 [2018-06-25 09:24:37,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:37,447 INFO ]: With dead ends: 72 [2018-06-25 09:24:37,447 INFO ]: Without dead ends: 72 [2018-06-25 09:24:37,448 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 09:24:37,448 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-25 09:24:37,449 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-25 09:24:37,449 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 09:24:37,450 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-06-25 09:24:37,450 INFO ]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 46 [2018-06-25 09:24:37,450 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:37,450 INFO ]: Abstraction has 72 states and 77 transitions. [2018-06-25 09:24:37,450 INFO ]: Interpolant automaton has 41 states. [2018-06-25 09:24:37,450 INFO ]: Start isEmpty. Operand 72 states and 77 transitions. [2018-06-25 09:24:37,450 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-25 09:24:37,450 INFO ]: Found error trace [2018-06-25 09:24:37,450 INFO ]: trace histogram [32, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:37,450 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:37,451 INFO ]: Analyzing trace with hash 510947042, now seen corresponding path program 47 times [2018-06-25 09:24:37,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:37,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:37,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:37,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:37,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:37,464 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:38,328 INFO ]: Checked inductivity of 565 backedges. 2 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:38,328 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:38,328 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:38,333 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:24:38,389 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-25 09:24:38,389 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:38,394 INFO ]: Computing forward predicates... [2018-06-25 09:24:39,043 INFO ]: Checked inductivity of 565 backedges. 2 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:39,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:39,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 55 [2018-06-25 09:24:39,063 INFO ]: Interpolant automaton has 55 states [2018-06-25 09:24:39,063 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-25 09:24:39,063 INFO ]: CoverageRelationStatistics Valid=123, Invalid=2847, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 09:24:39,063 INFO ]: Start difference. First operand 72 states and 77 transitions. Second operand 55 states. [2018-06-25 09:24:39,923 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:24:39,923 INFO ]: Finished difference Result 111 states and 118 transitions. [2018-06-25 09:24:39,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 09:24:39,923 INFO ]: Start accepts. Automaton has 55 states. Word has length 47 [2018-06-25 09:24:39,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:24:39,924 INFO ]: With dead ends: 111 [2018-06-25 09:24:39,924 INFO ]: Without dead ends: 111 [2018-06-25 09:24:39,924 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=167, Invalid=3139, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 09:24:39,924 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-25 09:24:39,927 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 79. [2018-06-25 09:24:39,928 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-25 09:24:39,928 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-06-25 09:24:39,928 INFO ]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 47 [2018-06-25 09:24:39,928 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:24:39,928 INFO ]: Abstraction has 79 states and 86 transitions. [2018-06-25 09:24:39,928 INFO ]: Interpolant automaton has 55 states. [2018-06-25 09:24:39,928 INFO ]: Start isEmpty. Operand 79 states and 86 transitions. [2018-06-25 09:24:39,929 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-25 09:24:39,929 INFO ]: Found error trace [2018-06-25 09:24:39,929 INFO ]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:24:39,929 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:24:39,929 INFO ]: Analyzing trace with hash -1339684215, now seen corresponding path program 48 times [2018-06-25 09:24:39,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:24:39,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:24:39,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:39,929 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:24:39,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:24:39,937 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:40,623 INFO ]: Checked inductivity of 599 backedges. 122 proven. 475 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:40,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:24:40,623 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:24:40,630 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:24:40,791 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-06-25 09:24:40,791 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:24:40,795 INFO ]: Computing forward predicates... [2018-06-25 09:24:41,649 INFO ]: Checked inductivity of 599 backedges. 2 proven. 595 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:24:41,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:24:41,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 75 [2018-06-25 09:24:41,670 INFO ]: Interpolant automaton has 75 states [2018-06-25 09:24:41,670 INFO ]: Constructing interpolant automaton starting with 75 interpolants. [2018-06-25 09:24:41,670 INFO ]: CoverageRelationStatistics Valid=743, Invalid=4807, Unknown=0, NotChecked=0, Total=5550 [2018-06-25 09:24:41,670 INFO ]: Start difference. First operand 79 states and 86 transitions. Second operand 75 states. [2018-06-25 09:24:42,964 WARN ]: Spent 157.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 Received shutdown request... [2018-06-25 09:24:43,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 09:24:43,728 WARN ]: Verification canceled [2018-06-25 09:24:43,731 WARN ]: Timeout [2018-06-25 09:24:43,731 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:24:43 BoogieIcfgContainer [2018-06-25 09:24:43,731 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:24:43,732 INFO ]: Toolchain (without parser) took 57384.69 ms. Allocated memory was 308.8 MB in the beginning and 610.8 MB in the end (delta: 302.0 MB). Free memory was 265.9 MB in the beginning and 572.4 MB in the end (delta: -306.5 MB). Peak memory consumption was 380.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:24:43,733 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:24:43,733 INFO ]: ChcToBoogie took 49.30 ms. Allocated memory is still 308.8 MB. Free memory was 265.9 MB in the beginning and 263.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:24:43,734 INFO ]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 308.8 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:24:43,734 INFO ]: RCFGBuilder took 198.88 ms. Allocated memory is still 308.8 MB. Free memory was 261.9 MB in the beginning and 256.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 3.6 GB. [2018-06-25 09:24:43,734 INFO ]: TraceAbstraction took 57095.82 ms. Allocated memory was 308.8 MB in the beginning and 610.8 MB in the end (delta: 302.0 MB). Free memory was 256.3 MB in the beginning and 572.4 MB in the end (delta: -316.1 MB). Peak memory consumption was 371.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:24:43,737 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.30 ms. Allocated memory is still 308.8 MB. Free memory was 265.9 MB in the beginning and 263.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 308.8 MB. Free memory was 263.9 MB in the beginning and 261.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 198.88 ms. Allocated memory is still 308.8 MB. Free memory was 261.9 MB in the beginning and 256.3 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57095.82 ms. Allocated memory was 308.8 MB in the beginning and 610.8 MB in the end (delta: 302.0 MB). Free memory was 256.3 MB in the beginning and 572.4 MB in the end (delta: -316.1 MB). Peak memory consumption was 371.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 34 states, 75 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 88 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. TIMEOUT Result, 57.0s OverallTime, 50 OverallIterations, 33 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 454 SDtfs, 1010 SDslu, 5655 SDs, 0 SdLazy, 21522 SolverSat, 957 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2886 GetRequests, 1137 SyntacticMatches, 71 SemanticMatches, 1677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15252 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=49, 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, 283 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 3095 NumberOfCodeBlocks, 3095 NumberOfCodeBlocksAsserted, 338 NumberOfCheckSat, 2996 ConstructedInterpolants, 0 QuantifiedInterpolants, 402621 SizeOfPredicates, 185 NumberOfNonLiveVariables, 11300 ConjunctsInSsa, 3205 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 2986/20836 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/copy_intro.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-24-43-746.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copy_intro.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-24-43-746.csv Completed graceful shutdown