java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:13:45,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:13:45,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:13:45,827 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:13:45,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:13:45,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:13:45,829 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:13:45,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:13:45,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:13:45,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:13:45,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:13:45,835 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:13:45,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:13:45,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:13:45,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:13:45,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:13:45,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:13:45,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:13:45,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:13:45,845 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:13:45,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:13:45,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:13:45,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:13:45,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:13:45,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:13:45,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:13:45,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:13:45,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:13:45,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:13:45,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:13:45,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:13:45,855 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:13:45,855 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:13:45,856 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:13:45,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:13:45,857 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:13:45,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:13:45,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:13:45,882 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:13:45,882 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:13:45,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:13:45,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:13:45,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:13:45,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:13:45,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:13:45,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:13:45,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:13:45,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:13:45,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:13:45,885 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:13:45,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:13:45,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:13:45,886 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:13:45,887 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:13:45,887 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:13:45,942 INFO ]: Repository-Root is: /tmp [2018-06-22 01:13:45,959 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:13:45,966 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:13:45,967 INFO ]: Initializing SmtParser... [2018-06-22 01:13:45,968 INFO ]: SmtParser initialized [2018-06-22 01:13:45,969 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 [2018-06-22 01:13:45,970 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:13:46,067 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 unknown [2018-06-22 01:13:46,321 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 [2018-06-22 01:13:46,326 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:13:46,332 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:13:46,333 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:13:46,333 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:13:46,333 INFO ]: ChcToBoogie initialized [2018-06-22 01:13:46,336 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,401 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46 Unit [2018-06-22 01:13:46,401 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:13:46,402 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:13:46,402 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:13:46,402 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:13:46,424 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,424 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,431 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,431 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,437 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,447 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,449 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (1/1) ... [2018-06-22 01:13:46,450 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:13:46,451 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:13:46,451 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:13:46,451 INFO ]: RCFGBuilder initialized [2018-06-22 01:13:46,452 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13: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-22 01:13:46,476 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:13:46,476 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:13:46,476 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:13:46,476 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:13:46,476 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:13:46,476 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:13:46,868 INFO ]: Using library mode [2018-06-22 01:13:46,869 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:13:46 BoogieIcfgContainer [2018-06-22 01:13:46,869 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:13:46,871 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:13:46,871 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:13:46,878 INFO ]: TraceAbstraction initialized [2018-06-22 01:13:46,878 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:13:46" (1/3) ... [2018-06-22 01:13:46,879 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa1797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:13:46, skipping insertion in model container [2018-06-22 01:13:46,879 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:13:46" (2/3) ... [2018-06-22 01:13:46,879 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa1797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:13:46, skipping insertion in model container [2018-06-22 01:13:46,879 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:13:46" (3/3) ... [2018-06-22 01:13:46,880 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:13:46,887 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:13:46,895 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:13:46,933 INFO ]: Using default assertion order modulation [2018-06-22 01:13:46,933 INFO ]: Interprodecural is true [2018-06-22 01:13:46,933 INFO ]: Hoare is false [2018-06-22 01:13:46,933 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:13:46,934 INFO ]: Backedges is TWOTRACK [2018-06-22 01:13:46,934 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:13:46,934 INFO ]: Difference is false [2018-06-22 01:13:46,934 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:13:46,934 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:13:46,950 INFO ]: Start isEmpty. Operand 17 states. [2018-06-22 01:13:46,961 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:13:46,962 INFO ]: Found error trace [2018-06-22 01:13:46,962 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:46,962 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:46,966 INFO ]: Analyzing trace with hash 442027982, now seen corresponding path program 1 times [2018-06-22 01:13:46,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:46,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:47,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:47,001 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,050 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,128 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,131 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:47,131 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:13:47,132 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:13:47,142 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:13:47,143 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:13:47,144 INFO ]: Start difference. First operand 17 states. Second operand 4 states. [2018-06-22 01:13:47,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:47,243 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-22 01:13:47,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:13:47,244 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:13:47,244 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:47,253 INFO ]: With dead ends: 21 [2018-06-22 01:13:47,253 INFO ]: Without dead ends: 21 [2018-06-22 01:13:47,255 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-22 01:13:47,272 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:13:47,293 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-22 01:13:47,294 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:13:47,295 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-22 01:13:47,297 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 9 [2018-06-22 01:13:47,298 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:47,298 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-22 01:13:47,298 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:13:47,298 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-22 01:13:47,299 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:13:47,299 INFO ]: Found error trace [2018-06-22 01:13:47,299 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:47,299 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:47,299 INFO ]: Analyzing trace with hash -1811957904, now seen corresponding path program 1 times [2018-06-22 01:13:47,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:47,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:47,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:47,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,517 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:47,517 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:13:47,519 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:13:47,519 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:13:47,519 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:13:47,519 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 4 states. [2018-06-22 01:13:47,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:47,693 INFO ]: Finished difference Result 23 states and 31 transitions. [2018-06-22 01:13:47,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:13:47,693 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:13:47,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:47,694 INFO ]: With dead ends: 23 [2018-06-22 01:13:47,694 INFO ]: Without dead ends: 23 [2018-06-22 01:13:47,695 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:47,695 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 01:13:47,698 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-22 01:13:47,698 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:13:47,698 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-22 01:13:47,698 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2018-06-22 01:13:47,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:47,698 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-22 01:13:47,698 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:13:47,698 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-22 01:13:47,699 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:13:47,699 INFO ]: Found error trace [2018-06-22 01:13:47,699 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:47,699 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:47,699 INFO ]: Analyzing trace with hash 758586502, now seen corresponding path program 1 times [2018-06-22 01:13:47,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:47,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:47,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:47,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:47,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,900 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:47,900 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:47,900 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:47,910 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:47,931 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:47,937 INFO ]: Computing forward predicates... [2018-06-22 01:13:48,144 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:13:48,280 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:13:48,432 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:48,452 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:48,452 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:13:48,452 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:13:48,453 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:13:48,453 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:13:48,453 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 8 states. [2018-06-22 01:13:48,600 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-06-22 01:13:48,738 WARN ]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-06-22 01:13:49,251 WARN ]: Spent 446.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-06-22 01:13:49,423 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-06-22 01:13:49,432 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:49,432 INFO ]: Finished difference Result 21 states and 28 transitions. [2018-06-22 01:13:49,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:49,432 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:13:49,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:49,433 INFO ]: With dead ends: 21 [2018-06-22 01:13:49,433 INFO ]: Without dead ends: 17 [2018-06-22 01:13:49,433 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:13:49,433 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:13:49,435 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 01:13:49,435 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 01:13:49,436 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-22 01:13:49,436 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 10 [2018-06-22 01:13:49,436 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:49,436 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-22 01:13:49,436 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:13:49,436 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-22 01:13:49,436 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:13:49,436 INFO ]: Found error trace [2018-06-22 01:13:49,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:49,436 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:49,436 INFO ]: Analyzing trace with hash -387187539, now seen corresponding path program 1 times [2018-06-22 01:13:49,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:49,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:49,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:49,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,452 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:49,531 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:49,531 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:49,531 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:49,538 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:49,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:49,570 INFO ]: Computing forward predicates... [2018-06-22 01:13:49,647 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:49,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:49,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:13:49,669 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:13:49,669 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:13:49,669 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:49,670 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 7 states. [2018-06-22 01:13:49,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:49,738 INFO ]: Finished difference Result 22 states and 29 transitions. [2018-06-22 01:13:49,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:49,739 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-22 01:13:49,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:49,740 INFO ]: With dead ends: 22 [2018-06-22 01:13:49,740 INFO ]: Without dead ends: 22 [2018-06-22 01:13:49,740 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:49,740 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 01:13:49,742 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-22 01:13:49,742 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 01:13:49,743 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-22 01:13:49,743 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2018-06-22 01:13:49,743 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:49,743 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-22 01:13:49,743 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:13:49,743 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-22 01:13:49,743 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:13:49,743 INFO ]: Found error trace [2018-06-22 01:13:49,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:49,743 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:49,743 INFO ]: Analyzing trace with hash 893002866, now seen corresponding path program 1 times [2018-06-22 01:13:49,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:49,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:49,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:49,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:49,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:49,885 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:49,885 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:49,885 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:13:49,885 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:13:49,885 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:13:49,885 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:13:49,885 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 6 states. [2018-06-22 01:13:50,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:50,014 INFO ]: Finished difference Result 35 states and 50 transitions. [2018-06-22 01:13:50,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:50,015 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:13:50,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:50,017 INFO ]: With dead ends: 35 [2018-06-22 01:13:50,017 INFO ]: Without dead ends: 33 [2018-06-22 01:13:50,017 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:50,017 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 01:13:50,021 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-06-22 01:13:50,021 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:13:50,021 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-22 01:13:50,021 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-06-22 01:13:50,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:50,021 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-22 01:13:50,022 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:13:50,022 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-22 01:13:50,022 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:13:50,022 INFO ]: Found error trace [2018-06-22 01:13:50,022 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:50,022 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:50,022 INFO ]: Analyzing trace with hash -117923754, now seen corresponding path program 1 times [2018-06-22 01:13:50,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:50,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:50,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,023 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:50,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,087 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,087 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:50,087 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:13:50,087 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:13:50,087 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:13:50,087 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:13:50,087 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 6 states. [2018-06-22 01:13:50,163 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:50,163 INFO ]: Finished difference Result 32 states and 45 transitions. [2018-06-22 01:13:50,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:50,163 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-22 01:13:50,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:50,164 INFO ]: With dead ends: 32 [2018-06-22 01:13:50,164 INFO ]: Without dead ends: 32 [2018-06-22 01:13:50,164 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:50,165 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:13:50,169 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-06-22 01:13:50,169 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:50,170 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2018-06-22 01:13:50,170 INFO ]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 11 [2018-06-22 01:13:50,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:50,170 INFO ]: Abstraction has 23 states and 34 transitions. [2018-06-22 01:13:50,170 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:13:50,170 INFO ]: Start isEmpty. Operand 23 states and 34 transitions. [2018-06-22 01:13:50,170 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:13:50,170 INFO ]: Found error trace [2018-06-22 01:13:50,170 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:50,171 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:50,171 INFO ]: Analyzing trace with hash 831020816, now seen corresponding path program 2 times [2018-06-22 01:13:50,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:50,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:50,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:50,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,235 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:50,235 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:50,242 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:50,289 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:50,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,291 INFO ]: Computing forward predicates... [2018-06-22 01:13:50,454 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:50,474 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 01:13:50,474 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:13:50,474 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:13:50,474 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:50,474 INFO ]: Start difference. First operand 23 states and 34 transitions. Second operand 9 states. [2018-06-22 01:13:50,578 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:50,578 INFO ]: Finished difference Result 25 states and 36 transitions. [2018-06-22 01:13:50,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:13:50,579 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-22 01:13:50,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:50,579 INFO ]: With dead ends: 25 [2018-06-22 01:13:50,579 INFO ]: Without dead ends: 20 [2018-06-22 01:13:50,579 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:13:50,579 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 01:13:50,580 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 01:13:50,581 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:13:50,581 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-06-22 01:13:50,581 INFO ]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 11 [2018-06-22 01:13:50,581 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:50,581 INFO ]: Abstraction has 20 states and 30 transitions. [2018-06-22 01:13:50,581 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:13:50,581 INFO ]: Start isEmpty. Operand 20 states and 30 transitions. [2018-06-22 01:13:50,581 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:13:50,581 INFO ]: Found error trace [2018-06-22 01:13:50,582 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:50,582 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:50,582 INFO ]: Analyzing trace with hash -1406544728, now seen corresponding path program 1 times [2018-06-22 01:13:50,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:50,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:50,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,583 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:50,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,630 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,630 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:50,630 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:13:50,630 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:13:50,630 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:13:50,630 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:50,630 INFO ]: Start difference. First operand 20 states and 30 transitions. Second operand 7 states. [2018-06-22 01:13:50,734 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:50,734 INFO ]: Finished difference Result 38 states and 55 transitions. [2018-06-22 01:13:50,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:13:50,735 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:13:50,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:50,735 INFO ]: With dead ends: 38 [2018-06-22 01:13:50,735 INFO ]: Without dead ends: 38 [2018-06-22 01:13:50,736 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:13:50,736 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:13:50,739 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 23. [2018-06-22 01:13:50,739 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:50,739 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 01:13:50,739 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 12 [2018-06-22 01:13:50,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:50,740 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 01:13:50,740 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:13:50,740 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 01:13:50,740 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:13:50,740 INFO ]: Found error trace [2018-06-22 01:13:50,740 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:50,740 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:50,740 INFO ]: Analyzing trace with hash 1877495948, now seen corresponding path program 1 times [2018-06-22 01:13:50,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:50,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:50,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:50,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:50,748 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:50,785 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:50,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:50,785 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:13:50,785 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:13:50,786 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:13:50,786 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:50,786 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 7 states. [2018-06-22 01:13:50,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:50,992 INFO ]: Finished difference Result 39 states and 56 transitions. [2018-06-22 01:13:50,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:13:50,994 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-22 01:13:50,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:50,994 INFO ]: With dead ends: 39 [2018-06-22 01:13:50,994 INFO ]: Without dead ends: 39 [2018-06-22 01:13:50,995 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:13:50,995 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:13:50,997 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 23. [2018-06-22 01:13:50,997 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:51,001 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 01:13:51,001 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 12 [2018-06-22 01:13:51,001 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,001 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 01:13:51,001 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:13:51,001 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 01:13:51,002 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:13:51,002 INFO ]: Found error trace [2018-06-22 01:13:51,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,002 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,002 INFO ]: Analyzing trace with hash 1411967832, now seen corresponding path program 1 times [2018-06-22 01:13:51,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,068 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:13:51,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:51,068 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:13:51,068 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:13:51,068 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:13:51,068 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:13:51,068 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 6 states. [2018-06-22 01:13:51,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,296 INFO ]: Finished difference Result 35 states and 50 transitions. [2018-06-22 01:13:51,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:51,298 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 01:13:51,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,299 INFO ]: With dead ends: 35 [2018-06-22 01:13:51,299 INFO ]: Without dead ends: 35 [2018-06-22 01:13:51,299 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:51,299 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 01:13:51,301 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-22 01:13:51,301 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:51,302 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 01:13:51,302 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 12 [2018-06-22 01:13:51,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,302 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 01:13:51,302 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:13:51,302 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 01:13:51,302 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:13:51,302 INFO ]: Found error trace [2018-06-22 01:13:51,302 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,302 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,303 INFO ]: Analyzing trace with hash 579951870, now seen corresponding path program 1 times [2018-06-22 01:13:51,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,342 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:13:51,342 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:51,342 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:13:51,342 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:13:51,343 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:13:51,343 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:13:51,343 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 6 states. [2018-06-22 01:13:51,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,388 INFO ]: Finished difference Result 35 states and 50 transitions. [2018-06-22 01:13:51,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:51,388 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-22 01:13:51,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,389 INFO ]: With dead ends: 35 [2018-06-22 01:13:51,389 INFO ]: Without dead ends: 32 [2018-06-22 01:13:51,389 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:51,390 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:13:51,393 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-06-22 01:13:51,393 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:51,394 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-06-22 01:13:51,394 INFO ]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 12 [2018-06-22 01:13:51,394 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,394 INFO ]: Abstraction has 23 states and 35 transitions. [2018-06-22 01:13:51,394 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:13:51,394 INFO ]: Start isEmpty. Operand 23 states and 35 transitions. [2018-06-22 01:13:51,394 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:51,394 INFO ]: Found error trace [2018-06-22 01:13:51,394 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,394 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,394 INFO ]: Analyzing trace with hash -1154530846, now seen corresponding path program 1 times [2018-06-22 01:13:51,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,433 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:51,433 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:51,434 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:51,434 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:51,434 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:51,434 INFO ]: Start difference. First operand 23 states and 35 transitions. Second operand 5 states. [2018-06-22 01:13:51,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,456 INFO ]: Finished difference Result 36 states and 53 transitions. [2018-06-22 01:13:51,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:51,456 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 01:13:51,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,457 INFO ]: With dead ends: 36 [2018-06-22 01:13:51,457 INFO ]: Without dead ends: 32 [2018-06-22 01:13:51,457 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:51,457 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 01:13:51,459 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 25. [2018-06-22 01:13:51,459 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:13:51,460 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2018-06-22 01:13:51,460 INFO ]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 13 [2018-06-22 01:13:51,460 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,460 INFO ]: Abstraction has 25 states and 39 transitions. [2018-06-22 01:13:51,460 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:51,460 INFO ]: Start isEmpty. Operand 25 states and 39 transitions. [2018-06-22 01:13:51,461 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:51,461 INFO ]: Found error trace [2018-06-22 01:13:51,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,461 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,461 INFO ]: Analyzing trace with hash 2129509830, now seen corresponding path program 1 times [2018-06-22 01:13:51,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,496 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:51,496 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:51,496 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:51,496 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:51,496 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:51,497 INFO ]: Start difference. First operand 25 states and 39 transitions. Second operand 5 states. [2018-06-22 01:13:51,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,528 INFO ]: Finished difference Result 38 states and 54 transitions. [2018-06-22 01:13:51,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:51,528 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 01:13:51,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,529 INFO ]: With dead ends: 38 [2018-06-22 01:13:51,529 INFO ]: Without dead ends: 38 [2018-06-22 01:13:51,529 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:51,529 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:13:51,531 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 23. [2018-06-22 01:13:51,531 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:51,532 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 01:13:51,532 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 13 [2018-06-22 01:13:51,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,532 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 01:13:51,532 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:51,532 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 01:13:51,532 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:51,532 INFO ]: Found error trace [2018-06-22 01:13:51,532 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,532 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,532 INFO ]: Analyzing trace with hash -1402765012, now seen corresponding path program 1 times [2018-06-22 01:13:51,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,564 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:51,564 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:51,564 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:51,564 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:51,564 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:51,565 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 5 states. [2018-06-22 01:13:51,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,619 INFO ]: Finished difference Result 36 states and 51 transitions. [2018-06-22 01:13:51,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:51,619 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 01:13:51,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,620 INFO ]: With dead ends: 36 [2018-06-22 01:13:51,620 INFO ]: Without dead ends: 36 [2018-06-22 01:13:51,620 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:51,620 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:13:51,622 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-06-22 01:13:51,622 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 01:13:51,622 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-22 01:13:51,622 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-06-22 01:13:51,623 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,623 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-22 01:13:51,623 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:51,623 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-22 01:13:51,623 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:51,623 INFO ]: Found error trace [2018-06-22 01:13:51,623 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,623 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,623 INFO ]: Analyzing trace with hash -704280971, now seen corresponding path program 1 times [2018-06-22 01:13:51,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,667 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,667 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:51,667 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:51,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,691 INFO ]: Computing forward predicates... [2018-06-22 01:13:51,709 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,728 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:13:51,728 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-22 01:13:51,728 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:13:51,728 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:13:51,728 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:51,729 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 7 states. [2018-06-22 01:13:51,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,799 INFO ]: Finished difference Result 30 states and 41 transitions. [2018-06-22 01:13:51,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:51,800 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 01:13:51,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,800 INFO ]: With dead ends: 30 [2018-06-22 01:13:51,800 INFO ]: Without dead ends: 27 [2018-06-22 01:13:51,800 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:13:51,800 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 01:13:51,802 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-22 01:13:51,802 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 01:13:51,802 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-06-22 01:13:51,802 INFO ]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 13 [2018-06-22 01:13:51,803 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,803 INFO ]: Abstraction has 21 states and 30 transitions. [2018-06-22 01:13:51,803 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:13:51,803 INFO ]: Start isEmpty. Operand 21 states and 30 transitions. [2018-06-22 01:13:51,803 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:51,803 INFO ]: Found error trace [2018-06-22 01:13:51,803 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,803 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,803 INFO ]: Analyzing trace with hash -1986546808, now seen corresponding path program 1 times [2018-06-22 01:13:51,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,809 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,848 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:51,848 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:51,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,872 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:51,874 INFO ]: Computing forward predicates... [2018-06-22 01:13:51,887 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:51,906 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:13:51,906 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-22 01:13:51,906 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:13:51,906 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:13:51,906 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:51,906 INFO ]: Start difference. First operand 21 states and 30 transitions. Second operand 7 states. [2018-06-22 01:13:51,947 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:51,947 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-22 01:13:51,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:13:51,947 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 01:13:51,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:51,947 INFO ]: With dead ends: 24 [2018-06-22 01:13:51,947 INFO ]: Without dead ends: 21 [2018-06-22 01:13:51,948 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:13:51,948 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 01:13:51,949 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 01:13:51,949 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 01:13:51,949 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-22 01:13:51,949 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 13 [2018-06-22 01:13:51,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:51,949 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-22 01:13:51,949 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:13:51,949 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-22 01:13:51,950 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:51,950 INFO ]: Found error trace [2018-06-22 01:13:51,950 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:51,950 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:51,950 INFO ]: Analyzing trace with hash -512003368, now seen corresponding path program 1 times [2018-06-22 01:13:51,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:51,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:51,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:51,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:51,958 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:52,256 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:13:52,293 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:52,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:52,293 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:52,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:52,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:52,330 INFO ]: Computing forward predicates... [2018-06-22 01:13:52,660 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:13:52,682 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:52,682 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 01:13:52,682 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:13:52,682 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:13:52,682 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:13:52,682 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 13 states. [2018-06-22 01:13:53,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:53,288 INFO ]: Finished difference Result 65 states and 86 transitions. [2018-06-22 01:13:53,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:13:53,289 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-22 01:13:53,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:53,290 INFO ]: With dead ends: 65 [2018-06-22 01:13:53,290 INFO ]: Without dead ends: 61 [2018-06-22 01:13:53,290 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:13:53,290 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:13:53,293 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 25. [2018-06-22 01:13:53,293 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:13:53,293 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-06-22 01:13:53,294 INFO ]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 13 [2018-06-22 01:13:53,294 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:53,294 INFO ]: Abstraction has 25 states and 34 transitions. [2018-06-22 01:13:53,294 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:13:53,294 INFO ]: Start isEmpty. Operand 25 states and 34 transitions. [2018-06-22 01:13:53,294 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:53,294 INFO ]: Found error trace [2018-06-22 01:13:53,294 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:53,294 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:53,294 INFO ]: Analyzing trace with hash 1664937915, now seen corresponding path program 1 times [2018-06-22 01:13:53,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:53,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:53,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:53,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:53,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:53,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:53,490 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:13:53,691 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 01:13:54,036 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:54,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:54,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:54,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:54,069 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:54,071 INFO ]: Computing forward predicates... [2018-06-22 01:13:54,174 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:54,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:54,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 01:13:54,194 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:13:54,194 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:13:54,194 INFO ]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:13:54,194 INFO ]: Start difference. First operand 25 states and 34 transitions. Second operand 12 states. [2018-06-22 01:13:54,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:54,447 INFO ]: Finished difference Result 63 states and 87 transitions. [2018-06-22 01:13:54,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:13:54,448 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-22 01:13:54,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:54,448 INFO ]: With dead ends: 63 [2018-06-22 01:13:54,448 INFO ]: Without dead ends: 63 [2018-06-22 01:13:54,448 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:13:54,449 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:13:54,452 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 28. [2018-06-22 01:13:54,452 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:13:54,452 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-06-22 01:13:54,452 INFO ]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 13 [2018-06-22 01:13:54,453 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:54,453 INFO ]: Abstraction has 28 states and 40 transitions. [2018-06-22 01:13:54,453 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:13:54,453 INFO ]: Start isEmpty. Operand 28 states and 40 transitions. [2018-06-22 01:13:54,453 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:13:54,453 INFO ]: Found error trace [2018-06-22 01:13:54,453 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:54,453 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:54,453 INFO ]: Analyzing trace with hash 382672078, now seen corresponding path program 1 times [2018-06-22 01:13:54,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:54,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:54,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:54,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:54,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:54,460 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:54,630 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:13:54,630 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:13:54,630 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:13:54,630 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:13:54,630 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:13:54,630 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:13:54,630 INFO ]: Start difference. First operand 28 states and 40 transitions. Second operand 5 states. [2018-06-22 01:13:54,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:54,735 INFO ]: Finished difference Result 31 states and 40 transitions. [2018-06-22 01:13:54,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:13:54,735 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 01:13:54,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:54,735 INFO ]: With dead ends: 31 [2018-06-22 01:13:54,735 INFO ]: Without dead ends: 28 [2018-06-22 01:13:54,736 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:13:54,736 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 01:13:54,737 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-06-22 01:13:54,737 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:13:54,737 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-22 01:13:54,737 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2018-06-22 01:13:54,737 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:54,737 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-22 01:13:54,737 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:13:54,738 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-22 01:13:54,738 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:13:54,738 INFO ]: Found error trace [2018-06-22 01:13:54,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:54,738 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:54,738 INFO ]: Analyzing trace with hash 1530916238, now seen corresponding path program 1 times [2018-06-22 01:13:54,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:54,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:54,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:54,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:54,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:54,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:54,857 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:54,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:54,857 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:54,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:54,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:54,888 INFO ]: Computing forward predicates... [2018-06-22 01:13:54,945 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:54,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:54,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 01:13:54,964 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:13:54,965 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:13:54,965 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:13:54,965 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 13 states. [2018-06-22 01:13:55,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:55,068 INFO ]: Finished difference Result 50 states and 63 transitions. [2018-06-22 01:13:55,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:13:55,068 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-22 01:13:55,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:55,070 INFO ]: With dead ends: 50 [2018-06-22 01:13:55,070 INFO ]: Without dead ends: 50 [2018-06-22 01:13:55,071 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:13:55,071 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:13:55,072 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 28. [2018-06-22 01:13:55,072 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:13:55,073 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-06-22 01:13:55,073 INFO ]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2018-06-22 01:13:55,073 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:55,073 INFO ]: Abstraction has 28 states and 36 transitions. [2018-06-22 01:13:55,073 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:13:55,073 INFO ]: Start isEmpty. Operand 28 states and 36 transitions. [2018-06-22 01:13:55,073 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:13:55,073 INFO ]: Found error trace [2018-06-22 01:13:55,073 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:55,073 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:55,074 INFO ]: Analyzing trace with hash -587109775, now seen corresponding path program 1 times [2018-06-22 01:13:55,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:55,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:55,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:55,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,126 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:55,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:55,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:55,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,148 INFO ]: Computing forward predicates... [2018-06-22 01:13:55,164 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:55,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:13:55,184 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:13:55,184 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:13:55,184 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:55,184 INFO ]: Start difference. First operand 28 states and 36 transitions. Second operand 9 states. [2018-06-22 01:13:55,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:55,331 INFO ]: Finished difference Result 53 states and 67 transitions. [2018-06-22 01:13:55,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:13:55,333 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:13:55,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:55,333 INFO ]: With dead ends: 53 [2018-06-22 01:13:55,334 INFO ]: Without dead ends: 53 [2018-06-22 01:13:55,334 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:13:55,334 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:13:55,336 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-06-22 01:13:55,336 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:13:55,337 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-06-22 01:13:55,337 INFO ]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2018-06-22 01:13:55,337 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:55,337 INFO ]: Abstraction has 28 states and 36 transitions. [2018-06-22 01:13:55,337 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:13:55,337 INFO ]: Start isEmpty. Operand 28 states and 36 transitions. [2018-06-22 01:13:55,337 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:13:55,337 INFO ]: Found error trace [2018-06-22 01:13:55,337 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:55,337 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:55,338 INFO ]: Analyzing trace with hash -2877378, now seen corresponding path program 2 times [2018-06-22 01:13:55,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:55,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:55,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:13:55,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,406 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:55,406 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:55,411 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:55,426 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:55,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,427 INFO ]: Computing forward predicates... [2018-06-22 01:13:55,450 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:55,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:13:55,470 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:13:55,470 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:13:55,470 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:55,470 INFO ]: Start difference. First operand 28 states and 36 transitions. Second operand 9 states. [2018-06-22 01:13:55,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:55,630 INFO ]: Finished difference Result 39 states and 49 transitions. [2018-06-22 01:13:55,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:13:55,631 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:13:55,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:55,631 INFO ]: With dead ends: 39 [2018-06-22 01:13:55,631 INFO ]: Without dead ends: 39 [2018-06-22 01:13:55,632 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:13:55,632 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:13:55,633 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-22 01:13:55,633 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:13:55,634 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-06-22 01:13:55,634 INFO ]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2018-06-22 01:13:55,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:55,634 INFO ]: Abstraction has 26 states and 33 transitions. [2018-06-22 01:13:55,634 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:13:55,634 INFO ]: Start isEmpty. Operand 26 states and 33 transitions. [2018-06-22 01:13:55,634 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:13:55,634 INFO ]: Found error trace [2018-06-22 01:13:55,634 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:55,634 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:55,635 INFO ]: Analyzing trace with hash -155768341, now seen corresponding path program 2 times [2018-06-22 01:13:55,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:55,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:55,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,635 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:55,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,692 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,692 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:55,692 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:55,698 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:55,714 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:55,714 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:55,715 INFO ]: Computing forward predicates... [2018-06-22 01:13:55,760 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:55,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:55,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 01:13:55,780 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:13:55,780 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:13:55,780 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:13:55,780 INFO ]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2018-06-22 01:13:55,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:55,990 INFO ]: Finished difference Result 40 states and 50 transitions. [2018-06-22 01:13:55,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:13:55,990 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-22 01:13:55,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:55,990 INFO ]: With dead ends: 40 [2018-06-22 01:13:55,990 INFO ]: Without dead ends: 40 [2018-06-22 01:13:55,991 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:13:55,991 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 01:13:55,992 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 24. [2018-06-22 01:13:55,992 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:13:55,993 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-06-22 01:13:55,993 INFO ]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 14 [2018-06-22 01:13:55,993 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:55,993 INFO ]: Abstraction has 24 states and 30 transitions. [2018-06-22 01:13:55,993 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:13:55,993 INFO ]: Start isEmpty. Operand 24 states and 30 transitions. [2018-06-22 01:13:55,993 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:13:55,993 INFO ]: Found error trace [2018-06-22 01:13:55,993 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:55,993 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:55,993 INFO ]: Analyzing trace with hash 22400450, now seen corresponding path program 3 times [2018-06-22 01:13:55,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:55,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:55,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:55,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:55,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,027 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,244 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:56,244 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:56,250 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:56,289 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:13:56,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,291 INFO ]: Computing forward predicates... [2018-06-22 01:13:56,328 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:56,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:13:56,348 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:13:56,348 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:13:56,348 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:13:56,348 INFO ]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2018-06-22 01:13:56,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:56,398 INFO ]: Finished difference Result 40 states and 49 transitions. [2018-06-22 01:13:56,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:13:56,398 INFO ]: Start accepts. Automaton has 10 states. Word has length 14 [2018-06-22 01:13:56,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:56,399 INFO ]: With dead ends: 40 [2018-06-22 01:13:56,399 INFO ]: Without dead ends: 36 [2018-06-22 01:13:56,399 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:13:56,399 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 01:13:56,400 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-06-22 01:13:56,400 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 01:13:56,401 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-06-22 01:13:56,401 INFO ]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 14 [2018-06-22 01:13:56,401 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:56,401 INFO ]: Abstraction has 25 states and 31 transitions. [2018-06-22 01:13:56,401 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:13:56,401 INFO ]: Start isEmpty. Operand 25 states and 31 transitions. [2018-06-22 01:13:56,401 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:13:56,401 INFO ]: Found error trace [2018-06-22 01:13:56,401 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:56,401 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:56,401 INFO ]: Analyzing trace with hash 154384070, now seen corresponding path program 2 times [2018-06-22 01:13:56,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:56,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:56,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,402 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:56,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,478 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:56,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:56,484 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:56,509 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:56,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,511 INFO ]: Computing forward predicates... [2018-06-22 01:13:56,556 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,576 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:56,576 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 01:13:56,576 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:13:56,576 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:13:56,576 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:13:56,576 INFO ]: Start difference. First operand 25 states and 31 transitions. Second operand 10 states. [2018-06-22 01:13:56,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:56,631 INFO ]: Finished difference Result 33 states and 40 transitions. [2018-06-22 01:13:56,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:13:56,631 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-22 01:13:56,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:56,632 INFO ]: With dead ends: 33 [2018-06-22 01:13:56,632 INFO ]: Without dead ends: 29 [2018-06-22 01:13:56,632 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:13:56,632 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 01:13:56,632 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-22 01:13:56,632 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 01:13:56,633 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-22 01:13:56,633 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2018-06-22 01:13:56,633 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:56,633 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-22 01:13:56,633 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:13:56,633 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-22 01:13:56,633 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:13:56,633 INFO ]: Found error trace [2018-06-22 01:13:56,633 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:56,633 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:56,633 INFO ]: Analyzing trace with hash -148577770, now seen corresponding path program 3 times [2018-06-22 01:13:56,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:56,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:56,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:56,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:56,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,909 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:56,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:56,909 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:56,915 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:56,930 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:13:56,931 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:56,932 INFO ]: Computing forward predicates... [2018-06-22 01:13:57,239 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:57,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:57,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 01:13:57,258 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:13:57,258 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:13:57,258 INFO ]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:13:57,258 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 18 states. [2018-06-22 01:13:57,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:57,498 INFO ]: Finished difference Result 55 states and 67 transitions. [2018-06-22 01:13:57,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:13:57,498 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-22 01:13:57,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:57,499 INFO ]: With dead ends: 55 [2018-06-22 01:13:57,499 INFO ]: Without dead ends: 55 [2018-06-22 01:13:57,499 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:13:57,499 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:13:57,501 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 29. [2018-06-22 01:13:57,501 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:13:57,501 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-06-22 01:13:57,501 INFO ]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2018-06-22 01:13:57,501 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:57,501 INFO ]: Abstraction has 29 states and 36 transitions. [2018-06-22 01:13:57,501 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:13:57,501 INFO ]: Start isEmpty. Operand 29 states and 36 transitions. [2018-06-22 01:13:57,502 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-22 01:13:57,502 INFO ]: Found error trace [2018-06-22 01:13:57,502 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:57,502 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:57,502 INFO ]: Analyzing trace with hash -584918638, now seen corresponding path program 4 times [2018-06-22 01:13:57,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:57,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:57,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:57,503 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:57,503 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:57,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:57,630 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:57,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:57,630 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) [2018-06-22 01:13:57,644 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:57,668 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:57,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:57,670 INFO ]: Computing forward predicates... [2018-06-22 01:13:57,842 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:57,862 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:57,862 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 01:13:57,862 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:13:57,862 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:13:57,862 INFO ]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:13:57,862 INFO ]: Start difference. First operand 29 states and 36 transitions. Second operand 18 states. [2018-06-22 01:13:58,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:58,198 INFO ]: Finished difference Result 58 states and 71 transitions. [2018-06-22 01:13:58,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:13:58,198 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-22 01:13:58,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:58,198 INFO ]: With dead ends: 58 [2018-06-22 01:13:58,198 INFO ]: Without dead ends: 58 [2018-06-22 01:13:58,199 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:13:58,199 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:13:58,200 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 33. [2018-06-22 01:13:58,201 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:13:58,201 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-06-22 01:13:58,201 INFO ]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 15 [2018-06-22 01:13:58,201 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:58,201 INFO ]: Abstraction has 33 states and 41 transitions. [2018-06-22 01:13:58,201 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:13:58,201 INFO ]: Start isEmpty. Operand 33 states and 41 transitions. [2018-06-22 01:13:58,201 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:13:58,201 INFO ]: Found error trace [2018-06-22 01:13:58,201 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:58,201 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:58,201 INFO ]: Analyzing trace with hash 297109324, now seen corresponding path program 3 times [2018-06-22 01:13:58,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:58,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:58,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:58,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:58,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:58,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:58,498 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:58,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:58,498 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:58,504 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:13:58,521 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 01:13:58,521 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:58,523 INFO ]: Computing forward predicates... [2018-06-22 01:13:58,607 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:58,626 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:58,626 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-22 01:13:58,626 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:13:58,626 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:13:58,626 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:13:58,627 INFO ]: Start difference. First operand 33 states and 41 transitions. Second operand 16 states. [2018-06-22 01:13:59,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:59,044 INFO ]: Finished difference Result 61 states and 75 transitions. [2018-06-22 01:13:59,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:13:59,044 INFO ]: Start accepts. Automaton has 16 states. Word has length 16 [2018-06-22 01:13:59,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:59,045 INFO ]: With dead ends: 61 [2018-06-22 01:13:59,045 INFO ]: Without dead ends: 61 [2018-06-22 01:13:59,045 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:13:59,046 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 01:13:59,047 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 32. [2018-06-22 01:13:59,047 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:13:59,048 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-06-22 01:13:59,048 INFO ]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 16 [2018-06-22 01:13:59,048 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:59,048 INFO ]: Abstraction has 32 states and 40 transitions. [2018-06-22 01:13:59,048 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:13:59,048 INFO ]: Start isEmpty. Operand 32 states and 40 transitions. [2018-06-22 01:13:59,048 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:13:59,048 INFO ]: Found error trace [2018-06-22 01:13:59,048 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:59,048 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:59,048 INFO ]: Analyzing trace with hash -139231544, now seen corresponding path program 2 times [2018-06-22 01:13:59,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:59,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:59,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:59,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,064 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,206 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:59,206 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:59,212 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:13:59,229 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:13:59,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,231 INFO ]: Computing forward predicates... [2018-06-22 01:13:59,262 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,282 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:59,282 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 01:13:59,282 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:13:59,282 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:13:59,282 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:13:59,282 INFO ]: Start difference. First operand 32 states and 40 transitions. Second operand 11 states. [2018-06-22 01:13:59,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:59,463 INFO ]: Finished difference Result 64 states and 79 transitions. [2018-06-22 01:13:59,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:13:59,463 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-22 01:13:59,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:59,463 INFO ]: With dead ends: 64 [2018-06-22 01:13:59,463 INFO ]: Without dead ends: 64 [2018-06-22 01:13:59,464 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:13:59,464 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:13:59,466 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 29. [2018-06-22 01:13:59,466 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:13:59,466 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-06-22 01:13:59,466 INFO ]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2018-06-22 01:13:59,466 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:59,466 INFO ]: Abstraction has 29 states and 36 transitions. [2018-06-22 01:13:59,466 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:13:59,466 INFO ]: Start isEmpty. Operand 29 states and 36 transitions. [2018-06-22 01:13:59,467 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:13:59,467 INFO ]: Found error trace [2018-06-22 01:13:59,467 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:59,467 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:59,467 INFO ]: Analyzing trace with hash -504773124, now seen corresponding path program 4 times [2018-06-22 01:13:59,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:59,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:59,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:59,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,578 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:59,578 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:59,594 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:13:59,611 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:13:59,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,612 INFO ]: Computing forward predicates... [2018-06-22 01:13:59,638 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,657 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:13:59,657 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-22 01:13:59,657 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:13:59,657 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:13:59,657 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:13:59,657 INFO ]: Start difference. First operand 29 states and 36 transitions. Second operand 12 states. [2018-06-22 01:13:59,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:13:59,754 INFO ]: Finished difference Result 42 states and 51 transitions. [2018-06-22 01:13:59,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:13:59,754 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 01:13:59,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:13:59,754 INFO ]: With dead ends: 42 [2018-06-22 01:13:59,754 INFO ]: Without dead ends: 42 [2018-06-22 01:13:59,754 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:13:59,754 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:13:59,757 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-06-22 01:13:59,757 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:13:59,757 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-06-22 01:13:59,757 INFO ]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2018-06-22 01:13:59,757 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:13:59,757 INFO ]: Abstraction has 27 states and 33 transitions. [2018-06-22 01:13:59,757 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:13:59,757 INFO ]: Start isEmpty. Operand 27 states and 33 transitions. [2018-06-22 01:13:59,757 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:13:59,757 INFO ]: Found error trace [2018-06-22 01:13:59,757 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:13:59,758 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:13:59,758 INFO ]: Analyzing trace with hash -370322626, now seen corresponding path program 5 times [2018-06-22 01:13:59,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:13:59,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:13:59,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:13:59,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:13:59,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,951 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:13:59,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:13:59,951 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:13:59,958 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:13:59,985 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:13:59,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:13:59,987 INFO ]: Computing forward predicates... [2018-06-22 01:14:00,050 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:00,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:00,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 01:14:00,075 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:14:00,075 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:14:00,075 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:00,075 INFO ]: Start difference. First operand 27 states and 33 transitions. Second operand 13 states. [2018-06-22 01:14:00,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:00,143 INFO ]: Finished difference Result 42 states and 50 transitions. [2018-06-22 01:14:00,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:14:00,143 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 01:14:00,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:00,143 INFO ]: With dead ends: 42 [2018-06-22 01:14:00,143 INFO ]: Without dead ends: 37 [2018-06-22 01:14:00,144 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:14:00,144 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:14:00,144 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-06-22 01:14:00,144 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:14:00,145 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-06-22 01:14:00,145 INFO ]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2018-06-22 01:14:00,145 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:00,145 INFO ]: Abstraction has 28 states and 34 transitions. [2018-06-22 01:14:00,145 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:14:00,145 INFO ]: Start isEmpty. Operand 28 states and 34 transitions. [2018-06-22 01:14:00,145 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:14:00,145 INFO ]: Found error trace [2018-06-22 01:14:00,145 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:00,145 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:00,145 INFO ]: Analyzing trace with hash 2063026114, now seen corresponding path program 5 times [2018-06-22 01:14:00,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:00,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:00,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,146 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:00,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:00,217 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:00,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:00,217 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:00,225 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:00,243 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:14:00,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:00,244 INFO ]: Computing forward predicates... [2018-06-22 01:14:00,287 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:00,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:00,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-22 01:14:00,318 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:14:00,318 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:14:00,318 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:14:00,318 INFO ]: Start difference. First operand 28 states and 34 transitions. Second operand 12 states. [2018-06-22 01:14:00,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:00,615 INFO ]: Finished difference Result 38 states and 45 transitions. [2018-06-22 01:14:00,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:14:00,615 INFO ]: Start accepts. Automaton has 12 states. Word has length 16 [2018-06-22 01:14:00,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:00,615 INFO ]: With dead ends: 38 [2018-06-22 01:14:00,615 INFO ]: Without dead ends: 38 [2018-06-22 01:14:00,616 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:14:00,616 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:14:00,617 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-06-22 01:14:00,617 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:14:00,617 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-06-22 01:14:00,617 INFO ]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2018-06-22 01:14:00,617 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:00,617 INFO ]: Abstraction has 26 states and 31 transitions. [2018-06-22 01:14:00,617 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:14:00,617 INFO ]: Start isEmpty. Operand 26 states and 31 transitions. [2018-06-22 01:14:00,617 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-22 01:14:00,617 INFO ]: Found error trace [2018-06-22 01:14:00,617 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:00,617 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:00,618 INFO ]: Analyzing trace with hash -1003675957, now seen corresponding path program 6 times [2018-06-22 01:14:00,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:00,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:00,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:00,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:00,734 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:00,734 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:00,734 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:00,740 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:00,758 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:14:00,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:00,759 INFO ]: Computing forward predicates... [2018-06-22 01:14:00,802 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:00,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:00,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 01:14:00,823 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:14:00,823 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:14:00,823 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:00,823 INFO ]: Start difference. First operand 26 states and 31 transitions. Second operand 13 states. [2018-06-22 01:14:00,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:00,905 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-22 01:14:00,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:14:00,905 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-22 01:14:00,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:00,905 INFO ]: With dead ends: 35 [2018-06-22 01:14:00,905 INFO ]: Without dead ends: 30 [2018-06-22 01:14:00,905 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:14:00,905 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 01:14:00,906 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-06-22 01:14:00,906 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:14:00,906 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-22 01:14:00,907 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2018-06-22 01:14:00,907 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:00,907 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-22 01:14:00,907 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:14:00,907 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-22 01:14:00,907 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:14:00,907 INFO ]: Found error trace [2018-06-22 01:14:00,907 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:00,907 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:00,907 INFO ]: Analyzing trace with hash 1472523288, now seen corresponding path program 6 times [2018-06-22 01:14:00,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:00,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:00,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,907 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:00,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:00,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:01,259 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:01,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:01,259 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:01,265 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:01,284 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-22 01:14:01,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:01,287 INFO ]: Computing forward predicates... [2018-06-22 01:14:01,480 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:01,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:01,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 01:14:01,500 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:14:01,500 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:14:01,500 INFO ]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:01,500 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 22 states. [2018-06-22 01:14:01,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:01,887 INFO ]: Finished difference Result 64 states and 76 transitions. [2018-06-22 01:14:01,887 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:14:01,887 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-22 01:14:01,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:01,887 INFO ]: With dead ends: 64 [2018-06-22 01:14:01,887 INFO ]: Without dead ends: 64 [2018-06-22 01:14:01,888 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:01,888 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 01:14:01,889 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 34. [2018-06-22 01:14:01,889 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:14:01,890 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-06-22 01:14:01,890 INFO ]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-06-22 01:14:01,890 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:01,890 INFO ]: Abstraction has 34 states and 41 transitions. [2018-06-22 01:14:01,890 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:14:01,890 INFO ]: Start isEmpty. Operand 34 states and 41 transitions. [2018-06-22 01:14:01,890 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:14:01,890 INFO ]: Found error trace [2018-06-22 01:14:01,890 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:01,890 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:01,890 INFO ]: Analyzing trace with hash -521767269, now seen corresponding path program 7 times [2018-06-22 01:14:01,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:01,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:01,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:01,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:01,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:01,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:02,036 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:02,037 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:02,037 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:02,042 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:02,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:02,064 INFO ]: Computing forward predicates... [2018-06-22 01:14:02,235 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:02,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:02,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 01:14:02,254 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:14:02,254 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:14:02,255 INFO ]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:02,255 INFO ]: Start difference. First operand 34 states and 41 transitions. Second operand 22 states. [2018-06-22 01:14:02,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:02,586 INFO ]: Finished difference Result 67 states and 80 transitions. [2018-06-22 01:14:02,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:14:02,586 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-22 01:14:02,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:02,587 INFO ]: With dead ends: 67 [2018-06-22 01:14:02,587 INFO ]: Without dead ends: 67 [2018-06-22 01:14:02,587 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:02,587 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:14:02,591 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 39. [2018-06-22 01:14:02,591 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:14:02,591 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-06-22 01:14:02,591 INFO ]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 17 [2018-06-22 01:14:02,591 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:02,591 INFO ]: Abstraction has 39 states and 47 transitions. [2018-06-22 01:14:02,591 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:14:02,591 INFO ]: Start isEmpty. Operand 39 states and 47 transitions. [2018-06-22 01:14:02,592 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:02,592 INFO ]: Found error trace [2018-06-22 01:14:02,592 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:02,592 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:02,592 INFO ]: Analyzing trace with hash 281091022, now seen corresponding path program 4 times [2018-06-22 01:14:02,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:02,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:02,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:02,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:02,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:02,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:02,714 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:02,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:02,714 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:02,719 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:02,741 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:02,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:02,744 INFO ]: Computing forward predicates... [2018-06-22 01:14:02,826 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:02,846 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:02,846 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-22 01:14:02,846 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:14:02,846 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:14:02,846 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:14:02,846 INFO ]: Start difference. First operand 39 states and 47 transitions. Second operand 19 states. [2018-06-22 01:14:03,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:03,096 INFO ]: Finished difference Result 70 states and 84 transitions. [2018-06-22 01:14:03,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:14:03,096 INFO ]: Start accepts. Automaton has 19 states. Word has length 18 [2018-06-22 01:14:03,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:03,097 INFO ]: With dead ends: 70 [2018-06-22 01:14:03,097 INFO ]: Without dead ends: 70 [2018-06-22 01:14:03,097 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:14:03,097 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:14:03,099 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-06-22 01:14:03,099 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:14:03,099 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-06-22 01:14:03,099 INFO ]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 18 [2018-06-22 01:14:03,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:03,099 INFO ]: Abstraction has 37 states and 45 transitions. [2018-06-22 01:14:03,099 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:14:03,099 INFO ]: Start isEmpty. Operand 37 states and 45 transitions. [2018-06-22 01:14:03,099 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:03,099 INFO ]: Found error trace [2018-06-22 01:14:03,099 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:03,099 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:03,100 INFO ]: Analyzing trace with hash -1713199535, now seen corresponding path program 3 times [2018-06-22 01:14:03,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:03,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:03,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:03,103 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:03,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:03,112 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:03,520 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:03,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:03,539 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:03,544 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:03,566 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:14:03,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:03,568 INFO ]: Computing forward predicates... [2018-06-22 01:14:03,601 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:03,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:03,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 01:14:03,621 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:14:03,621 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:14:03,621 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:14:03,621 INFO ]: Start difference. First operand 37 states and 45 transitions. Second operand 13 states. [2018-06-22 01:14:03,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:03,841 INFO ]: Finished difference Result 73 states and 88 transitions. [2018-06-22 01:14:03,841 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:14:03,841 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-22 01:14:03,841 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:03,841 INFO ]: With dead ends: 73 [2018-06-22 01:14:03,841 INFO ]: Without dead ends: 73 [2018-06-22 01:14:03,841 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:14:03,841 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 01:14:03,843 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 33. [2018-06-22 01:14:03,843 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 01:14:03,843 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-22 01:14:03,843 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 18 [2018-06-22 01:14:03,844 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:03,844 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-22 01:14:03,844 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:14:03,844 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-22 01:14:03,844 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:03,844 INFO ]: Found error trace [2018-06-22 01:14:03,844 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:03,844 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:03,844 INFO ]: Analyzing trace with hash -1528795522, now seen corresponding path program 7 times [2018-06-22 01:14:03,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:03,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:03,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:03,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:03,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:03,852 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:03,922 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:03,922 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:03,922 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:03,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:03,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:03,950 INFO ]: Computing forward predicates... [2018-06-22 01:14:04,036 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:04,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:04,056 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-22 01:14:04,057 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:14:04,057 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:14:04,057 INFO ]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:14:04,057 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 15 states. [2018-06-22 01:14:04,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:04,149 INFO ]: Finished difference Result 48 states and 57 transitions. [2018-06-22 01:14:04,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:14:04,149 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-22 01:14:04,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:04,150 INFO ]: With dead ends: 48 [2018-06-22 01:14:04,150 INFO ]: Without dead ends: 48 [2018-06-22 01:14:04,150 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:14:04,150 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:14:04,151 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-06-22 01:14:04,151 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:14:04,151 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-22 01:14:04,151 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 18 [2018-06-22 01:14:04,151 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:04,151 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-22 01:14:04,151 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:14:04,151 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-22 01:14:04,151 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:04,151 INFO ]: Found error trace [2018-06-22 01:14:04,151 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:04,151 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:04,152 INFO ]: Analyzing trace with hash -1655797380, now seen corresponding path program 8 times [2018-06-22 01:14:04,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:04,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:04,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:04,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:04,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:04,158 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:04,259 INFO ]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:04,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:04,259 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:04,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:04,287 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:04,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:04,288 INFO ]: Computing forward predicates... [2018-06-22 01:14:04,902 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:04,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:04,921 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-22 01:14:04,921 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:14:04,921 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:14:04,921 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:14:04,921 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 16 states. [2018-06-22 01:14:05,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:05,025 INFO ]: Finished difference Result 48 states and 56 transitions. [2018-06-22 01:14:05,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:14:05,025 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-22 01:14:05,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:05,025 INFO ]: With dead ends: 48 [2018-06-22 01:14:05,025 INFO ]: Without dead ends: 42 [2018-06-22 01:14:05,025 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:05,026 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:14:05,027 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 01:14:05,027 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 01:14:05,027 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-06-22 01:14:05,027 INFO ]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2018-06-22 01:14:05,027 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:05,027 INFO ]: Abstraction has 32 states and 38 transitions. [2018-06-22 01:14:05,027 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:14:05,027 INFO ]: Start isEmpty. Operand 32 states and 38 transitions. [2018-06-22 01:14:05,027 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:05,027 INFO ]: Found error trace [2018-06-22 01:14:05,027 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:05,028 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:05,028 INFO ]: Analyzing trace with hash 1532500171, now seen corresponding path program 8 times [2018-06-22 01:14:05,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:05,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:05,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:05,028 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:05,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:05,039 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:05,403 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:05,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:05,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:05,409 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:05,431 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:05,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:05,433 INFO ]: Computing forward predicates... [2018-06-22 01:14:05,474 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:05,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:05,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-22 01:14:05,499 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:14:05,499 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:14:05,499 INFO ]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:14:05,500 INFO ]: Start difference. First operand 32 states and 38 transitions. Second operand 15 states. [2018-06-22 01:14:05,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:05,611 INFO ]: Finished difference Result 43 states and 50 transitions. [2018-06-22 01:14:05,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:14:05,612 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-22 01:14:05,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:05,612 INFO ]: With dead ends: 43 [2018-06-22 01:14:05,612 INFO ]: Without dead ends: 43 [2018-06-22 01:14:05,612 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:14:05,612 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 01:14:05,613 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-22 01:14:05,613 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 01:14:05,613 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-06-22 01:14:05,613 INFO ]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2018-06-22 01:14:05,614 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:05,614 INFO ]: Abstraction has 30 states and 35 transitions. [2018-06-22 01:14:05,614 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:14:05,614 INFO ]: Start isEmpty. Operand 30 states and 35 transitions. [2018-06-22 01:14:05,614 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:14:05,614 INFO ]: Found error trace [2018-06-22 01:14:05,614 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:05,614 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:05,614 INFO ]: Analyzing trace with hash 954016482, now seen corresponding path program 9 times [2018-06-22 01:14:05,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:05,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:05,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:05,615 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:05,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:05,621 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:05,693 INFO ]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:05,693 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:05,693 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:05,699 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:05,721 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:14:05,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:05,722 INFO ]: Computing forward predicates... [2018-06-22 01:14:05,823 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:05,842 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:05,843 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-22 01:14:05,843 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:14:05,843 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:14:05,843 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:14:05,843 INFO ]: Start difference. First operand 30 states and 35 transitions. Second operand 16 states. [2018-06-22 01:14:05,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:05,946 INFO ]: Finished difference Result 40 states and 46 transitions. [2018-06-22 01:14:05,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:14:05,946 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-22 01:14:05,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:05,946 INFO ]: With dead ends: 40 [2018-06-22 01:14:05,946 INFO ]: Without dead ends: 34 [2018-06-22 01:14:05,946 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:05,947 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 01:14:05,948 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-06-22 01:14:05,948 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 01:14:05,948 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-06-22 01:14:05,948 INFO ]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-06-22 01:14:05,948 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:05,948 INFO ]: Abstraction has 31 states and 36 transitions. [2018-06-22 01:14:05,948 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:14:05,948 INFO ]: Start isEmpty. Operand 31 states and 36 transitions. [2018-06-22 01:14:05,948 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:14:05,948 INFO ]: Found error trace [2018-06-22 01:14:05,948 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:05,948 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:05,948 INFO ]: Analyzing trace with hash -207399978, now seen corresponding path program 9 times [2018-06-22 01:14:05,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:05,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:05,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:05,949 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:05,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:05,958 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:06,178 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:06,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:06,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:06,184 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:06,241 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:14:06,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:06,244 INFO ]: Computing forward predicates... [2018-06-22 01:14:06,815 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:06,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:06,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:14:06,835 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:14:06,835 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:14:06,835 INFO ]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:14:06,835 INFO ]: Start difference. First operand 31 states and 36 transitions. Second operand 26 states. [2018-06-22 01:14:07,655 WARN ]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-22 01:14:07,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:07,693 INFO ]: Finished difference Result 73 states and 85 transitions. [2018-06-22 01:14:07,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:14:07,693 INFO ]: Start accepts. Automaton has 26 states. Word has length 19 [2018-06-22 01:14:07,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:07,693 INFO ]: With dead ends: 73 [2018-06-22 01:14:07,693 INFO ]: Without dead ends: 73 [2018-06-22 01:14:07,694 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:14:07,694 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 01:14:07,696 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 39. [2018-06-22 01:14:07,696 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:14:07,698 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-22 01:14:07,698 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 19 [2018-06-22 01:14:07,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:07,698 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-22 01:14:07,698 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:14:07,698 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-22 01:14:07,698 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:14:07,698 INFO ]: Found error trace [2018-06-22 01:14:07,698 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:07,698 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:07,698 INFO ]: Analyzing trace with hash 211797682, now seen corresponding path program 10 times [2018-06-22 01:14:07,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:07,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:07,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:07,699 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:07,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:07,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:07,970 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:07,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:07,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:07,976 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:07,997 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:07,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:07,999 INFO ]: Computing forward predicates... [2018-06-22 01:14:08,232 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:08,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:08,250 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:14:08,250 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:14:08,250 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:14:08,250 INFO ]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:14:08,251 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 26 states. [2018-06-22 01:14:08,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:08,693 INFO ]: Finished difference Result 76 states and 89 transitions. [2018-06-22 01:14:08,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:14:08,693 INFO ]: Start accepts. Automaton has 26 states. Word has length 19 [2018-06-22 01:14:08,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:08,693 INFO ]: With dead ends: 76 [2018-06-22 01:14:08,693 INFO ]: Without dead ends: 76 [2018-06-22 01:14:08,694 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:14:08,694 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 01:14:08,696 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 45. [2018-06-22 01:14:08,696 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:14:08,696 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-06-22 01:14:08,696 INFO ]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 19 [2018-06-22 01:14:08,696 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:08,696 INFO ]: Abstraction has 45 states and 53 transitions. [2018-06-22 01:14:08,696 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:14:08,696 INFO ]: Start isEmpty. Operand 45 states and 53 transitions. [2018-06-22 01:14:08,697 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:14:08,697 INFO ]: Found error trace [2018-06-22 01:14:08,697 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:08,697 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:08,697 INFO ]: Analyzing trace with hash 1582460428, now seen corresponding path program 5 times [2018-06-22 01:14:08,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:08,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:08,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:08,697 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:08,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:08,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:09,703 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:09,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:09,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:09,709 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:09,732 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:14:09,732 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:09,734 INFO ]: Computing forward predicates... [2018-06-22 01:14:09,829 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:09,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:09,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-22 01:14:09,849 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:14:09,849 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:14:09,849 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:09,849 INFO ]: Start difference. First operand 45 states and 53 transitions. Second operand 22 states. [2018-06-22 01:14:10,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:10,184 INFO ]: Finished difference Result 79 states and 93 transitions. [2018-06-22 01:14:10,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:14:10,184 INFO ]: Start accepts. Automaton has 22 states. Word has length 20 [2018-06-22 01:14:10,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:10,184 INFO ]: With dead ends: 79 [2018-06-22 01:14:10,184 INFO ]: Without dead ends: 79 [2018-06-22 01:14:10,184 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 01:14:10,184 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 01:14:10,186 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 42. [2018-06-22 01:14:10,186 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:14:10,186 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-06-22 01:14:10,186 INFO ]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2018-06-22 01:14:10,186 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:10,186 INFO ]: Abstraction has 42 states and 50 transitions. [2018-06-22 01:14:10,186 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:14:10,186 INFO ]: Start isEmpty. Operand 42 states and 50 transitions. [2018-06-22 01:14:10,186 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:14:10,187 INFO ]: Found error trace [2018-06-22 01:14:10,187 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:10,187 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:10,187 INFO ]: Analyzing trace with hash 2001658088, now seen corresponding path program 4 times [2018-06-22 01:14:10,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:10,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:10,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:10,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:10,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:10,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:10,380 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:10,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:10,380 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:10,385 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:10,425 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:10,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:10,428 INFO ]: Computing forward predicates... [2018-06-22 01:14:10,523 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:10,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:10,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 01:14:10,554 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:14:10,554 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:14:10,554 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:14:10,554 INFO ]: Start difference. First operand 42 states and 50 transitions. Second operand 15 states. [2018-06-22 01:14:10,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:10,865 INFO ]: Finished difference Result 82 states and 97 transitions. [2018-06-22 01:14:10,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 01:14:10,865 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-22 01:14:10,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:10,866 INFO ]: With dead ends: 82 [2018-06-22 01:14:10,866 INFO ]: Without dead ends: 82 [2018-06-22 01:14:10,866 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:14:10,866 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 01:14:10,868 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 37. [2018-06-22 01:14:10,868 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 01:14:10,868 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-22 01:14:10,868 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2018-06-22 01:14:10,868 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:10,868 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-22 01:14:10,868 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:14:10,868 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-22 01:14:10,868 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:14:10,868 INFO ]: Found error trace [2018-06-22 01:14:10,868 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:10,868 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:10,869 INFO ]: Analyzing trace with hash 1743246524, now seen corresponding path program 10 times [2018-06-22 01:14:10,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:10,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:10,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:10,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:10,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:10,877 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:10,996 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:10,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:10,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:11,003 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:11,029 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:11,029 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:11,030 INFO ]: Computing forward predicates... [2018-06-22 01:14:11,104 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:11,124 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:11,124 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-22 01:14:11,124 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:14:11,124 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:14:11,124 INFO ]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:14:11,124 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 18 states. [2018-06-22 01:14:11,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:11,266 INFO ]: Finished difference Result 54 states and 63 transitions. [2018-06-22 01:14:11,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:14:11,267 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-22 01:14:11,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:11,267 INFO ]: With dead ends: 54 [2018-06-22 01:14:11,267 INFO ]: Without dead ends: 54 [2018-06-22 01:14:11,267 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:14:11,267 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:14:11,268 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 35. [2018-06-22 01:14:11,268 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:14:11,269 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-06-22 01:14:11,269 INFO ]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2018-06-22 01:14:11,269 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:11,269 INFO ]: Abstraction has 35 states and 41 transitions. [2018-06-22 01:14:11,269 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:14:11,269 INFO ]: Start isEmpty. Operand 35 states and 41 transitions. [2018-06-22 01:14:11,269 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:14:11,269 INFO ]: Found error trace [2018-06-22 01:14:11,269 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:11,269 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:11,269 INFO ]: Analyzing trace with hash 2101156222, now seen corresponding path program 11 times [2018-06-22 01:14:11,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:11,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:11,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:11,270 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:11,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:11,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:11,374 INFO ]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:11,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:11,374 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:11,381 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:11,407 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:14:11,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:11,409 INFO ]: Computing forward predicates... [2018-06-22 01:14:11,485 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:11,505 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:11,505 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-22 01:14:11,505 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:14:11,505 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:14:11,505 INFO ]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:14:11,505 INFO ]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2018-06-22 01:14:11,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:11,615 INFO ]: Finished difference Result 54 states and 62 transitions. [2018-06-22 01:14:11,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:14:11,615 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-22 01:14:11,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:11,616 INFO ]: With dead ends: 54 [2018-06-22 01:14:11,616 INFO ]: Without dead ends: 47 [2018-06-22 01:14:11,616 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:14:11,616 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:14:11,617 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-06-22 01:14:11,617 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:14:11,617 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-06-22 01:14:11,618 INFO ]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2018-06-22 01:14:11,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:11,618 INFO ]: Abstraction has 36 states and 42 transitions. [2018-06-22 01:14:11,618 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:14:11,618 INFO ]: Start isEmpty. Operand 36 states and 42 transitions. [2018-06-22 01:14:11,618 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:14:11,618 INFO ]: Found error trace [2018-06-22 01:14:11,618 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:11,618 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:11,618 INFO ]: Analyzing trace with hash -1322148638, now seen corresponding path program 11 times [2018-06-22 01:14:11,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:11,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:11,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:11,619 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:11,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:11,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:11,972 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:11,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:11,972 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) [2018-06-22 01:14:11,984 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:12,023 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:14:12,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:12,025 INFO ]: Computing forward predicates... [2018-06-22 01:14:12,072 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:12,091 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:12,091 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-22 01:14:12,092 INFO ]: Interpolant automaton has 18 states [2018-06-22 01:14:12,092 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 01:14:12,092 INFO ]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:14:12,092 INFO ]: Start difference. First operand 36 states and 42 transitions. Second operand 18 states. [2018-06-22 01:14:12,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:12,188 INFO ]: Finished difference Result 48 states and 55 transitions. [2018-06-22 01:14:12,188 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:14:12,188 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-22 01:14:12,188 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:12,188 INFO ]: With dead ends: 48 [2018-06-22 01:14:12,188 INFO ]: Without dead ends: 48 [2018-06-22 01:14:12,189 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:14:12,189 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:14:12,190 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-06-22 01:14:12,190 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 01:14:12,190 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-06-22 01:14:12,190 INFO ]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2018-06-22 01:14:12,190 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:12,190 INFO ]: Abstraction has 34 states and 39 transitions. [2018-06-22 01:14:12,190 INFO ]: Interpolant automaton has 18 states. [2018-06-22 01:14:12,190 INFO ]: Start isEmpty. Operand 34 states and 39 transitions. [2018-06-22 01:14:12,190 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 01:14:12,191 INFO ]: Found error trace [2018-06-22 01:14:12,191 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:12,191 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:12,191 INFO ]: Analyzing trace with hash -2075273813, now seen corresponding path program 12 times [2018-06-22 01:14:12,191 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:12,191 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:12,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:12,191 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:12,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:12,197 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:12,668 INFO ]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:12,668 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:12,668 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:12,674 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:12,698 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:14:12,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:12,700 INFO ]: Computing forward predicates... [2018-06-22 01:14:12,786 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:12,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:12,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-22 01:14:12,806 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:14:12,806 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:14:12,806 INFO ]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:14:12,806 INFO ]: Start difference. First operand 34 states and 39 transitions. Second operand 19 states. [2018-06-22 01:14:12,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:12,914 INFO ]: Finished difference Result 45 states and 51 transitions. [2018-06-22 01:14:12,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:14:12,914 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-22 01:14:12,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:12,914 INFO ]: With dead ends: 45 [2018-06-22 01:14:12,914 INFO ]: Without dead ends: 38 [2018-06-22 01:14:12,915 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:14:12,915 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:14:12,916 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-06-22 01:14:12,916 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 01:14:12,916 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-22 01:14:12,916 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 20 [2018-06-22 01:14:12,916 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:12,916 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-22 01:14:12,916 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:14:12,916 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-22 01:14:12,916 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:14:12,916 INFO ]: Found error trace [2018-06-22 01:14:12,916 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:12,916 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:12,916 INFO ]: Analyzing trace with hash -1853311656, now seen corresponding path program 12 times [2018-06-22 01:14:12,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:12,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:12,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:12,917 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:12,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:12,928 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:13,216 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:13,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:13,216 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) [2018-06-22 01:14:13,230 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:13,278 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:14:13,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:13,281 INFO ]: Computing forward predicates... [2018-06-22 01:14:14,004 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:14,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:14,036 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-22 01:14:14,036 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:14:14,036 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:14:14,036 INFO ]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:14:14,036 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 30 states. [2018-06-22 01:14:14,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:14,738 INFO ]: Finished difference Result 82 states and 94 transitions. [2018-06-22 01:14:14,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:14:14,738 INFO ]: Start accepts. Automaton has 30 states. Word has length 21 [2018-06-22 01:14:14,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:14,738 INFO ]: With dead ends: 82 [2018-06-22 01:14:14,738 INFO ]: Without dead ends: 82 [2018-06-22 01:14:14,739 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=1849, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:14:14,739 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 01:14:14,740 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 44. [2018-06-22 01:14:14,740 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:14:14,740 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-06-22 01:14:14,740 INFO ]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2018-06-22 01:14:14,740 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:14,740 INFO ]: Abstraction has 44 states and 51 transitions. [2018-06-22 01:14:14,740 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:14:14,740 INFO ]: Start isEmpty. Operand 44 states and 51 transitions. [2018-06-22 01:14:14,740 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 01:14:14,740 INFO ]: Found error trace [2018-06-22 01:14:14,740 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:14,741 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:14,741 INFO ]: Analyzing trace with hash 1911997819, now seen corresponding path program 13 times [2018-06-22 01:14:14,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:14,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:14,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:14,741 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:14,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:14,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:15,720 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:15,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:15,720 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:15,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:15,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:15,752 INFO ]: Computing forward predicates... [2018-06-22 01:14:16,552 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:16,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:16,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-22 01:14:16,571 INFO ]: Interpolant automaton has 30 states [2018-06-22 01:14:16,571 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 01:14:16,571 INFO ]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:14:16,571 INFO ]: Start difference. First operand 44 states and 51 transitions. Second operand 30 states. [2018-06-22 01:14:17,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:17,215 INFO ]: Finished difference Result 85 states and 98 transitions. [2018-06-22 01:14:17,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:14:17,215 INFO ]: Start accepts. Automaton has 30 states. Word has length 21 [2018-06-22 01:14:17,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:17,216 INFO ]: With dead ends: 85 [2018-06-22 01:14:17,216 INFO ]: Without dead ends: 85 [2018-06-22 01:14:17,216 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=221, Invalid=1849, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 01:14:17,216 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 01:14:17,217 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 51. [2018-06-22 01:14:17,217 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:14:17,218 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-06-22 01:14:17,218 INFO ]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 21 [2018-06-22 01:14:17,218 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:17,218 INFO ]: Abstraction has 51 states and 59 transitions. [2018-06-22 01:14:17,218 INFO ]: Interpolant automaton has 30 states. [2018-06-22 01:14:17,218 INFO ]: Start isEmpty. Operand 51 states and 59 transitions. [2018-06-22 01:14:17,218 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:14:17,218 INFO ]: Found error trace [2018-06-22 01:14:17,218 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:17,218 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:17,218 INFO ]: Analyzing trace with hash 215620110, now seen corresponding path program 6 times [2018-06-22 01:14:17,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:17,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:17,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:17,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:17,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:17,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:17,601 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:17,601 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:17,601 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:17,607 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:17,635 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:14:17,635 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:17,637 INFO ]: Computing forward predicates... [2018-06-22 01:14:18,292 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:18,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:18,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-22 01:14:18,311 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:14:18,311 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:14:18,311 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:14:18,311 INFO ]: Start difference. First operand 51 states and 59 transitions. Second operand 25 states. [2018-06-22 01:14:18,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:18,680 INFO ]: Finished difference Result 88 states and 102 transitions. [2018-06-22 01:14:18,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:14:18,680 INFO ]: Start accepts. Automaton has 25 states. Word has length 22 [2018-06-22 01:14:18,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:18,680 INFO ]: With dead ends: 88 [2018-06-22 01:14:18,680 INFO ]: Without dead ends: 88 [2018-06-22 01:14:18,680 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:14:18,681 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 01:14:18,682 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 47. [2018-06-22 01:14:18,682 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:14:18,683 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-06-22 01:14:18,683 INFO ]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 22 [2018-06-22 01:14:18,684 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:18,684 INFO ]: Abstraction has 47 states and 55 transitions. [2018-06-22 01:14:18,684 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:14:18,684 INFO ]: Start isEmpty. Operand 47 states and 55 transitions. [2018-06-22 01:14:18,684 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:14:18,684 INFO ]: Found error trace [2018-06-22 01:14:18,684 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:18,684 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:18,684 INFO ]: Analyzing trace with hash -314037711, now seen corresponding path program 5 times [2018-06-22 01:14:18,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:18,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:18,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:18,685 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:18,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:18,690 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:18,899 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:18,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:18,899 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:18,906 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:18,934 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:14:18,934 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:18,936 INFO ]: Computing forward predicates... [2018-06-22 01:14:18,972 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:18,992 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:19,005 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-22 01:14:19,005 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:14:19,005 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:14:19,005 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:14:19,005 INFO ]: Start difference. First operand 47 states and 55 transitions. Second operand 17 states. [2018-06-22 01:14:19,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:19,434 INFO ]: Finished difference Result 91 states and 106 transitions. [2018-06-22 01:14:19,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:14:19,434 INFO ]: Start accepts. Automaton has 17 states. Word has length 22 [2018-06-22 01:14:19,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:19,434 INFO ]: With dead ends: 91 [2018-06-22 01:14:19,434 INFO ]: Without dead ends: 91 [2018-06-22 01:14:19,434 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:19,435 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:14:19,436 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 41. [2018-06-22 01:14:19,436 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:14:19,437 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-06-22 01:14:19,437 INFO ]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 22 [2018-06-22 01:14:19,437 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:19,437 INFO ]: Abstraction has 41 states and 48 transitions. [2018-06-22 01:14:19,437 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:14:19,437 INFO ]: Start isEmpty. Operand 41 states and 48 transitions. [2018-06-22 01:14:19,437 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:14:19,437 INFO ]: Found error trace [2018-06-22 01:14:19,437 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:19,437 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:19,437 INFO ]: Analyzing trace with hash 112235710, now seen corresponding path program 13 times [2018-06-22 01:14:19,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:19,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:19,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:19,438 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:19,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:19,443 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:19,586 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:19,586 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:19,586 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:19,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:19,620 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:19,621 INFO ]: Computing forward predicates... [2018-06-22 01:14:19,678 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:19,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:19,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-22 01:14:19,697 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:14:19,697 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:14:19,697 INFO ]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:14:19,697 INFO ]: Start difference. First operand 41 states and 48 transitions. Second operand 21 states. [2018-06-22 01:14:19,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:19,836 INFO ]: Finished difference Result 60 states and 69 transitions. [2018-06-22 01:14:19,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:14:19,836 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-22 01:14:19,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:19,836 INFO ]: With dead ends: 60 [2018-06-22 01:14:19,836 INFO ]: Without dead ends: 60 [2018-06-22 01:14:19,836 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:14:19,836 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:14:19,837 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 39. [2018-06-22 01:14:19,837 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:14:19,837 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-06-22 01:14:19,837 INFO ]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2018-06-22 01:14:19,837 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:19,837 INFO ]: Abstraction has 39 states and 45 transitions. [2018-06-22 01:14:19,837 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:14:19,837 INFO ]: Start isEmpty. Operand 39 states and 45 transitions. [2018-06-22 01:14:19,838 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:14:19,838 INFO ]: Found error trace [2018-06-22 01:14:19,838 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:19,838 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:19,838 INFO ]: Analyzing trace with hash -1677465540, now seen corresponding path program 14 times [2018-06-22 01:14:19,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:19,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:19,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:19,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:19,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:19,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:19,969 INFO ]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:19,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:19,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:19,974 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:20,000 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:20,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:20,001 INFO ]: Computing forward predicates... [2018-06-22 01:14:20,081 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:20,100 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:20,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-22 01:14:20,100 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:14:20,100 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:14:20,100 INFO ]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:20,100 INFO ]: Start difference. First operand 39 states and 45 transitions. Second operand 22 states. [2018-06-22 01:14:20,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:20,220 INFO ]: Finished difference Result 60 states and 68 transitions. [2018-06-22 01:14:20,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:14:20,220 INFO ]: Start accepts. Automaton has 22 states. Word has length 22 [2018-06-22 01:14:20,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:20,220 INFO ]: With dead ends: 60 [2018-06-22 01:14:20,220 INFO ]: Without dead ends: 52 [2018-06-22 01:14:20,220 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:14:20,220 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 01:14:20,221 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-06-22 01:14:20,221 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:14:20,221 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-06-22 01:14:20,221 INFO ]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 22 [2018-06-22 01:14:20,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:20,221 INFO ]: Abstraction has 40 states and 46 transitions. [2018-06-22 01:14:20,221 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:14:20,221 INFO ]: Start isEmpty. Operand 40 states and 46 transitions. [2018-06-22 01:14:20,221 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:14:20,221 INFO ]: Found error trace [2018-06-22 01:14:20,221 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:20,222 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:20,222 INFO ]: Analyzing trace with hash 963366827, now seen corresponding path program 14 times [2018-06-22 01:14:20,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:20,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:20,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:20,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:20,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:20,226 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:20,478 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:20,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:20,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:20,486 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:20,514 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:20,514 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:20,516 INFO ]: Computing forward predicates... [2018-06-22 01:14:20,590 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:20,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:20,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-22 01:14:20,621 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:14:20,621 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:14:20,621 INFO ]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:14:20,621 INFO ]: Start difference. First operand 40 states and 46 transitions. Second operand 21 states. [2018-06-22 01:14:21,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:21,102 INFO ]: Finished difference Result 53 states and 60 transitions. [2018-06-22 01:14:21,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:14:21,103 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-22 01:14:21,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:21,103 INFO ]: With dead ends: 53 [2018-06-22 01:14:21,103 INFO ]: Without dead ends: 53 [2018-06-22 01:14:21,103 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:14:21,103 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 01:14:21,104 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-06-22 01:14:21,104 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:14:21,104 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-06-22 01:14:21,104 INFO ]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 22 [2018-06-22 01:14:21,104 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:21,104 INFO ]: Abstraction has 38 states and 43 transitions. [2018-06-22 01:14:21,104 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:14:21,104 INFO ]: Start isEmpty. Operand 38 states and 43 transitions. [2018-06-22 01:14:21,104 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 01:14:21,104 INFO ]: Found error trace [2018-06-22 01:14:21,104 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:21,104 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:21,105 INFO ]: Analyzing trace with hash -908677118, now seen corresponding path program 15 times [2018-06-22 01:14:21,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:21,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:21,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:21,105 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:21,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:21,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:21,195 INFO ]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:21,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:21,195 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:21,200 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:21,227 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:14:21,227 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:21,229 INFO ]: Computing forward predicates... [2018-06-22 01:14:21,306 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:21,325 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:21,325 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-22 01:14:21,325 INFO ]: Interpolant automaton has 22 states [2018-06-22 01:14:21,325 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 01:14:21,325 INFO ]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:14:21,325 INFO ]: Start difference. First operand 38 states and 43 transitions. Second operand 22 states. [2018-06-22 01:14:21,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:21,448 INFO ]: Finished difference Result 50 states and 56 transitions. [2018-06-22 01:14:21,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:14:21,448 INFO ]: Start accepts. Automaton has 22 states. Word has length 22 [2018-06-22 01:14:21,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:21,448 INFO ]: With dead ends: 50 [2018-06-22 01:14:21,448 INFO ]: Without dead ends: 42 [2018-06-22 01:14:21,448 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-22 01:14:21,448 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 01:14:21,449 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-06-22 01:14:21,449 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:14:21,449 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-22 01:14:21,449 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2018-06-22 01:14:21,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:21,449 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-22 01:14:21,449 INFO ]: Interpolant automaton has 22 states. [2018-06-22 01:14:21,449 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-22 01:14:21,449 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:14:21,449 INFO ]: Found error trace [2018-06-22 01:14:21,449 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:21,449 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:21,449 INFO ]: Analyzing trace with hash -875039338, now seen corresponding path program 15 times [2018-06-22 01:14:21,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:21,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:21,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:21,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:21,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:21,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:21,694 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:21,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:21,694 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:21,700 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:21,730 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:14:21,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:21,733 INFO ]: Computing forward predicates... [2018-06-22 01:14:22,090 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:22,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:22,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-22 01:14:22,110 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:14:22,110 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:14:22,110 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:22,110 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 34 states. [2018-06-22 01:14:22,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:22,680 INFO ]: Finished difference Result 91 states and 103 transitions. [2018-06-22 01:14:22,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:14:22,680 INFO ]: Start accepts. Automaton has 34 states. Word has length 23 [2018-06-22 01:14:22,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:22,681 INFO ]: With dead ends: 91 [2018-06-22 01:14:22,681 INFO ]: Without dead ends: 91 [2018-06-22 01:14:22,681 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=2400, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:14:22,681 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:14:22,683 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 49. [2018-06-22 01:14:22,683 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:14:22,683 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-06-22 01:14:22,683 INFO ]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 23 [2018-06-22 01:14:22,683 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:22,683 INFO ]: Abstraction has 49 states and 56 transitions. [2018-06-22 01:14:22,683 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:14:22,683 INFO ]: Start isEmpty. Operand 49 states and 56 transitions. [2018-06-22 01:14:22,683 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 01:14:22,683 INFO ]: Found error trace [2018-06-22 01:14:22,684 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:22,684 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:22,684 INFO ]: Analyzing trace with hash -251466798, now seen corresponding path program 16 times [2018-06-22 01:14:22,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:22,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:22,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:22,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:22,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:22,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:23,290 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:23,290 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:23,290 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:23,295 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:23,322 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:23,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:23,325 INFO ]: Computing forward predicates... [2018-06-22 01:14:23,712 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:23,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:23,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-22 01:14:23,731 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:14:23,731 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:14:23,731 INFO ]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:23,732 INFO ]: Start difference. First operand 49 states and 56 transitions. Second operand 34 states. [2018-06-22 01:14:24,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:24,527 INFO ]: Finished difference Result 94 states and 107 transitions. [2018-06-22 01:14:24,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:14:24,527 INFO ]: Start accepts. Automaton has 34 states. Word has length 23 [2018-06-22 01:14:24,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:24,527 INFO ]: With dead ends: 94 [2018-06-22 01:14:24,527 INFO ]: Without dead ends: 94 [2018-06-22 01:14:24,527 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=2400, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:14:24,528 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 01:14:24,529 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 57. [2018-06-22 01:14:24,529 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:14:24,529 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-06-22 01:14:24,529 INFO ]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 23 [2018-06-22 01:14:24,529 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:24,529 INFO ]: Abstraction has 57 states and 65 transitions. [2018-06-22 01:14:24,529 INFO ]: Interpolant automaton has 34 states. [2018-06-22 01:14:24,529 INFO ]: Start isEmpty. Operand 57 states and 65 transitions. [2018-06-22 01:14:24,529 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:14:24,529 INFO ]: Found error trace [2018-06-22 01:14:24,529 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:24,529 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:24,529 INFO ]: Analyzing trace with hash -1201470260, now seen corresponding path program 7 times [2018-06-22 01:14:24,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:24,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:24,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:24,530 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:24,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:24,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:24,857 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:24,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:24,857 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-22 01:14:24,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:24,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:24,892 INFO ]: Computing forward predicates... [2018-06-22 01:14:25,063 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:25,081 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:25,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-22 01:14:25,082 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:14:25,082 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:14:25,082 INFO ]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:14:25,082 INFO ]: Start difference. First operand 57 states and 65 transitions. Second operand 28 states. [2018-06-22 01:14:25,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:25,525 INFO ]: Finished difference Result 97 states and 111 transitions. [2018-06-22 01:14:25,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:14:25,525 INFO ]: Start accepts. Automaton has 28 states. Word has length 24 [2018-06-22 01:14:25,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:25,526 INFO ]: With dead ends: 97 [2018-06-22 01:14:25,526 INFO ]: Without dead ends: 97 [2018-06-22 01:14:25,526 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 01:14:25,526 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 01:14:25,528 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 52. [2018-06-22 01:14:25,528 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:14:25,528 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-06-22 01:14:25,528 INFO ]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 24 [2018-06-22 01:14:25,528 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:25,528 INFO ]: Abstraction has 52 states and 60 transitions. [2018-06-22 01:14:25,528 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:14:25,528 INFO ]: Start isEmpty. Operand 52 states and 60 transitions. [2018-06-22 01:14:25,529 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:14:25,529 INFO ]: Found error trace [2018-06-22 01:14:25,529 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:25,529 INFO ]: === Iteration 61 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:25,529 INFO ]: Analyzing trace with hash -577897720, now seen corresponding path program 6 times [2018-06-22 01:14:25,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:25,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:25,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:25,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:25,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:25,537 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:25,754 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:25,754 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:25,754 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-22 01:14:25,761 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:25,793 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:14:25,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:25,795 INFO ]: Computing forward predicates... [2018-06-22 01:14:25,878 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:25,897 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:25,897 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-22 01:14:25,898 INFO ]: Interpolant automaton has 19 states [2018-06-22 01:14:25,898 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 01:14:25,898 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:14:25,898 INFO ]: Start difference. First operand 52 states and 60 transitions. Second operand 19 states. [2018-06-22 01:14:26,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:26,404 INFO ]: Finished difference Result 100 states and 115 transitions. [2018-06-22 01:14:26,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:14:26,404 INFO ]: Start accepts. Automaton has 19 states. Word has length 24 [2018-06-22 01:14:26,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:26,404 INFO ]: With dead ends: 100 [2018-06-22 01:14:26,404 INFO ]: Without dead ends: 100 [2018-06-22 01:14:26,405 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:26,405 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 01:14:26,406 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 45. [2018-06-22 01:14:26,406 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:14:26,407 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-22 01:14:26,407 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2018-06-22 01:14:26,407 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:26,407 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-22 01:14:26,407 INFO ]: Interpolant automaton has 19 states. [2018-06-22 01:14:26,407 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-22 01:14:26,407 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:14:26,407 INFO ]: Found error trace [2018-06-22 01:14:26,407 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:26,407 INFO ]: === Iteration 62 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:26,407 INFO ]: Analyzing trace with hash -1769630852, now seen corresponding path program 16 times [2018-06-22 01:14:26,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:26,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:26,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:26,408 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:26,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:26,414 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:26,528 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:26,529 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:26,529 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:26,536 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:26,575 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:26,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:26,577 INFO ]: Computing forward predicates... [2018-06-22 01:14:26,648 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:26,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:26,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-22 01:14:26,668 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:14:26,668 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:14:26,669 INFO ]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:14:26,669 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 24 states. [2018-06-22 01:14:26,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:26,873 INFO ]: Finished difference Result 66 states and 75 transitions. [2018-06-22 01:14:26,873 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:14:26,873 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-22 01:14:26,873 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:26,873 INFO ]: With dead ends: 66 [2018-06-22 01:14:26,873 INFO ]: Without dead ends: 66 [2018-06-22 01:14:26,873 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=692, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:14:26,873 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 01:14:26,874 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-06-22 01:14:26,874 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:14:26,874 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-06-22 01:14:26,874 INFO ]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 24 [2018-06-22 01:14:26,874 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:26,874 INFO ]: Abstraction has 43 states and 49 transitions. [2018-06-22 01:14:26,874 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:14:26,874 INFO ]: Start isEmpty. Operand 43 states and 49 transitions. [2018-06-22 01:14:26,874 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:14:26,874 INFO ]: Found error trace [2018-06-22 01:14:26,875 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:26,875 INFO ]: === Iteration 63 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:26,875 INFO ]: Analyzing trace with hash -1415794754, now seen corresponding path program 17 times [2018-06-22 01:14:26,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:26,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:26,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:26,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:26,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:26,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:26,985 INFO ]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:26,985 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:26,985 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:26,992 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:27,025 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:14:27,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:27,027 INFO ]: Computing forward predicates... [2018-06-22 01:14:27,129 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:27,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:27,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-06-22 01:14:27,148 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:14:27,148 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:14:27,148 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:14:27,149 INFO ]: Start difference. First operand 43 states and 49 transitions. Second operand 25 states. [2018-06-22 01:14:27,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:27,375 INFO ]: Finished difference Result 66 states and 74 transitions. [2018-06-22 01:14:27,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:14:27,375 INFO ]: Start accepts. Automaton has 25 states. Word has length 24 [2018-06-22 01:14:27,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:27,376 INFO ]: With dead ends: 66 [2018-06-22 01:14:27,376 INFO ]: Without dead ends: 57 [2018-06-22 01:14:27,376 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:27,376 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 01:14:27,377 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-22 01:14:27,377 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:14:27,377 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-06-22 01:14:27,377 INFO ]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2018-06-22 01:14:27,377 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:27,377 INFO ]: Abstraction has 44 states and 50 transitions. [2018-06-22 01:14:27,377 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:14:27,377 INFO ]: Start isEmpty. Operand 44 states and 50 transitions. [2018-06-22 01:14:27,378 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:14:27,378 INFO ]: Found error trace [2018-06-22 01:14:27,378 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:27,378 INFO ]: === Iteration 64 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:27,378 INFO ]: Analyzing trace with hash -1352783358, now seen corresponding path program 17 times [2018-06-22 01:14:27,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:27,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:27,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:27,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:27,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:27,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:27,488 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:27,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:27,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:27,495 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:14:27,528 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:14:27,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:27,530 INFO ]: Computing forward predicates... [2018-06-22 01:14:27,674 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:27,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:27,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-22 01:14:27,694 INFO ]: Interpolant automaton has 24 states [2018-06-22 01:14:27,694 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 01:14:27,694 INFO ]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:14:27,694 INFO ]: Start difference. First operand 44 states and 50 transitions. Second operand 24 states. [2018-06-22 01:14:27,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:27,865 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-22 01:14:27,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:14:27,866 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-22 01:14:27,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:27,867 INFO ]: With dead ends: 58 [2018-06-22 01:14:27,867 INFO ]: Without dead ends: 58 [2018-06-22 01:14:27,867 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=692, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:14:27,867 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 01:14:27,868 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-06-22 01:14:27,868 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:14:27,868 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-22 01:14:27,868 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 24 [2018-06-22 01:14:27,868 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:27,868 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-22 01:14:27,868 INFO ]: Interpolant automaton has 24 states. [2018-06-22 01:14:27,868 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-22 01:14:27,868 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:14:27,868 INFO ]: Found error trace [2018-06-22 01:14:27,868 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:27,868 INFO ]: === Iteration 65 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:27,868 INFO ]: Analyzing trace with hash 743396491, now seen corresponding path program 18 times [2018-06-22 01:14:27,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:27,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:27,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:27,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:27,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:27,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:27,994 INFO ]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:27,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:27,994 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:28,000 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:28,035 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:14:28,035 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:28,037 INFO ]: Computing forward predicates... [2018-06-22 01:14:28,209 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:28,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:28,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-06-22 01:14:28,228 INFO ]: Interpolant automaton has 25 states [2018-06-22 01:14:28,229 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 01:14:28,229 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:14:28,229 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 25 states. [2018-06-22 01:14:28,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:28,588 INFO ]: Finished difference Result 55 states and 61 transitions. [2018-06-22 01:14:28,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:14:28,588 INFO ]: Start accepts. Automaton has 25 states. Word has length 24 [2018-06-22 01:14:28,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:28,589 INFO ]: With dead ends: 55 [2018-06-22 01:14:28,589 INFO ]: Without dead ends: 46 [2018-06-22 01:14:28,589 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:28,589 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 01:14:28,590 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-06-22 01:14:28,590 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:14:28,590 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-06-22 01:14:28,590 INFO ]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-06-22 01:14:28,590 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:28,590 INFO ]: Abstraction has 43 states and 48 transitions. [2018-06-22 01:14:28,590 INFO ]: Interpolant automaton has 25 states. [2018-06-22 01:14:28,590 INFO ]: Start isEmpty. Operand 43 states and 48 transitions. [2018-06-22 01:14:28,590 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:14:28,590 INFO ]: Found error trace [2018-06-22 01:14:28,591 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:28,591 INFO ]: === Iteration 66 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:28,591 INFO ]: Analyzing trace with hash 916639384, now seen corresponding path program 18 times [2018-06-22 01:14:28,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:28,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:28,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:28,591 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:28,591 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:28,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:29,511 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:29,511 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:29,640 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:29,646 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:14:29,680 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 01:14:29,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:29,683 INFO ]: Computing forward predicates... [2018-06-22 01:14:30,150 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:30,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:30,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-06-22 01:14:30,169 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:14:30,169 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:14:30,169 INFO ]: CoverageRelationStatistics Valid=92, Invalid=1314, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:30,169 INFO ]: Start difference. First operand 43 states and 48 transitions. Second operand 38 states. [2018-06-22 01:14:30,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:30,918 INFO ]: Finished difference Result 100 states and 112 transitions. [2018-06-22 01:14:30,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:14:30,918 INFO ]: Start accepts. Automaton has 38 states. Word has length 25 [2018-06-22 01:14:30,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:30,918 INFO ]: With dead ends: 100 [2018-06-22 01:14:30,918 INFO ]: Without dead ends: 100 [2018-06-22 01:14:30,919 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=3023, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:14:30,919 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 01:14:30,920 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 54. [2018-06-22 01:14:30,920 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:14:30,920 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-06-22 01:14:30,920 INFO ]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 25 [2018-06-22 01:14:30,920 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:30,920 INFO ]: Abstraction has 54 states and 61 transitions. [2018-06-22 01:14:30,920 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:14:30,920 INFO ]: Start isEmpty. Operand 54 states and 61 transitions. [2018-06-22 01:14:30,920 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:14:30,920 INFO ]: Found error trace [2018-06-22 01:14:30,920 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:30,920 INFO ]: === Iteration 67 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:30,921 INFO ]: Analyzing trace with hash 962321499, now seen corresponding path program 19 times [2018-06-22 01:14:30,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:30,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:30,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:30,921 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:30,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:30,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:31,136 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:31,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:31,136 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:31,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:31,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:31,183 INFO ]: Computing forward predicates... [2018-06-22 01:14:31,846 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:31,866 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:31,866 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-06-22 01:14:31,866 INFO ]: Interpolant automaton has 38 states [2018-06-22 01:14:31,866 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 01:14:31,866 INFO ]: CoverageRelationStatistics Valid=92, Invalid=1314, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:31,866 INFO ]: Start difference. First operand 54 states and 61 transitions. Second operand 38 states. [2018-06-22 01:14:32,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:32,601 INFO ]: Finished difference Result 103 states and 116 transitions. [2018-06-22 01:14:32,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:14:32,601 INFO ]: Start accepts. Automaton has 38 states. Word has length 25 [2018-06-22 01:14:32,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:32,601 INFO ]: With dead ends: 103 [2018-06-22 01:14:32,601 INFO ]: Without dead ends: 103 [2018-06-22 01:14:32,602 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=283, Invalid=3023, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 01:14:32,602 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:14:32,604 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 63. [2018-06-22 01:14:32,604 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:14:32,604 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-06-22 01:14:32,604 INFO ]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 25 [2018-06-22 01:14:32,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:32,604 INFO ]: Abstraction has 63 states and 71 transitions. [2018-06-22 01:14:32,604 INFO ]: Interpolant automaton has 38 states. [2018-06-22 01:14:32,604 INFO ]: Start isEmpty. Operand 63 states and 71 transitions. [2018-06-22 01:14:32,605 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:14:32,605 INFO ]: Found error trace [2018-06-22 01:14:32,605 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:32,605 INFO ]: === Iteration 68 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:32,605 INFO ]: Analyzing trace with hash 749135950, now seen corresponding path program 8 times [2018-06-22 01:14:32,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:32,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:32,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:32,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:32,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:32,611 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:33,402 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:33,402 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:33,402 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:33,408 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:33,441 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:33,441 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:33,443 INFO ]: Computing forward predicates... [2018-06-22 01:14:33,647 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:33,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:33,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-22 01:14:33,666 INFO ]: Interpolant automaton has 31 states [2018-06-22 01:14:33,666 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 01:14:33,666 INFO ]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:14:33,666 INFO ]: Start difference. First operand 63 states and 71 transitions. Second operand 31 states. [2018-06-22 01:14:34,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:34,647 INFO ]: Finished difference Result 106 states and 120 transitions. [2018-06-22 01:14:34,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:14:34,673 INFO ]: Start accepts. Automaton has 31 states. Word has length 26 [2018-06-22 01:14:34,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:34,674 INFO ]: With dead ends: 106 [2018-06-22 01:14:34,674 INFO ]: Without dead ends: 106 [2018-06-22 01:14:34,674 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=2346, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 01:14:34,674 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 01:14:34,676 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 57. [2018-06-22 01:14:34,676 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:14:34,676 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-06-22 01:14:34,676 INFO ]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 26 [2018-06-22 01:14:34,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:34,676 INFO ]: Abstraction has 57 states and 65 transitions. [2018-06-22 01:14:34,676 INFO ]: Interpolant automaton has 31 states. [2018-06-22 01:14:34,676 INFO ]: Start isEmpty. Operand 57 states and 65 transitions. [2018-06-22 01:14:34,677 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:14:34,677 INFO ]: Found error trace [2018-06-22 01:14:34,677 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:34,677 INFO ]: === Iteration 69 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:34,677 INFO ]: Analyzing trace with hash 794818065, now seen corresponding path program 7 times [2018-06-22 01:14:34,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:34,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:34,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:34,677 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:34,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:34,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:34,955 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:34,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:34,955 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:34,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:35,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:35,017 INFO ]: Computing forward predicates... [2018-06-22 01:14:35,074 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:35,092 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:35,092 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-22 01:14:35,093 INFO ]: Interpolant automaton has 21 states [2018-06-22 01:14:35,093 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 01:14:35,093 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:14:35,093 INFO ]: Start difference. First operand 57 states and 65 transitions. Second operand 21 states. [2018-06-22 01:14:35,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:35,615 INFO ]: Finished difference Result 109 states and 124 transitions. [2018-06-22 01:14:35,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:14:35,615 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-22 01:14:35,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:35,616 INFO ]: With dead ends: 109 [2018-06-22 01:14:35,616 INFO ]: Without dead ends: 109 [2018-06-22 01:14:35,616 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:14:35,616 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 01:14:35,618 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 49. [2018-06-22 01:14:35,618 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:14:35,618 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-06-22 01:14:35,618 INFO ]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2018-06-22 01:14:35,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:35,618 INFO ]: Abstraction has 49 states and 56 transitions. [2018-06-22 01:14:35,618 INFO ]: Interpolant automaton has 21 states. [2018-06-22 01:14:35,618 INFO ]: Start isEmpty. Operand 49 states and 56 transitions. [2018-06-22 01:14:35,619 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:14:35,619 INFO ]: Found error trace [2018-06-22 01:14:35,619 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:35,619 INFO ]: === Iteration 70 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:35,619 INFO ]: Analyzing trace with hash 207653630, now seen corresponding path program 19 times [2018-06-22 01:14:35,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:35,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:35,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:35,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:35,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:35,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:35,829 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:35,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:35,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:35,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:35,867 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:35,869 INFO ]: Computing forward predicates... [2018-06-22 01:14:35,992 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:36,011 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:36,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-22 01:14:36,011 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:14:36,011 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:14:36,011 INFO ]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:14:36,011 INFO ]: Start difference. First operand 49 states and 56 transitions. Second operand 27 states. [2018-06-22 01:14:36,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:36,239 INFO ]: Finished difference Result 72 states and 81 transitions. [2018-06-22 01:14:36,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:14:36,239 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-22 01:14:36,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:36,239 INFO ]: With dead ends: 72 [2018-06-22 01:14:36,239 INFO ]: Without dead ends: 72 [2018-06-22 01:14:36,239 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:14:36,239 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:14:36,240 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 47. [2018-06-22 01:14:36,240 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:14:36,240 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-06-22 01:14:36,240 INFO ]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 26 [2018-06-22 01:14:36,240 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:36,241 INFO ]: Abstraction has 47 states and 53 transitions. [2018-06-22 01:14:36,241 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:14:36,241 INFO ]: Start isEmpty. Operand 47 states and 53 transitions. [2018-06-22 01:14:36,241 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:14:36,241 INFO ]: Found error trace [2018-06-22 01:14:36,241 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:36,241 INFO ]: === Iteration 71 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:36,241 INFO ]: Analyzing trace with hash -1708329220, now seen corresponding path program 20 times [2018-06-22 01:14:36,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:36,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:36,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:36,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:14:36,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:36,247 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:36,382 INFO ]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:36,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:36,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:36,388 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:36,422 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:36,422 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:36,424 INFO ]: Computing forward predicates... [2018-06-22 01:14:36,546 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:36,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:36,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-06-22 01:14:36,569 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:14:36,569 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:14:36,569 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:14:36,569 INFO ]: Start difference. First operand 47 states and 53 transitions. Second operand 28 states. [2018-06-22 01:14:36,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:36,741 INFO ]: Finished difference Result 72 states and 80 transitions. [2018-06-22 01:14:36,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:14:36,741 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-22 01:14:36,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:36,741 INFO ]: With dead ends: 72 [2018-06-22 01:14:36,741 INFO ]: Without dead ends: 62 [2018-06-22 01:14:36,741 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:36,741 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:14:36,742 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 48. [2018-06-22 01:14:36,742 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:14:36,742 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-06-22 01:14:36,743 INFO ]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 26 [2018-06-22 01:14:36,743 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:36,743 INFO ]: Abstraction has 48 states and 54 transitions. [2018-06-22 01:14:36,743 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:14:36,743 INFO ]: Start isEmpty. Operand 48 states and 54 transitions. [2018-06-22 01:14:36,743 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:14:36,743 INFO ]: Found error trace [2018-06-22 01:14:36,743 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:36,743 INFO ]: === Iteration 72 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:36,743 INFO ]: Analyzing trace with hash -840937845, now seen corresponding path program 20 times [2018-06-22 01:14:36,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:36,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:36,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:36,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:36,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:36,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:36,908 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:36,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:36,909 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:36,915 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:14:36,948 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:14:36,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:36,950 INFO ]: Computing forward predicates... [2018-06-22 01:14:37,035 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:37,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:37,054 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-22 01:14:37,054 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:14:37,054 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:14:37,054 INFO ]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:14:37,054 INFO ]: Start difference. First operand 48 states and 54 transitions. Second operand 27 states. [2018-06-22 01:14:37,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:37,257 INFO ]: Finished difference Result 63 states and 70 transitions. [2018-06-22 01:14:37,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:14:37,258 INFO ]: Start accepts. Automaton has 27 states. Word has length 26 [2018-06-22 01:14:37,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:37,259 INFO ]: With dead ends: 63 [2018-06-22 01:14:37,259 INFO ]: Without dead ends: 63 [2018-06-22 01:14:37,259 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:14:37,259 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 01:14:37,260 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-06-22 01:14:37,260 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:14:37,260 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-06-22 01:14:37,260 INFO ]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2018-06-22 01:14:37,260 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:37,260 INFO ]: Abstraction has 46 states and 51 transitions. [2018-06-22 01:14:37,260 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:14:37,260 INFO ]: Start isEmpty. Operand 46 states and 51 transitions. [2018-06-22 01:14:37,260 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-22 01:14:37,260 INFO ]: Found error trace [2018-06-22 01:14:37,260 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:37,260 INFO ]: === Iteration 73 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:37,261 INFO ]: Analyzing trace with hash -283871966, now seen corresponding path program 21 times [2018-06-22 01:14:37,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:37,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:37,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:37,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:37,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:37,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:37,630 INFO ]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:37,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:37,630 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:37,636 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:37,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:14:37,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:37,679 INFO ]: Computing forward predicates... [2018-06-22 01:14:37,794 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:37,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:37,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2018-06-22 01:14:37,812 INFO ]: Interpolant automaton has 28 states [2018-06-22 01:14:37,812 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 01:14:37,812 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:14:37,812 INFO ]: Start difference. First operand 46 states and 51 transitions. Second operand 28 states. [2018-06-22 01:14:37,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:37,968 INFO ]: Finished difference Result 60 states and 66 transitions. [2018-06-22 01:14:37,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:14:37,968 INFO ]: Start accepts. Automaton has 28 states. Word has length 26 [2018-06-22 01:14:37,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:37,968 INFO ]: With dead ends: 60 [2018-06-22 01:14:37,968 INFO ]: Without dead ends: 50 [2018-06-22 01:14:37,968 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 01:14:37,968 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 01:14:37,969 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-06-22 01:14:37,969 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 01:14:37,969 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-06-22 01:14:37,969 INFO ]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2018-06-22 01:14:37,969 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:37,969 INFO ]: Abstraction has 47 states and 52 transitions. [2018-06-22 01:14:37,969 INFO ]: Interpolant automaton has 28 states. [2018-06-22 01:14:37,969 INFO ]: Start isEmpty. Operand 47 states and 52 transitions. [2018-06-22 01:14:37,969 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:14:37,969 INFO ]: Found error trace [2018-06-22 01:14:37,970 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:37,970 INFO ]: === Iteration 74 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:37,970 INFO ]: Analyzing trace with hash 2082916182, now seen corresponding path program 21 times [2018-06-22 01:14:37,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:37,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:37,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:37,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:37,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:37,974 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:38,208 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:38,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:38,208 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:38,215 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:38,251 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:14:38,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:38,255 INFO ]: Computing forward predicates... [2018-06-22 01:14:38,991 WARN ]: Spent 243.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-06-22 01:14:39,779 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:39,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:39,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-06-22 01:14:39,799 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:14:39,799 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:14:39,799 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1620, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:14:39,799 INFO ]: Start difference. First operand 47 states and 52 transitions. Second operand 42 states. [2018-06-22 01:14:40,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:40,678 INFO ]: Finished difference Result 109 states and 121 transitions. [2018-06-22 01:14:40,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:14:40,678 INFO ]: Start accepts. Automaton has 42 states. Word has length 27 [2018-06-22 01:14:40,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:40,678 INFO ]: With dead ends: 109 [2018-06-22 01:14:40,678 INFO ]: Without dead ends: 109 [2018-06-22 01:14:40,678 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=314, Invalid=3718, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:14:40,679 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 01:14:40,680 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 59. [2018-06-22 01:14:40,680 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:14:40,681 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-06-22 01:14:40,681 INFO ]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 27 [2018-06-22 01:14:40,681 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:40,681 INFO ]: Abstraction has 59 states and 66 transitions. [2018-06-22 01:14:40,681 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:14:40,681 INFO ]: Start isEmpty. Operand 59 states and 66 transitions. [2018-06-22 01:14:40,681 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:14:40,681 INFO ]: Found error trace [2018-06-22 01:14:40,681 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:40,681 INFO ]: === Iteration 75 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:40,681 INFO ]: Analyzing trace with hash -350336782, now seen corresponding path program 22 times [2018-06-22 01:14:40,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:40,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:40,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:40,682 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:40,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:40,689 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:40,955 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:40,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:40,955 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:40,960 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:14:40,995 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:14:40,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:40,998 INFO ]: Computing forward predicates... [2018-06-22 01:14:41,515 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:41,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:41,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-06-22 01:14:41,534 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:14:41,534 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:14:41,535 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1620, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:14:41,535 INFO ]: Start difference. First operand 59 states and 66 transitions. Second operand 42 states. [2018-06-22 01:14:42,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:14:42,367 INFO ]: Finished difference Result 112 states and 125 transitions. [2018-06-22 01:14:42,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:14:42,367 INFO ]: Start accepts. Automaton has 42 states. Word has length 27 [2018-06-22 01:14:42,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:14:42,368 INFO ]: With dead ends: 112 [2018-06-22 01:14:42,368 INFO ]: Without dead ends: 112 [2018-06-22 01:14:42,368 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=314, Invalid=3718, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:14:42,368 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 01:14:42,370 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 69. [2018-06-22 01:14:42,370 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 01:14:42,370 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-06-22 01:14:42,370 INFO ]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 27 [2018-06-22 01:14:42,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:14:42,370 INFO ]: Abstraction has 69 states and 77 transitions. [2018-06-22 01:14:42,370 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:14:42,370 INFO ]: Start isEmpty. Operand 69 states and 77 transitions. [2018-06-22 01:14:42,371 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:14:42,371 INFO ]: Found error trace [2018-06-22 01:14:42,371 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:14:42,371 INFO ]: === Iteration 76 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:14:42,371 INFO ]: Analyzing trace with hash 25906060, now seen corresponding path program 9 times [2018-06-22 01:14:42,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:14:42,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:14:42,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:42,371 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:14:42,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:14:42,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:42,642 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:42,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:14:42,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:14:42,647 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:14:42,684 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 01:14:42,684 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:14:42,687 INFO ]: Computing forward predicates... [2018-06-22 01:14:42,928 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:14:42,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:14:42,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-22 01:14:42,948 INFO ]: Interpolant automaton has 34 states [2018-06-22 01:14:42,949 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 01:14:42,949 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:14:42,949 INFO ]: Start difference. First operand 69 states and 77 transitions. Second operand 34 states. Received shutdown request... [2018-06-22 01:14:43,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:14:43,156 WARN ]: Verification canceled [2018-06-22 01:14:43,256 WARN ]: Timeout [2018-06-22 01:14:43,256 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:14:43 BoogieIcfgContainer [2018-06-22 01:14:43,256 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:14:43,257 INFO ]: Toolchain (without parser) took 56930.36 ms. Allocated memory was 299.9 MB in the beginning and 744.5 MB in the end (delta: 444.6 MB). Free memory was 253.4 MB in the beginning and 719.2 MB in the end (delta: -465.7 MB). Peak memory consumption was 260.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:43,257 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 299.9 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:14:43,257 INFO ]: ChcToBoogie took 68.48 ms. Allocated memory is still 299.9 MB. Free memory was 253.4 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:43,258 INFO ]: Boogie Preprocessor took 48.62 ms. Allocated memory is still 299.9 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:43,258 INFO ]: RCFGBuilder took 418.34 ms. Allocated memory is still 299.9 MB. Free memory was 249.5 MB in the beginning and 236.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:43,258 INFO ]: TraceAbstraction took 56385.15 ms. Allocated memory was 299.9 MB in the beginning and 744.5 MB in the end (delta: 444.6 MB). Free memory was 236.5 MB in the beginning and 719.2 MB in the end (delta: -482.7 MB). Peak memory consumption was 243.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:14:43,260 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 299.9 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.48 ms. Allocated memory is still 299.9 MB. Free memory was 253.4 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.62 ms. Allocated memory is still 299.9 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 418.34 ms. Allocated memory is still 299.9 MB. Free memory was 249.5 MB in the beginning and 236.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56385.15 ms. Allocated memory was 299.9 MB in the beginning and 744.5 MB in the end (delta: 444.6 MB). Free memory was 236.5 MB in the beginning and 719.2 MB in the end (delta: -482.7 MB). Peak memory consumption was 243.3 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 (69states) and interpolant automaton (currently 10 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. TIMEOUT Result, 56.3s OverallTime, 76 OverallIterations, 8 TraceHistogramMax, 21.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1900 SDtfs, 2974 SDslu, 19081 SDs, 0 SdLazy, 13559 SolverSat, 1535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2854 GetRequests, 928 SyntacticMatches, 35 SemanticMatches, 1890 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=75, 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, 75 MinimizatonAttempts, 1616 StatesRemovedByMinimization, 73 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 2632 NumberOfCodeBlocks, 2632 NumberOfCodeBlocksAsserted, 226 NumberOfCheckSat, 2492 ConstructedInterpolants, 0 QuantifiedInterpolants, 247249 SizeOfPredicates, 526 NumberOfNonLiveVariables, 14878 ConjunctsInSsa, 3459 ConjunctsInUnsatCore, 140 InterpolantComputations, 14 PerfectInterpolantSequences, 836/3421 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/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-14-43-270.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-14-43-270.csv Completed graceful shutdown