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/loop3_merged_safe.c-1.smt2


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-8d74a04
[2018-06-22 01:12:31,696 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-06-22 01:12:31,699 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-06-22 01:12:31,713 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-06-22 01:12:31,714 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-06-22 01:12:31,714 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-06-22 01:12:31,716 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-06-22 01:12:31,718 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-06-22 01:12:31,719 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-06-22 01:12:31,720 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-06-22 01:12:31,722 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-06-22 01:12:31,722 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-06-22 01:12:31,723 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-06-22 01:12:31,724 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-06-22 01:12:31,725 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-06-22 01:12:31,725 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-06-22 01:12:31,729 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-06-22 01:12:31,731 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-06-22 01:12:31,743 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-06-22 01:12:31,744 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-06-22 01:12:31,745 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-06-22 01:12:31,747 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-06-22 01:12:31,748 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-06-22 01:12:31,748 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-06-22 01:12:31,749 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-06-22 01:12:31,749 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-06-22 01:12:31,750 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-06-22 01:12:31,758 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-06-22 01:12:31,760 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-06-22 01:12:31,760 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-06-22 01:12:31,760 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-06-22 01:12:31,761 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-06-22 01:12:31,761 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-06-22 01:12:31,762 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-06-22 01:12:31,762 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-06-22 01:12:31,763 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:12:31,788 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-06-22 01:12:31,788 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-06-22 01:12:31,789 INFO  L131        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2018-06-22 01:12:31,789 INFO  L133        SettingsManager]:  * Logger pattern=[%d{ISO8601} %-5p]: %m%n
[2018-06-22 01:12:31,790 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-06-22 01:12:31,790 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-06-22 01:12:31,790 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-06-22 01:12:31,790 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-06-22 01:12:31,792 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-06-22 01:12:31,792 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-06-22 01:12:31,792 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-06-22 01:12:31,792 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-06-22 01:12:31,792 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-06-22 01:12:31,793 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-06-22 01:12:31,793 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-06-22 01:12:31,793 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-06-22 01:12:31,793 INFO  L133        SettingsManager]:  * Compute trace for counterexample result=false
[2018-06-22 01:12:31,794 INFO  L131        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2018-06-22 01:12:31,795 INFO  L133        SettingsManager]:  * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true
[2018-06-22 01:12:31,835 INFO ]: Repository-Root is: /tmp
[2018-06-22 01:12:31,850 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-06-22 01:12:31,856 INFO ]: [Toolchain 1]: Toolchain data selected.
[2018-06-22 01:12:31,857 INFO ]: Initializing SmtParser...
[2018-06-22 01:12:31,857 INFO ]: SmtParser initialized
[2018-06-22 01:12:31,857 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2
[2018-06-22 01:12:31,858 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:12:31,927 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2
unknown
[2018-06-22 01:12:32,153 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2
[2018-06-22 01:12:32,158 INFO ]: ####################### [Toolchain 1] #######################
[2018-06-22 01:12:32,163 INFO ]: Walking toolchain with 4 elements.
[2018-06-22 01:12:32,164 INFO ]: ------------------------ChcToBoogie----------------------------
[2018-06-22 01:12:32,164 INFO ]: Initializing ChcToBoogie...
[2018-06-22 01:12:32,164 INFO ]: ChcToBoogie initialized
[2018-06-22 01:12:32,168 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,220 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32 Unit
[2018-06-22 01:12:32,220 INFO ]: ------------------------ END ChcToBoogie----------------------------
[2018-06-22 01:12:32,220 INFO ]: ------------------------Boogie Preprocessor----------------------------
[2018-06-22 01:12:32,221 INFO ]: Initializing Boogie Preprocessor...
[2018-06-22 01:12:32,221 INFO ]: Boogie Preprocessor initialized
[2018-06-22 01:12:32,239 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,239 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,245 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,245 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,250 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,253 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,254 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (1/1) ...
[2018-06-22 01:12:32,255 INFO ]: ------------------------ END Boogie Preprocessor----------------------------
[2018-06-22 01:12:32,256 INFO ]: ------------------------RCFGBuilder----------------------------
[2018-06-22 01:12:32,256 INFO ]: Initializing RCFGBuilder...
[2018-06-22 01:12:32,256 INFO ]: RCFGBuilder initialized
[2018-06-22 01:12:32,260 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (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:12:32,273 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration
[2018-06-22 01:12:32,273 INFO ]: Found specification of procedure gotoProc
[2018-06-22 01:12:32,273 INFO ]: Found implementation of procedure gotoProc
[2018-06-22 01:12:32,273 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2018-06-22 01:12:32,273 INFO ]: Found specification of procedure Ultimate.START
[2018-06-22 01:12:32,273 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:12:32,582 INFO ]: Using library mode
[2018-06-22 01:12:32,583 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:12:32 BoogieIcfgContainer
[2018-06-22 01:12:32,583 INFO ]: ------------------------ END RCFGBuilder----------------------------
[2018-06-22 01:12:32,584 INFO ]: ------------------------TraceAbstraction----------------------------
[2018-06-22 01:12:32,584 INFO ]: Initializing TraceAbstraction...
[2018-06-22 01:12:32,587 INFO ]: TraceAbstraction initialized
[2018-06-22 01:12:32,588 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:12:32" (1/3) ...
[2018-06-22 01:12:32,588 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f192946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:12:32, skipping insertion in model container
[2018-06-22 01:12:32,589 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:12:32" (2/3) ...
[2018-06-22 01:12:32,589 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f192946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:12:32, skipping insertion in model container
[2018-06-22 01:12:32,589 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:12:32" (3/3) ...
[2018-06-22 01:12:32,591 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2018-06-22 01:12:32,600 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-06-22 01:12:32,609 INFO ]: Appying trace abstraction to program that has 1 error locations.
[2018-06-22 01:12:32,646 INFO ]: Using default assertion order modulation
[2018-06-22 01:12:32,647 INFO ]: Interprodecural is true
[2018-06-22 01:12:32,647 INFO ]: Hoare is false
[2018-06-22 01:12:32,647 INFO ]: Compute interpolants for FPandBP
[2018-06-22 01:12:32,647 INFO ]: Backedges is TWOTRACK
[2018-06-22 01:12:32,647 INFO ]: Determinization is PREDICATE_ABSTRACTION
[2018-06-22 01:12:32,647 INFO ]: Difference is false
[2018-06-22 01:12:32,647 INFO ]: Minimize is MINIMIZE_SEVPA
[2018-06-22 01:12:32,647 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-06-22 01:12:32,658 INFO ]: Start isEmpty. Operand 14 states.
[2018-06-22 01:12:32,668 INFO ]: Finished isEmpty. Found accepting run of length 10
[2018-06-22 01:12:32,668 INFO ]: Found error trace
[2018-06-22 01:12:32,668 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:32,669 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:32,672 INFO ]: Analyzing trace with hash 875007416, now seen corresponding path program 1 times
[2018-06-22 01:12:32,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:32,674 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:32,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:32,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:32,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:32,743 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:32,843 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:12:32,845 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 01:12:32,845 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-06-22 01:12:32,846 INFO ]: Interpolant automaton has 4 states
[2018-06-22 01:12:32,856 INFO ]: Constructing interpolant automaton starting with 4 interpolants.
[2018-06-22 01:12:32,856 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-06-22 01:12:32,858 INFO ]: Start difference. First operand 14 states. Second operand 4 states.
[2018-06-22 01:12:32,952 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:32,952 INFO ]: Finished difference Result 15 states and 21 transitions.
[2018-06-22 01:12:32,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-06-22 01:12:32,954 INFO ]: Start accepts. Automaton has 4 states. Word has length 9
[2018-06-22 01:12:32,954 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:32,960 INFO ]: With dead ends: 15
[2018-06-22 01:12:32,960 INFO ]: Without dead ends: 14
[2018-06-22 01:12:32,962 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:12:32,974 INFO ]: Start minimizeSevpa. Operand 14 states.
[2018-06-22 01:12:32,990 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13.
[2018-06-22 01:12:32,992 INFO ]: Start removeUnreachable. Operand 13 states.
[2018-06-22 01:12:32,992 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions.
[2018-06-22 01:12:32,993 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 9
[2018-06-22 01:12:32,993 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:32,993 INFO ]: Abstraction has 13 states and 18 transitions.
[2018-06-22 01:12:32,993 INFO ]: Interpolant automaton has 4 states.
[2018-06-22 01:12:32,994 INFO ]: Start isEmpty. Operand 13 states and 18 transitions.
[2018-06-22 01:12:32,994 INFO ]: Finished isEmpty. Found accepting run of length 10
[2018-06-22 01:12:32,994 INFO ]: Found error trace
[2018-06-22 01:12:32,994 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:32,994 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:32,994 INFO ]: Analyzing trace with hash 559492109, now seen corresponding path program 1 times
[2018-06-22 01:12:32,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:32,994 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:32,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:32,995 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:32,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:33,005 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:33,254 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:12:33,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 01:12:33,255 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-06-22 01:12:33,256 INFO ]: Interpolant automaton has 5 states
[2018-06-22 01:12:33,256 INFO ]: Constructing interpolant automaton starting with 5 interpolants.
[2018-06-22 01:12:33,256 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-06-22 01:12:33,256 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 5 states.
[2018-06-22 01:12:33,534 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:33,534 INFO ]: Finished difference Result 17 states and 23 transitions.
[2018-06-22 01:12:33,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-06-22 01:12:33,534 INFO ]: Start accepts. Automaton has 5 states. Word has length 9
[2018-06-22 01:12:33,534 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:33,535 INFO ]: With dead ends: 17
[2018-06-22 01:12:33,535 INFO ]: Without dead ends: 16
[2018-06-22 01:12:33,536 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-06-22 01:12:33,536 INFO ]: Start minimizeSevpa. Operand 16 states.
[2018-06-22 01:12:33,538 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14.
[2018-06-22 01:12:33,539 INFO ]: Start removeUnreachable. Operand 14 states.
[2018-06-22 01:12:33,539 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions.
[2018-06-22 01:12:33,539 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9
[2018-06-22 01:12:33,539 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:33,539 INFO ]: Abstraction has 14 states and 19 transitions.
[2018-06-22 01:12:33,539 INFO ]: Interpolant automaton has 5 states.
[2018-06-22 01:12:33,539 INFO ]: Start isEmpty. Operand 14 states and 19 transitions.
[2018-06-22 01:12:33,540 INFO ]: Finished isEmpty. Found accepting run of length 12
[2018-06-22 01:12:33,540 INFO ]: Found error trace
[2018-06-22 01:12:33,540 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:33,540 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:33,540 INFO ]: Analyzing trace with hash 111073429, now seen corresponding path program 1 times
[2018-06-22 01:12:33,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:33,540 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:33,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:33,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:33,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:33,561 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:33,924 WARN ]: Spent 222.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15
[2018-06-22 01:12:34,026 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:12:34,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:34,026 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:12:34,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:34,052 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:34,058 INFO ]: Computing forward predicates...
[2018-06-22 01:12:34,672 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:12:34,702 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:34,702 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12
[2018-06-22 01:12:34,703 INFO ]: Interpolant automaton has 12 states
[2018-06-22 01:12:34,703 INFO ]: Constructing interpolant automaton starting with 12 interpolants.
[2018-06-22 01:12:34,703 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-06-22 01:12:34,703 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 12 states.
[2018-06-22 01:12:35,280 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24
[2018-06-22 01:12:35,458 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:35,458 INFO ]: Finished difference Result 29 states and 38 transitions.
[2018-06-22 01:12:35,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2018-06-22 01:12:35,480 INFO ]: Start accepts. Automaton has 12 states. Word has length 11
[2018-06-22 01:12:35,480 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:35,483 INFO ]: With dead ends: 29
[2018-06-22 01:12:35,483 INFO ]: Without dead ends: 28
[2018-06-22 01:12:35,484 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306
[2018-06-22 01:12:35,484 INFO ]: Start minimizeSevpa. Operand 28 states.
[2018-06-22 01:12:35,487 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 15.
[2018-06-22 01:12:35,487 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:12:35,487 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions.
[2018-06-22 01:12:35,487 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11
[2018-06-22 01:12:35,487 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:35,487 INFO ]: Abstraction has 15 states and 20 transitions.
[2018-06-22 01:12:35,487 INFO ]: Interpolant automaton has 12 states.
[2018-06-22 01:12:35,487 INFO ]: Start isEmpty. Operand 15 states and 20 transitions.
[2018-06-22 01:12:35,488 INFO ]: Finished isEmpty. Found accepting run of length 12
[2018-06-22 01:12:35,488 INFO ]: Found error trace
[2018-06-22 01:12:35,488 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:35,488 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:35,488 INFO ]: Analyzing trace with hash 1843541418, now seen corresponding path program 1 times
[2018-06-22 01:12:35,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:35,488 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:35,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:35,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:35,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:35,500 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:35,686 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:12:35,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:35,686 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:12:35,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:35,724 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:35,727 INFO ]: Computing forward predicates...
[2018-06-22 01:12:35,789 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-06-22 01:12:35,808 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-06-22 01:12:35,808 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2018-06-22 01:12:35,808 INFO ]: Interpolant automaton has 8 states
[2018-06-22 01:12:35,809 INFO ]: Constructing interpolant automaton starting with 8 interpolants.
[2018-06-22 01:12:35,809 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-06-22 01:12:35,809 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 8 states.
[2018-06-22 01:12:35,941 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:35,941 INFO ]: Finished difference Result 20 states and 26 transitions.
[2018-06-22 01:12:35,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 01:12:35,942 INFO ]: Start accepts. Automaton has 8 states. Word has length 11
[2018-06-22 01:12:35,942 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:35,942 INFO ]: With dead ends: 20
[2018-06-22 01:12:35,942 INFO ]: Without dead ends: 15
[2018-06-22 01:12:35,942 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2018-06-22 01:12:35,943 INFO ]: Start minimizeSevpa. Operand 15 states.
[2018-06-22 01:12:35,944 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2018-06-22 01:12:35,944 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:12:35,944 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions.
[2018-06-22 01:12:35,944 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11
[2018-06-22 01:12:35,945 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:35,945 INFO ]: Abstraction has 15 states and 19 transitions.
[2018-06-22 01:12:35,945 INFO ]: Interpolant automaton has 8 states.
[2018-06-22 01:12:35,945 INFO ]: Start isEmpty. Operand 15 states and 19 transitions.
[2018-06-22 01:12:35,945 INFO ]: Finished isEmpty. Found accepting run of length 12
[2018-06-22 01:12:35,945 INFO ]: Found error trace
[2018-06-22 01:12:35,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:35,945 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:35,945 INFO ]: Analyzing trace with hash 904906536, now seen corresponding path program 1 times
[2018-06-22 01:12:35,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:35,945 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:35,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:35,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:35,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:35,959 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:36,093 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:12:36,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:36,093 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:12:36,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:36,120 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:36,121 INFO ]: Computing forward predicates...
[2018-06-22 01:12:36,171 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:12:36,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:36,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11
[2018-06-22 01:12:36,192 INFO ]: Interpolant automaton has 11 states
[2018-06-22 01:12:36,193 INFO ]: Constructing interpolant automaton starting with 11 interpolants.
[2018-06-22 01:12:36,193 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2018-06-22 01:12:36,193 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 11 states.
[2018-06-22 01:12:36,463 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:36,463 INFO ]: Finished difference Result 31 states and 40 transitions.
[2018-06-22 01:12:36,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2018-06-22 01:12:36,465 INFO ]: Start accepts. Automaton has 11 states. Word has length 11
[2018-06-22 01:12:36,465 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:36,466 INFO ]: With dead ends: 31
[2018-06-22 01:12:36,466 INFO ]: Without dead ends: 29
[2018-06-22 01:12:36,466 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342
[2018-06-22 01:12:36,466 INFO ]: Start minimizeSevpa. Operand 29 states.
[2018-06-22 01:12:36,468 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 15.
[2018-06-22 01:12:36,468 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:12:36,469 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions.
[2018-06-22 01:12:36,469 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11
[2018-06-22 01:12:36,469 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:36,469 INFO ]: Abstraction has 15 states and 19 transitions.
[2018-06-22 01:12:36,469 INFO ]: Interpolant automaton has 11 states.
[2018-06-22 01:12:36,469 INFO ]: Start isEmpty. Operand 15 states and 19 transitions.
[2018-06-22 01:12:36,469 INFO ]: Finished isEmpty. Found accepting run of length 14
[2018-06-22 01:12:36,469 INFO ]: Found error trace
[2018-06-22 01:12:36,469 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:36,470 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:36,470 INFO ]: Analyzing trace with hash 409919538, now seen corresponding path program 2 times
[2018-06-22 01:12:36,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:36,470 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:36,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:36,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:36,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:36,483 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:36,565 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:12:36,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:36,565 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:12:36,571 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:12:36,596 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:12:36,596 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:36,599 INFO ]: Computing forward predicates...
[2018-06-22 01:12:36,727 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:36,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:36,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11
[2018-06-22 01:12:36,747 INFO ]: Interpolant automaton has 11 states
[2018-06-22 01:12:36,748 INFO ]: Constructing interpolant automaton starting with 11 interpolants.
[2018-06-22 01:12:36,748 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2018-06-22 01:12:36,748 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 11 states.
[2018-06-22 01:12:37,068 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:37,068 INFO ]: Finished difference Result 22 states and 27 transitions.
[2018-06-22 01:12:37,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-06-22 01:12:37,069 INFO ]: Start accepts. Automaton has 11 states. Word has length 13
[2018-06-22 01:12:37,069 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:37,069 INFO ]: With dead ends: 22
[2018-06-22 01:12:37,069 INFO ]: Without dead ends: 15
[2018-06-22 01:12:37,070 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240
[2018-06-22 01:12:37,070 INFO ]: Start minimizeSevpa. Operand 15 states.
[2018-06-22 01:12:37,071 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2018-06-22 01:12:37,071 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:12:37,071 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions.
[2018-06-22 01:12:37,071 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13
[2018-06-22 01:12:37,071 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:37,071 INFO ]: Abstraction has 15 states and 18 transitions.
[2018-06-22 01:12:37,071 INFO ]: Interpolant automaton has 11 states.
[2018-06-22 01:12:37,071 INFO ]: Start isEmpty. Operand 15 states and 18 transitions.
[2018-06-22 01:12:37,072 INFO ]: Finished isEmpty. Found accepting run of length 14
[2018-06-22 01:12:37,072 INFO ]: Found error trace
[2018-06-22 01:12:37,072 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:37,072 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:37,072 INFO ]: Analyzing trace with hash -1220643323, now seen corresponding path program 2 times
[2018-06-22 01:12:37,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:37,072 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:37,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:37,073 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:37,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:37,083 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:37,239 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-06-22 01:12:37,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:37,239 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:12:37,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:12:37,269 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:12:37,269 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:37,272 INFO ]: Computing forward predicates...
[2018-06-22 01:12:37,632 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:12:37,655 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:37,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14
[2018-06-22 01:12:37,655 INFO ]: Interpolant automaton has 14 states
[2018-06-22 01:12:37,655 INFO ]: Constructing interpolant automaton starting with 14 interpolants.
[2018-06-22 01:12:37,655 INFO ]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2018-06-22 01:12:37,655 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 14 states.
[2018-06-22 01:12:37,843 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 61
[2018-06-22 01:12:38,314 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:38,314 INFO ]: Finished difference Result 27 states and 33 transitions.
[2018-06-22 01:12:38,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2018-06-22 01:12:38,314 INFO ]: Start accepts. Automaton has 14 states. Word has length 13
[2018-06-22 01:12:38,314 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:38,314 INFO ]: With dead ends: 27
[2018-06-22 01:12:38,314 INFO ]: Without dead ends: 16
[2018-06-22 01:12:38,315 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600
[2018-06-22 01:12:38,315 INFO ]: Start minimizeSevpa. Operand 16 states.
[2018-06-22 01:12:38,316 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15.
[2018-06-22 01:12:38,316 INFO ]: Start removeUnreachable. Operand 15 states.
[2018-06-22 01:12:38,317 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions.
[2018-06-22 01:12:38,317 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13
[2018-06-22 01:12:38,317 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:38,317 INFO ]: Abstraction has 15 states and 17 transitions.
[2018-06-22 01:12:38,317 INFO ]: Interpolant automaton has 14 states.
[2018-06-22 01:12:38,317 INFO ]: Start isEmpty. Operand 15 states and 17 transitions.
[2018-06-22 01:12:38,317 INFO ]: Finished isEmpty. Found accepting run of length 15
[2018-06-22 01:12:38,317 INFO ]: Found error trace
[2018-06-22 01:12:38,317 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:38,318 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:38,319 INFO ]: Analyzing trace with hash -1203576939, now seen corresponding path program 1 times
[2018-06-22 01:12:38,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:38,319 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:38,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:38,320 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:38,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:38,337 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:38,476 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:12:38,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:38,476 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:12:38,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:38,509 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:38,511 INFO ]: Computing forward predicates...
[2018-06-22 01:12:38,748 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:12:38,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:38,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16
[2018-06-22 01:12:38,767 INFO ]: Interpolant automaton has 16 states
[2018-06-22 01:12:38,768 INFO ]: Constructing interpolant automaton starting with 16 interpolants.
[2018-06-22 01:12:38,768 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2018-06-22 01:12:38,768 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 16 states.
[2018-06-22 01:12:38,925 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:38,925 INFO ]: Finished difference Result 28 states and 34 transitions.
[2018-06-22 01:12:38,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2018-06-22 01:12:38,926 INFO ]: Start accepts. Automaton has 16 states. Word has length 14
[2018-06-22 01:12:38,926 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:38,926 INFO ]: With dead ends: 28
[2018-06-22 01:12:38,926 INFO ]: Without dead ends: 27
[2018-06-22 01:12:38,927 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552
[2018-06-22 01:12:38,927 INFO ]: Start minimizeSevpa. Operand 27 states.
[2018-06-22 01:12:38,929 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 18.
[2018-06-22 01:12:38,929 INFO ]: Start removeUnreachable. Operand 18 states.
[2018-06-22 01:12:38,929 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions.
[2018-06-22 01:12:38,929 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14
[2018-06-22 01:12:38,929 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:38,929 INFO ]: Abstraction has 18 states and 21 transitions.
[2018-06-22 01:12:38,929 INFO ]: Interpolant automaton has 16 states.
[2018-06-22 01:12:38,930 INFO ]: Start isEmpty. Operand 18 states and 21 transitions.
[2018-06-22 01:12:38,930 INFO ]: Finished isEmpty. Found accepting run of length 16
[2018-06-22 01:12:38,930 INFO ]: Found error trace
[2018-06-22 01:12:38,930 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:38,930 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:38,930 INFO ]: Analyzing trace with hash 317639826, now seen corresponding path program 1 times
[2018-06-22 01:12:38,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:38,930 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:38,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:38,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:38,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:38,942 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:39,045 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:39,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:39,045 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:12:39,054 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:39,082 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:39,085 INFO ]: Computing forward predicates...
[2018-06-22 01:12:39,388 INFO ]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:39,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:39,407 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12
[2018-06-22 01:12:39,408 INFO ]: Interpolant automaton has 12 states
[2018-06-22 01:12:39,408 INFO ]: Constructing interpolant automaton starting with 12 interpolants.
[2018-06-22 01:12:39,408 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2018-06-22 01:12:39,408 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 12 states.
[2018-06-22 01:12:39,562 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:39,562 INFO ]: Finished difference Result 30 states and 36 transitions.
[2018-06-22 01:12:39,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2018-06-22 01:12:39,563 INFO ]: Start accepts. Automaton has 12 states. Word has length 15
[2018-06-22 01:12:39,563 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:39,563 INFO ]: With dead ends: 30
[2018-06-22 01:12:39,563 INFO ]: Without dead ends: 29
[2018-06-22 01:12:39,564 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420
[2018-06-22 01:12:39,564 INFO ]: Start minimizeSevpa. Operand 29 states.
[2018-06-22 01:12:39,565 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 17.
[2018-06-22 01:12:39,565 INFO ]: Start removeUnreachable. Operand 17 states.
[2018-06-22 01:12:39,565 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions.
[2018-06-22 01:12:39,565 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15
[2018-06-22 01:12:39,565 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:39,565 INFO ]: Abstraction has 17 states and 19 transitions.
[2018-06-22 01:12:39,565 INFO ]: Interpolant automaton has 12 states.
[2018-06-22 01:12:39,565 INFO ]: Start isEmpty. Operand 17 states and 19 transitions.
[2018-06-22 01:12:39,565 INFO ]: Finished isEmpty. Found accepting run of length 17
[2018-06-22 01:12:39,565 INFO ]: Found error trace
[2018-06-22 01:12:39,565 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:39,565 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:39,566 INFO ]: Analyzing trace with hash -248699086, now seen corresponding path program 2 times
[2018-06-22 01:12:39,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:39,566 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:39,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:39,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:39,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:39,576 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:39,712 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:12:39,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:39,713 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:12:39,720 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:12:39,752 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:12:39,752 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:39,754 INFO ]: Computing forward predicates...
[2018-06-22 01:12:39,856 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:39,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:39,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14
[2018-06-22 01:12:39,876 INFO ]: Interpolant automaton has 14 states
[2018-06-22 01:12:39,876 INFO ]: Constructing interpolant automaton starting with 14 interpolants.
[2018-06-22 01:12:39,876 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182
[2018-06-22 01:12:39,876 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 14 states.
[2018-06-22 01:12:40,010 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:40,010 INFO ]: Finished difference Result 27 states and 31 transitions.
[2018-06-22 01:12:40,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2018-06-22 01:12:40,010 INFO ]: Start accepts. Automaton has 14 states. Word has length 16
[2018-06-22 01:12:40,010 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:40,011 INFO ]: With dead ends: 27
[2018-06-22 01:12:40,011 INFO ]: Without dead ends: 18
[2018-06-22 01:12:40,011 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462
[2018-06-22 01:12:40,011 INFO ]: Start minimizeSevpa. Operand 18 states.
[2018-06-22 01:12:40,012 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2018-06-22 01:12:40,012 INFO ]: Start removeUnreachable. Operand 18 states.
[2018-06-22 01:12:40,013 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions.
[2018-06-22 01:12:40,013 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16
[2018-06-22 01:12:40,013 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:40,013 INFO ]: Abstraction has 18 states and 20 transitions.
[2018-06-22 01:12:40,013 INFO ]: Interpolant automaton has 14 states.
[2018-06-22 01:12:40,013 INFO ]: Start isEmpty. Operand 18 states and 20 transitions.
[2018-06-22 01:12:40,013 INFO ]: Finished isEmpty. Found accepting run of length 18
[2018-06-22 01:12:40,013 INFO ]: Found error trace
[2018-06-22 01:12:40,013 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:40,013 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:40,014 INFO ]: Analyzing trace with hash 1351731439, now seen corresponding path program 2 times
[2018-06-22 01:12:40,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:40,014 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:40,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:40,017 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:40,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:40,035 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:40,263 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:40,263 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:40,263 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:12:40,269 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:12:40,287 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:12:40,287 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:40,289 INFO ]: Computing forward predicates...
[2018-06-22 01:12:40,401 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:40,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:40,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21
[2018-06-22 01:12:40,420 INFO ]: Interpolant automaton has 21 states
[2018-06-22 01:12:40,420 INFO ]: Constructing interpolant automaton starting with 21 interpolants.
[2018-06-22 01:12:40,420 INFO ]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420
[2018-06-22 01:12:40,420 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 21 states.
[2018-06-22 01:12:40,695 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:40,695 INFO ]: Finished difference Result 33 states and 39 transitions.
[2018-06-22 01:12:40,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2018-06-22 01:12:40,695 INFO ]: Start accepts. Automaton has 21 states. Word has length 17
[2018-06-22 01:12:40,695 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:40,696 INFO ]: With dead ends: 33
[2018-06-22 01:12:40,696 INFO ]: Without dead ends: 32
[2018-06-22 01:12:40,697 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992
[2018-06-22 01:12:40,697 INFO ]: Start minimizeSevpa. Operand 32 states.
[2018-06-22 01:12:40,699 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 21.
[2018-06-22 01:12:40,699 INFO ]: Start removeUnreachable. Operand 21 states.
[2018-06-22 01:12:40,699 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions.
[2018-06-22 01:12:40,699 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17
[2018-06-22 01:12:40,699 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:40,699 INFO ]: Abstraction has 21 states and 24 transitions.
[2018-06-22 01:12:40,699 INFO ]: Interpolant automaton has 21 states.
[2018-06-22 01:12:40,699 INFO ]: Start isEmpty. Operand 21 states and 24 transitions.
[2018-06-22 01:12:40,700 INFO ]: Finished isEmpty. Found accepting run of length 19
[2018-06-22 01:12:40,700 INFO ]: Found error trace
[2018-06-22 01:12:40,700 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:40,700 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:40,700 INFO ]: Analyzing trace with hash -574529838, now seen corresponding path program 3 times
[2018-06-22 01:12:40,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:40,700 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:40,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:40,701 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:40,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:40,712 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:40,821 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:40,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:40,821 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:12:40,826 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-06-22 01:12:40,886 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2018-06-22 01:12:40,886 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:40,888 INFO ]: Computing forward predicates...
[2018-06-22 01:12:40,996 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:41,015 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:41,015 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15
[2018-06-22 01:12:41,016 INFO ]: Interpolant automaton has 15 states
[2018-06-22 01:12:41,016 INFO ]: Constructing interpolant automaton starting with 15 interpolants.
[2018-06-22 01:12:41,016 INFO ]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2018-06-22 01:12:41,016 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 15 states.
[2018-06-22 01:12:41,189 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:41,189 INFO ]: Finished difference Result 35 states and 41 transitions.
[2018-06-22 01:12:41,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2018-06-22 01:12:41,189 INFO ]: Start accepts. Automaton has 15 states. Word has length 18
[2018-06-22 01:12:41,189 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:41,190 INFO ]: With dead ends: 35
[2018-06-22 01:12:41,190 INFO ]: Without dead ends: 34
[2018-06-22 01:12:41,191 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870
[2018-06-22 01:12:41,191 INFO ]: Start minimizeSevpa. Operand 34 states.
[2018-06-22 01:12:41,196 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 20.
[2018-06-22 01:12:41,196 INFO ]: Start removeUnreachable. Operand 20 states.
[2018-06-22 01:12:41,196 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions.
[2018-06-22 01:12:41,196 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18
[2018-06-22 01:12:41,197 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:41,197 INFO ]: Abstraction has 20 states and 22 transitions.
[2018-06-22 01:12:41,197 INFO ]: Interpolant automaton has 15 states.
[2018-06-22 01:12:41,197 INFO ]: Start isEmpty. Operand 20 states and 22 transitions.
[2018-06-22 01:12:41,197 INFO ]: Finished isEmpty. Found accepting run of length 20
[2018-06-22 01:12:41,197 INFO ]: Found error trace
[2018-06-22 01:12:41,197 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:41,197 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:41,197 INFO ]: Analyzing trace with hash -1318641140, now seen corresponding path program 4 times
[2018-06-22 01:12:41,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:41,197 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:41,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:41,198 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:41,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:41,211 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:41,323 INFO ]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:41,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:41,323 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:12:41,329 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 01:12:41,358 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 01:12:41,358 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:41,360 INFO ]: Computing forward predicates...
[2018-06-22 01:12:41,733 INFO ]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:41,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:41,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17
[2018-06-22 01:12:41,754 INFO ]: Interpolant automaton has 17 states
[2018-06-22 01:12:41,754 INFO ]: Constructing interpolant automaton starting with 17 interpolants.
[2018-06-22 01:12:41,754 INFO ]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272
[2018-06-22 01:12:41,754 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states.
[2018-06-22 01:12:41,970 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:41,970 INFO ]: Finished difference Result 32 states and 36 transitions.
[2018-06-22 01:12:41,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2018-06-22 01:12:41,971 INFO ]: Start accepts. Automaton has 17 states. Word has length 19
[2018-06-22 01:12:41,971 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:41,971 INFO ]: With dead ends: 32
[2018-06-22 01:12:41,971 INFO ]: Without dead ends: 21
[2018-06-22 01:12:41,972 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702
[2018-06-22 01:12:41,972 INFO ]: Start minimizeSevpa. Operand 21 states.
[2018-06-22 01:12:41,973 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2018-06-22 01:12:41,973 INFO ]: Start removeUnreachable. Operand 21 states.
[2018-06-22 01:12:41,974 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions.
[2018-06-22 01:12:41,974 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19
[2018-06-22 01:12:41,974 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:41,974 INFO ]: Abstraction has 21 states and 23 transitions.
[2018-06-22 01:12:41,974 INFO ]: Interpolant automaton has 17 states.
[2018-06-22 01:12:41,974 INFO ]: Start isEmpty. Operand 21 states and 23 transitions.
[2018-06-22 01:12:41,974 INFO ]: Finished isEmpty. Found accepting run of length 21
[2018-06-22 01:12:41,974 INFO ]: Found error trace
[2018-06-22 01:12:41,974 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:41,974 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:41,975 INFO ]: Analyzing trace with hash -1324823761, now seen corresponding path program 5 times
[2018-06-22 01:12:41,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:41,978 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:41,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:41,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:41,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:42,010 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:42,220 INFO ]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:42,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:42,220 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:12:42,227 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-06-22 01:12:42,250 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2018-06-22 01:12:42,250 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:42,252 INFO ]: Computing forward predicates...
[2018-06-22 01:12:42,465 INFO ]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:42,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:42,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26
[2018-06-22 01:12:42,485 INFO ]: Interpolant automaton has 26 states
[2018-06-22 01:12:42,485 INFO ]: Constructing interpolant automaton starting with 26 interpolants.
[2018-06-22 01:12:42,485 INFO ]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650
[2018-06-22 01:12:42,485 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 26 states.
[2018-06-22 01:12:42,837 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:42,837 INFO ]: Finished difference Result 38 states and 44 transitions.
[2018-06-22 01:12:42,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2018-06-22 01:12:42,838 INFO ]: Start accepts. Automaton has 26 states. Word has length 20
[2018-06-22 01:12:42,838 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:42,839 INFO ]: With dead ends: 38
[2018-06-22 01:12:42,839 INFO ]: Without dead ends: 37
[2018-06-22 01:12:42,839 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560
[2018-06-22 01:12:42,839 INFO ]: Start minimizeSevpa. Operand 37 states.
[2018-06-22 01:12:42,842 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 24.
[2018-06-22 01:12:42,842 INFO ]: Start removeUnreachable. Operand 24 states.
[2018-06-22 01:12:42,842 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions.
[2018-06-22 01:12:42,842 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 20
[2018-06-22 01:12:42,842 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:42,842 INFO ]: Abstraction has 24 states and 27 transitions.
[2018-06-22 01:12:42,842 INFO ]: Interpolant automaton has 26 states.
[2018-06-22 01:12:42,842 INFO ]: Start isEmpty. Operand 24 states and 27 transitions.
[2018-06-22 01:12:42,843 INFO ]: Finished isEmpty. Found accepting run of length 22
[2018-06-22 01:12:42,843 INFO ]: Found error trace
[2018-06-22 01:12:42,843 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:42,843 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:42,843 INFO ]: Analyzing trace with hash -1516485012, now seen corresponding path program 6 times
[2018-06-22 01:12:42,843 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:42,843 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:42,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:42,844 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:42,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:42,855 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:43,027 INFO ]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:43,027 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:43,027 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:12:43,044 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-06-22 01:12:43,076 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2018-06-22 01:12:43,076 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:43,078 INFO ]: Computing forward predicates...
[2018-06-22 01:12:43,153 INFO ]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:43,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:43,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18
[2018-06-22 01:12:43,187 INFO ]: Interpolant automaton has 18 states
[2018-06-22 01:12:43,187 INFO ]: Constructing interpolant automaton starting with 18 interpolants.
[2018-06-22 01:12:43,187 INFO ]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306
[2018-06-22 01:12:43,188 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 18 states.
[2018-06-22 01:12:43,962 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:43,962 INFO ]: Finished difference Result 40 states and 46 transitions.
[2018-06-22 01:12:43,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2018-06-22 01:12:43,963 INFO ]: Start accepts. Automaton has 18 states. Word has length 21
[2018-06-22 01:12:43,963 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:43,963 INFO ]: With dead ends: 40
[2018-06-22 01:12:43,963 INFO ]: Without dead ends: 39
[2018-06-22 01:12:43,964 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332
[2018-06-22 01:12:43,964 INFO ]: Start minimizeSevpa. Operand 39 states.
[2018-06-22 01:12:43,966 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 23.
[2018-06-22 01:12:43,966 INFO ]: Start removeUnreachable. Operand 23 states.
[2018-06-22 01:12:43,970 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions.
[2018-06-22 01:12:43,970 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21
[2018-06-22 01:12:43,971 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:43,971 INFO ]: Abstraction has 23 states and 25 transitions.
[2018-06-22 01:12:43,971 INFO ]: Interpolant automaton has 18 states.
[2018-06-22 01:12:43,971 INFO ]: Start isEmpty. Operand 23 states and 25 transitions.
[2018-06-22 01:12:43,971 INFO ]: Finished isEmpty. Found accepting run of length 23
[2018-06-22 01:12:43,971 INFO ]: Found error trace
[2018-06-22 01:12:43,971 INFO ]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:43,971 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:43,971 INFO ]: Analyzing trace with hash -802778036, now seen corresponding path program 7 times
[2018-06-22 01:12:43,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:43,971 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:43,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:43,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:43,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:43,993 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:44,366 INFO ]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:44,367 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:44,367 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)
[2018-06-22 01:12:44,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:12:44,406 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:44,409 INFO ]: Computing forward predicates...
[2018-06-22 01:12:44,554 INFO ]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:44,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:44,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20
[2018-06-22 01:12:44,575 INFO ]: Interpolant automaton has 20 states
[2018-06-22 01:12:44,575 INFO ]: Constructing interpolant automaton starting with 20 interpolants.
[2018-06-22 01:12:44,575 INFO ]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380
[2018-06-22 01:12:44,575 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 20 states.
[2018-06-22 01:12:44,811 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:44,811 INFO ]: Finished difference Result 37 states and 41 transitions.
[2018-06-22 01:12:44,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2018-06-22 01:12:44,811 INFO ]: Start accepts. Automaton has 20 states. Word has length 22
[2018-06-22 01:12:44,811 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:44,811 INFO ]: With dead ends: 37
[2018-06-22 01:12:44,811 INFO ]: Without dead ends: 24
[2018-06-22 01:12:44,812 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992
[2018-06-22 01:12:44,812 INFO ]: Start minimizeSevpa. Operand 24 states.
[2018-06-22 01:12:44,813 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2018-06-22 01:12:44,813 INFO ]: Start removeUnreachable. Operand 24 states.
[2018-06-22 01:12:44,814 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions.
[2018-06-22 01:12:44,814 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22
[2018-06-22 01:12:44,814 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:44,814 INFO ]: Abstraction has 24 states and 26 transitions.
[2018-06-22 01:12:44,814 INFO ]: Interpolant automaton has 20 states.
[2018-06-22 01:12:44,814 INFO ]: Start isEmpty. Operand 24 states and 26 transitions.
[2018-06-22 01:12:44,814 INFO ]: Finished isEmpty. Found accepting run of length 24
[2018-06-22 01:12:44,814 INFO ]: Found error trace
[2018-06-22 01:12:44,814 INFO ]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:44,814 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:44,814 INFO ]: Analyzing trace with hash -305646519, now seen corresponding path program 8 times
[2018-06-22 01:12:44,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:44,814 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:44,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:44,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:44,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:44,828 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:45,913 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:45,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:45,913 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:12:45,919 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:12:45,943 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:12:45,943 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:45,946 INFO ]: Computing forward predicates...
[2018-06-22 01:12:46,159 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:46,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:46,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31
[2018-06-22 01:12:46,178 INFO ]: Interpolant automaton has 31 states
[2018-06-22 01:12:46,178 INFO ]: Constructing interpolant automaton starting with 31 interpolants.
[2018-06-22 01:12:46,178 INFO ]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930
[2018-06-22 01:12:46,178 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 31 states.
[2018-06-22 01:12:46,697 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:46,697 INFO ]: Finished difference Result 43 states and 49 transitions.
[2018-06-22 01:12:46,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2018-06-22 01:12:46,698 INFO ]: Start accepts. Automaton has 31 states. Word has length 23
[2018-06-22 01:12:46,698 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:46,698 INFO ]: With dead ends: 43
[2018-06-22 01:12:46,698 INFO ]: Without dead ends: 42
[2018-06-22 01:12:46,699 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=2050, Unknown=0, NotChecked=0, Total=2256
[2018-06-22 01:12:46,699 INFO ]: Start minimizeSevpa. Operand 42 states.
[2018-06-22 01:12:46,701 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 27.
[2018-06-22 01:12:46,701 INFO ]: Start removeUnreachable. Operand 27 states.
[2018-06-22 01:12:46,702 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions.
[2018-06-22 01:12:46,702 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23
[2018-06-22 01:12:46,702 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:46,702 INFO ]: Abstraction has 27 states and 30 transitions.
[2018-06-22 01:12:46,702 INFO ]: Interpolant automaton has 31 states.
[2018-06-22 01:12:46,703 INFO ]: Start isEmpty. Operand 27 states and 30 transitions.
[2018-06-22 01:12:46,703 INFO ]: Finished isEmpty. Found accepting run of length 25
[2018-06-22 01:12:46,703 INFO ]: Found error trace
[2018-06-22 01:12:46,703 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:46,703 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:46,703 INFO ]: Analyzing trace with hash -2074438676, now seen corresponding path program 9 times
[2018-06-22 01:12:46,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:46,703 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:46,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:46,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:46,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:46,716 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:47,144 INFO ]: Checked inductivity of 35 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:47,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:47,144 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:12:47,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-06-22 01:12:47,179 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2018-06-22 01:12:47,179 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:47,181 INFO ]: Computing forward predicates...
[2018-06-22 01:12:47,232 INFO ]: Checked inductivity of 35 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:47,251 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:47,251 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 21
[2018-06-22 01:12:47,252 INFO ]: Interpolant automaton has 21 states
[2018-06-22 01:12:47,252 INFO ]: Constructing interpolant automaton starting with 21 interpolants.
[2018-06-22 01:12:47,252 INFO ]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420
[2018-06-22 01:12:47,252 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 21 states.
[2018-06-22 01:12:47,823 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:47,823 INFO ]: Finished difference Result 45 states and 51 transitions.
[2018-06-22 01:12:47,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2018-06-22 01:12:47,823 INFO ]: Start accepts. Automaton has 21 states. Word has length 24
[2018-06-22 01:12:47,823 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:47,823 INFO ]: With dead ends: 45
[2018-06-22 01:12:47,823 INFO ]: Without dead ends: 44
[2018-06-22 01:12:47,824 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=545, Invalid=1347, Unknown=0, NotChecked=0, Total=1892
[2018-06-22 01:12:47,824 INFO ]: Start minimizeSevpa. Operand 44 states.
[2018-06-22 01:12:47,826 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 26.
[2018-06-22 01:12:47,826 INFO ]: Start removeUnreachable. Operand 26 states.
[2018-06-22 01:12:47,826 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions.
[2018-06-22 01:12:47,826 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24
[2018-06-22 01:12:47,826 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:47,826 INFO ]: Abstraction has 26 states and 28 transitions.
[2018-06-22 01:12:47,826 INFO ]: Interpolant automaton has 21 states.
[2018-06-22 01:12:47,826 INFO ]: Start isEmpty. Operand 26 states and 28 transitions.
[2018-06-22 01:12:47,827 INFO ]: Finished isEmpty. Found accepting run of length 26
[2018-06-22 01:12:47,827 INFO ]: Found error trace
[2018-06-22 01:12:47,827 INFO ]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:47,827 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:47,827 INFO ]: Analyzing trace with hash -625991962, now seen corresponding path program 10 times
[2018-06-22 01:12:47,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:47,827 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:47,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:47,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:47,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:47,838 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:48,533 INFO ]: Checked inductivity of 42 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:48,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:48,533 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:12:48,538 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 01:12:48,564 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 01:12:48,564 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:48,567 INFO ]: Computing forward predicates...
[2018-06-22 01:12:48,627 INFO ]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:48,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:48,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 23
[2018-06-22 01:12:48,647 INFO ]: Interpolant automaton has 23 states
[2018-06-22 01:12:48,647 INFO ]: Constructing interpolant automaton starting with 23 interpolants.
[2018-06-22 01:12:48,647 INFO ]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506
[2018-06-22 01:12:48,647 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 23 states.
[2018-06-22 01:12:48,884 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:48,884 INFO ]: Finished difference Result 42 states and 46 transitions.
[2018-06-22 01:12:48,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2018-06-22 01:12:48,885 INFO ]: Start accepts. Automaton has 23 states. Word has length 25
[2018-06-22 01:12:48,885 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:48,885 INFO ]: With dead ends: 42
[2018-06-22 01:12:48,885 INFO ]: Without dead ends: 27
[2018-06-22 01:12:48,886 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332
[2018-06-22 01:12:48,886 INFO ]: Start minimizeSevpa. Operand 27 states.
[2018-06-22 01:12:48,887 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2018-06-22 01:12:48,887 INFO ]: Start removeUnreachable. Operand 27 states.
[2018-06-22 01:12:48,888 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions.
[2018-06-22 01:12:48,888 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25
[2018-06-22 01:12:48,888 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:48,888 INFO ]: Abstraction has 27 states and 29 transitions.
[2018-06-22 01:12:48,888 INFO ]: Interpolant automaton has 23 states.
[2018-06-22 01:12:48,888 INFO ]: Start isEmpty. Operand 27 states and 29 transitions.
[2018-06-22 01:12:48,888 INFO ]: Finished isEmpty. Found accepting run of length 27
[2018-06-22 01:12:48,888 INFO ]: Found error trace
[2018-06-22 01:12:48,888 INFO ]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:48,888 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:48,889 INFO ]: Analyzing trace with hash 371794377, now seen corresponding path program 11 times
[2018-06-22 01:12:48,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:48,889 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:48,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:48,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:48,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:48,905 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:49,169 INFO ]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:49,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:49,169 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:12:49,175 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-06-22 01:12:49,206 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2018-06-22 01:12:49,206 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:49,209 INFO ]: Computing forward predicates...
[2018-06-22 01:12:49,518 INFO ]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:49,538 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:49,538 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36
[2018-06-22 01:12:49,538 INFO ]: Interpolant automaton has 36 states
[2018-06-22 01:12:49,538 INFO ]: Constructing interpolant automaton starting with 36 interpolants.
[2018-06-22 01:12:49,539 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260
[2018-06-22 01:12:49,539 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 36 states.
[2018-06-22 01:12:50,332 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:50,332 INFO ]: Finished difference Result 48 states and 54 transitions.
[2018-06-22 01:12:50,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-06-22 01:12:50,332 INFO ]: Start accepts. Automaton has 36 states. Word has length 26
[2018-06-22 01:12:50,332 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:50,332 INFO ]: With dead ends: 48
[2018-06-22 01:12:50,332 INFO ]: Without dead ends: 47
[2018-06-22 01:12:50,333 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=2840, Unknown=0, NotChecked=0, Total=3080
[2018-06-22 01:12:50,333 INFO ]: Start minimizeSevpa. Operand 47 states.
[2018-06-22 01:12:50,335 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 30.
[2018-06-22 01:12:50,335 INFO ]: Start removeUnreachable. Operand 30 states.
[2018-06-22 01:12:50,335 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions.
[2018-06-22 01:12:50,335 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26
[2018-06-22 01:12:50,336 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:50,336 INFO ]: Abstraction has 30 states and 33 transitions.
[2018-06-22 01:12:50,336 INFO ]: Interpolant automaton has 36 states.
[2018-06-22 01:12:50,336 INFO ]: Start isEmpty. Operand 30 states and 33 transitions.
[2018-06-22 01:12:50,336 INFO ]: Finished isEmpty. Found accepting run of length 28
[2018-06-22 01:12:50,336 INFO ]: Found error trace
[2018-06-22 01:12:50,336 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:50,336 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:50,336 INFO ]: Analyzing trace with hash 1238399814, now seen corresponding path program 12 times
[2018-06-22 01:12:50,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:50,336 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:50,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:50,337 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:50,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:50,349 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:50,525 INFO ]: Checked inductivity of 51 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:50,525 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:50,525 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:12:50,538 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-06-22 01:12:50,571 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2018-06-22 01:12:50,571 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:50,573 INFO ]: Computing forward predicates...
[2018-06-22 01:12:50,625 INFO ]: Checked inductivity of 51 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:50,648 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:50,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24
[2018-06-22 01:12:50,649 INFO ]: Interpolant automaton has 24 states
[2018-06-22 01:12:50,649 INFO ]: Constructing interpolant automaton starting with 24 interpolants.
[2018-06-22 01:12:50,649 INFO ]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552
[2018-06-22 01:12:50,649 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 24 states.
[2018-06-22 01:12:51,229 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19
[2018-06-22 01:12:51,440 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:51,440 INFO ]: Finished difference Result 50 states and 56 transitions.
[2018-06-22 01:12:51,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2018-06-22 01:12:51,442 INFO ]: Start accepts. Automaton has 24 states. Word has length 27
[2018-06-22 01:12:51,442 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:51,443 INFO ]: With dead ends: 50
[2018-06-22 01:12:51,443 INFO ]: Without dead ends: 49
[2018-06-22 01:12:51,443 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=740, Invalid=1810, Unknown=0, NotChecked=0, Total=2550
[2018-06-22 01:12:51,443 INFO ]: Start minimizeSevpa. Operand 49 states.
[2018-06-22 01:12:51,445 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 29.
[2018-06-22 01:12:51,445 INFO ]: Start removeUnreachable. Operand 29 states.
[2018-06-22 01:12:51,445 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions.
[2018-06-22 01:12:51,445 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27
[2018-06-22 01:12:51,446 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:51,446 INFO ]: Abstraction has 29 states and 31 transitions.
[2018-06-22 01:12:51,446 INFO ]: Interpolant automaton has 24 states.
[2018-06-22 01:12:51,446 INFO ]: Start isEmpty. Operand 29 states and 31 transitions.
[2018-06-22 01:12:51,446 INFO ]: Finished isEmpty. Found accepting run of length 29
[2018-06-22 01:12:51,446 INFO ]: Found error trace
[2018-06-22 01:12:51,446 INFO ]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:51,446 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:51,446 INFO ]: Analyzing trace with hash 1854647398, now seen corresponding path program 13 times
[2018-06-22 01:12:51,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:51,446 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:51,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:51,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:51,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:51,458 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:51,768 INFO ]: Checked inductivity of 59 backedges. 25 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:51,768 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:51,768 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:12:51,775 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:51,803 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:51,806 INFO ]: Computing forward predicates...
[2018-06-22 01:12:51,893 INFO ]: Checked inductivity of 59 backedges. 36 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:51,912 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:51,912 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 26
[2018-06-22 01:12:51,912 INFO ]: Interpolant automaton has 26 states
[2018-06-22 01:12:51,912 INFO ]: Constructing interpolant automaton starting with 26 interpolants.
[2018-06-22 01:12:51,912 INFO ]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650
[2018-06-22 01:12:51,912 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 26 states.
[2018-06-22 01:12:52,507 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:52,507 INFO ]: Finished difference Result 47 states and 51 transitions.
[2018-06-22 01:12:52,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2018-06-22 01:12:52,508 INFO ]: Start accepts. Automaton has 26 states. Word has length 28
[2018-06-22 01:12:52,508 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:52,508 INFO ]: With dead ends: 47
[2018-06-22 01:12:52,508 INFO ]: Without dead ends: 30
[2018-06-22 01:12:52,509 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=386, Invalid=1336, Unknown=0, NotChecked=0, Total=1722
[2018-06-22 01:12:52,509 INFO ]: Start minimizeSevpa. Operand 30 states.
[2018-06-22 01:12:52,510 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2018-06-22 01:12:52,510 INFO ]: Start removeUnreachable. Operand 30 states.
[2018-06-22 01:12:52,511 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions.
[2018-06-22 01:12:52,511 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28
[2018-06-22 01:12:52,511 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:52,511 INFO ]: Abstraction has 30 states and 32 transitions.
[2018-06-22 01:12:52,511 INFO ]: Interpolant automaton has 26 states.
[2018-06-22 01:12:52,511 INFO ]: Start isEmpty. Operand 30 states and 32 transitions.
[2018-06-22 01:12:52,511 INFO ]: Finished isEmpty. Found accepting run of length 30
[2018-06-22 01:12:52,512 INFO ]: Found error trace
[2018-06-22 01:12:52,512 INFO ]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:52,512 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:52,512 INFO ]: Analyzing trace with hash 1438816931, now seen corresponding path program 14 times
[2018-06-22 01:12:52,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:52,512 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:52,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:52,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:12:52,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:52,527 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:53,412 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:53,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:53,412 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:12:53,418 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:12:53,461 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:12:53,461 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:53,465 INFO ]: Computing forward predicates...
[2018-06-22 01:12:54,302 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:54,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:54,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 41
[2018-06-22 01:12:54,322 INFO ]: Interpolant automaton has 41 states
[2018-06-22 01:12:54,322 INFO ]: Constructing interpolant automaton starting with 41 interpolants.
[2018-06-22 01:12:54,323 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1545, Unknown=0, NotChecked=0, Total=1640
[2018-06-22 01:12:54,323 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 41 states.
[2018-06-22 01:12:55,055 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:55,055 INFO ]: Finished difference Result 53 states and 59 transitions.
[2018-06-22 01:12:55,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2018-06-22 01:12:55,055 INFO ]: Start accepts. Automaton has 41 states. Word has length 29
[2018-06-22 01:12:55,056 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:55,056 INFO ]: With dead ends: 53
[2018-06-22 01:12:55,056 INFO ]: Without dead ends: 52
[2018-06-22 01:12:55,057 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=274, Invalid=3758, Unknown=0, NotChecked=0, Total=4032
[2018-06-22 01:12:55,057 INFO ]: Start minimizeSevpa. Operand 52 states.
[2018-06-22 01:12:55,059 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 33.
[2018-06-22 01:12:55,059 INFO ]: Start removeUnreachable. Operand 33 states.
[2018-06-22 01:12:55,059 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions.
[2018-06-22 01:12:55,059 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29
[2018-06-22 01:12:55,059 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:55,059 INFO ]: Abstraction has 33 states and 36 transitions.
[2018-06-22 01:12:55,059 INFO ]: Interpolant automaton has 41 states.
[2018-06-22 01:12:55,059 INFO ]: Start isEmpty. Operand 33 states and 36 transitions.
[2018-06-22 01:12:55,060 INFO ]: Finished isEmpty. Found accepting run of length 31
[2018-06-22 01:12:55,060 INFO ]: Found error trace
[2018-06-22 01:12:55,060 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:55,060 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:55,060 INFO ]: Analyzing trace with hash 1432974342, now seen corresponding path program 15 times
[2018-06-22 01:12:55,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:55,060 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:55,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:55,061 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:55,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:55,073 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:55,348 INFO ]: Checked inductivity of 70 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:55,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:55,348 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:12:55,353 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-06-22 01:12:55,391 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2018-06-22 01:12:55,391 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:55,394 INFO ]: Computing forward predicates...
[2018-06-22 01:12:55,734 INFO ]: Checked inductivity of 70 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:55,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:55,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 27
[2018-06-22 01:12:55,763 INFO ]: Interpolant automaton has 27 states
[2018-06-22 01:12:55,763 INFO ]: Constructing interpolant automaton starting with 27 interpolants.
[2018-06-22 01:12:55,763 INFO ]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702
[2018-06-22 01:12:55,763 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 27 states.
[2018-06-22 01:12:56,367 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:56,367 INFO ]: Finished difference Result 55 states and 61 transitions.
[2018-06-22 01:12:56,368 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2018-06-22 01:12:56,368 INFO ]: Start accepts. Automaton has 27 states. Word has length 30
[2018-06-22 01:12:56,368 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:56,368 INFO ]: With dead ends: 55
[2018-06-22 01:12:56,368 INFO ]: Without dead ends: 54
[2018-06-22 01:12:56,369 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=966, Invalid=2340, Unknown=0, NotChecked=0, Total=3306
[2018-06-22 01:12:56,369 INFO ]: Start minimizeSevpa. Operand 54 states.
[2018-06-22 01:12:56,371 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 32.
[2018-06-22 01:12:56,371 INFO ]: Start removeUnreachable. Operand 32 states.
[2018-06-22 01:12:56,371 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions.
[2018-06-22 01:12:56,371 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30
[2018-06-22 01:12:56,371 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:56,371 INFO ]: Abstraction has 32 states and 34 transitions.
[2018-06-22 01:12:56,371 INFO ]: Interpolant automaton has 27 states.
[2018-06-22 01:12:56,371 INFO ]: Start isEmpty. Operand 32 states and 34 transitions.
[2018-06-22 01:12:56,372 INFO ]: Finished isEmpty. Found accepting run of length 32
[2018-06-22 01:12:56,372 INFO ]: Found error trace
[2018-06-22 01:12:56,372 INFO ]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:56,372 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:56,372 INFO ]: Analyzing trace with hash 766138048, now seen corresponding path program 16 times
[2018-06-22 01:12:56,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:56,372 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:56,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:56,373 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:56,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:56,384 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:57,773 INFO ]: Checked inductivity of 79 backedges. 36 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:57,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:57,774 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:12:57,787 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 01:12:57,837 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 01:12:57,837 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:57,842 INFO ]: Computing forward predicates...
[2018-06-22 01:12:57,932 INFO ]: Checked inductivity of 79 backedges. 49 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:57,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:57,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 29
[2018-06-22 01:12:57,951 INFO ]: Interpolant automaton has 29 states
[2018-06-22 01:12:57,951 INFO ]: Constructing interpolant automaton starting with 29 interpolants.
[2018-06-22 01:12:57,952 INFO ]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812
[2018-06-22 01:12:57,952 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 29 states.
[2018-06-22 01:12:58,343 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:12:58,343 INFO ]: Finished difference Result 52 states and 56 transitions.
[2018-06-22 01:12:58,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2018-06-22 01:12:58,344 INFO ]: Start accepts. Automaton has 29 states. Word has length 31
[2018-06-22 01:12:58,344 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:12:58,344 INFO ]: With dead ends: 52
[2018-06-22 01:12:58,344 INFO ]: Without dead ends: 33
[2018-06-22 01:12:58,345 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162
[2018-06-22 01:12:58,345 INFO ]: Start minimizeSevpa. Operand 33 states.
[2018-06-22 01:12:58,346 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2018-06-22 01:12:58,346 INFO ]: Start removeUnreachable. Operand 33 states.
[2018-06-22 01:12:58,346 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions.
[2018-06-22 01:12:58,346 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31
[2018-06-22 01:12:58,347 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:12:58,347 INFO ]: Abstraction has 33 states and 35 transitions.
[2018-06-22 01:12:58,347 INFO ]: Interpolant automaton has 29 states.
[2018-06-22 01:12:58,347 INFO ]: Start isEmpty. Operand 33 states and 35 transitions.
[2018-06-22 01:12:58,347 INFO ]: Finished isEmpty. Found accepting run of length 33
[2018-06-22 01:12:58,347 INFO ]: Found error trace
[2018-06-22 01:12:58,347 INFO ]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:12:58,347 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:12:58,347 INFO ]: Analyzing trace with hash -553622685, now seen corresponding path program 17 times
[2018-06-22 01:12:58,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:12:58,348 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:12:58,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:58,348 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:12:58,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:12:58,371 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:58,857 INFO ]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:58,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:12:58,857 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:12:58,862 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-06-22 01:12:58,903 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s)
[2018-06-22 01:12:58,903 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:12:58,906 INFO ]: Computing forward predicates...
[2018-06-22 01:12:59,364 INFO ]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:12:59,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:12:59,383 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46
[2018-06-22 01:12:59,383 INFO ]: Interpolant automaton has 46 states
[2018-06-22 01:12:59,383 INFO ]: Constructing interpolant automaton starting with 46 interpolants.
[2018-06-22 01:12:59,384 INFO ]: CoverageRelationStatistics Valid=107, Invalid=1963, Unknown=0, NotChecked=0, Total=2070
[2018-06-22 01:12:59,384 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 46 states.
[2018-06-22 01:13:00,342 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:00,342 INFO ]: Finished difference Result 58 states and 64 transitions.
[2018-06-22 01:13:00,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2018-06-22 01:13:00,342 INFO ]: Start accepts. Automaton has 46 states. Word has length 32
[2018-06-22 01:13:00,342 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:00,342 INFO ]: With dead ends: 58
[2018-06-22 01:13:00,342 INFO ]: Without dead ends: 57
[2018-06-22 01:13:00,343 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=308, Invalid=4804, Unknown=0, NotChecked=0, Total=5112
[2018-06-22 01:13:00,343 INFO ]: Start minimizeSevpa. Operand 57 states.
[2018-06-22 01:13:00,344 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 36.
[2018-06-22 01:13:00,344 INFO ]: Start removeUnreachable. Operand 36 states.
[2018-06-22 01:13:00,345 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions.
[2018-06-22 01:13:00,345 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 32
[2018-06-22 01:13:00,345 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:00,345 INFO ]: Abstraction has 36 states and 39 transitions.
[2018-06-22 01:13:00,345 INFO ]: Interpolant automaton has 46 states.
[2018-06-22 01:13:00,345 INFO ]: Start isEmpty. Operand 36 states and 39 transitions.
[2018-06-22 01:13:00,346 INFO ]: Finished isEmpty. Found accepting run of length 34
[2018-06-22 01:13:00,346 INFO ]: Found error trace
[2018-06-22 01:13:00,346 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:00,346 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:00,346 INFO ]: Analyzing trace with hash 1483467552, now seen corresponding path program 18 times
[2018-06-22 01:13:00,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:00,346 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:00,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:00,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:00,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:00,358 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:00,872 INFO ]: Checked inductivity of 92 backedges. 28 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:00,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:00,872 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:13:00,880 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-06-22 01:13:00,929 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s)
[2018-06-22 01:13:00,929 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:00,932 INFO ]: Computing forward predicates...
[2018-06-22 01:13:01,495 INFO ]: Checked inductivity of 92 backedges. 28 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:01,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:01,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 30
[2018-06-22 01:13:01,515 INFO ]: Interpolant automaton has 30 states
[2018-06-22 01:13:01,515 INFO ]: Constructing interpolant automaton starting with 30 interpolants.
[2018-06-22 01:13:01,515 INFO ]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870
[2018-06-22 01:13:01,515 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 30 states.
[2018-06-22 01:13:02,131 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:02,131 INFO ]: Finished difference Result 60 states and 66 transitions.
[2018-06-22 01:13:02,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2018-06-22 01:13:02,131 INFO ]: Start accepts. Automaton has 30 states. Word has length 33
[2018-06-22 01:13:02,131 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:02,131 INFO ]: With dead ends: 60
[2018-06-22 01:13:02,131 INFO ]: Without dead ends: 59
[2018-06-22 01:13:02,133 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1223, Invalid=2937, Unknown=0, NotChecked=0, Total=4160
[2018-06-22 01:13:02,133 INFO ]: Start minimizeSevpa. Operand 59 states.
[2018-06-22 01:13:02,134 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 35.
[2018-06-22 01:13:02,134 INFO ]: Start removeUnreachable. Operand 35 states.
[2018-06-22 01:13:02,140 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions.
[2018-06-22 01:13:02,140 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33
[2018-06-22 01:13:02,140 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:02,140 INFO ]: Abstraction has 35 states and 37 transitions.
[2018-06-22 01:13:02,140 INFO ]: Interpolant automaton has 30 states.
[2018-06-22 01:13:02,140 INFO ]: Start isEmpty. Operand 35 states and 37 transitions.
[2018-06-22 01:13:02,141 INFO ]: Finished isEmpty. Found accepting run of length 35
[2018-06-22 01:13:02,141 INFO ]: Found error trace
[2018-06-22 01:13:02,141 INFO ]: trace histogram [9, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:02,141 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:02,141 INFO ]: Analyzing trace with hash 1587081088, now seen corresponding path program 19 times
[2018-06-22 01:13:02,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:02,141 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:02,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:02,142 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:02,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:02,154 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:02,846 INFO ]: Checked inductivity of 102 backedges. 49 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:02,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:02,846 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:13:02,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:13:02,891 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:02,893 INFO ]: Computing forward predicates...
[2018-06-22 01:13:02,998 INFO ]: Checked inductivity of 102 backedges. 64 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:03,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:03,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 32
[2018-06-22 01:13:03,019 INFO ]: Interpolant automaton has 32 states
[2018-06-22 01:13:03,019 INFO ]: Constructing interpolant automaton starting with 32 interpolants.
[2018-06-22 01:13:03,019 INFO ]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992
[2018-06-22 01:13:03,019 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 32 states.
[2018-06-22 01:13:03,546 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:03,546 INFO ]: Finished difference Result 57 states and 61 transitions.
[2018-06-22 01:13:03,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2018-06-22 01:13:03,546 INFO ]: Start accepts. Automaton has 32 states. Word has length 34
[2018-06-22 01:13:03,546 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:03,546 INFO ]: With dead ends: 57
[2018-06-22 01:13:03,546 INFO ]: Without dead ends: 36
[2018-06-22 01:13:03,547 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652
[2018-06-22 01:13:03,547 INFO ]: Start minimizeSevpa. Operand 36 states.
[2018-06-22 01:13:03,548 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2018-06-22 01:13:03,548 INFO ]: Start removeUnreachable. Operand 36 states.
[2018-06-22 01:13:03,549 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions.
[2018-06-22 01:13:03,549 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34
[2018-06-22 01:13:03,549 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:03,549 INFO ]: Abstraction has 36 states and 38 transitions.
[2018-06-22 01:13:03,549 INFO ]: Interpolant automaton has 32 states.
[2018-06-22 01:13:03,549 INFO ]: Start isEmpty. Operand 36 states and 38 transitions.
[2018-06-22 01:13:03,549 INFO ]: Finished isEmpty. Found accepting run of length 36
[2018-06-22 01:13:03,549 INFO ]: Found error trace
[2018-06-22 01:13:03,549 INFO ]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:03,549 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:03,550 INFO ]: Analyzing trace with hash 725711869, now seen corresponding path program 20 times
[2018-06-22 01:13:03,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:03,550 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:03,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:03,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:13:03,552 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:03,566 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:04,050 INFO ]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:04,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:04,050 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:13:04,057 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:13:04,097 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:13:04,097 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:04,106 INFO ]: Computing forward predicates...
[2018-06-22 01:13:05,014 INFO ]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:05,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:05,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 51
[2018-06-22 01:13:05,034 INFO ]: Interpolant automaton has 51 states
[2018-06-22 01:13:05,034 INFO ]: Constructing interpolant automaton starting with 51 interpolants.
[2018-06-22 01:13:05,035 INFO ]: CoverageRelationStatistics Valid=119, Invalid=2431, Unknown=0, NotChecked=0, Total=2550
[2018-06-22 01:13:05,035 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 51 states.
[2018-06-22 01:13:06,120 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:06,121 INFO ]: Finished difference Result 63 states and 69 transitions.
[2018-06-22 01:13:06,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2018-06-22 01:13:06,121 INFO ]: Start accepts. Automaton has 51 states. Word has length 35
[2018-06-22 01:13:06,121 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:06,121 INFO ]: With dead ends: 63
[2018-06-22 01:13:06,121 INFO ]: Without dead ends: 62
[2018-06-22 01:13:06,122 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=342, Invalid=5978, Unknown=0, NotChecked=0, Total=6320
[2018-06-22 01:13:06,122 INFO ]: Start minimizeSevpa. Operand 62 states.
[2018-06-22 01:13:06,123 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 39.
[2018-06-22 01:13:06,123 INFO ]: Start removeUnreachable. Operand 39 states.
[2018-06-22 01:13:06,124 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions.
[2018-06-22 01:13:06,124 INFO ]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35
[2018-06-22 01:13:06,124 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:06,124 INFO ]: Abstraction has 39 states and 42 transitions.
[2018-06-22 01:13:06,124 INFO ]: Interpolant automaton has 51 states.
[2018-06-22 01:13:06,124 INFO ]: Start isEmpty. Operand 39 states and 42 transitions.
[2018-06-22 01:13:06,124 INFO ]: Finished isEmpty. Found accepting run of length 37
[2018-06-22 01:13:06,124 INFO ]: Found error trace
[2018-06-22 01:13:06,124 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:06,124 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:06,125 INFO ]: Analyzing trace with hash -206930144, now seen corresponding path program 21 times
[2018-06-22 01:13:06,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:06,125 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:06,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:06,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:06,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:06,140 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:06,610 INFO ]: Checked inductivity of 117 backedges. 36 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:06,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:06,646 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:13:06,652 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-06-22 01:13:06,702 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s)
[2018-06-22 01:13:06,702 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:06,705 INFO ]: Computing forward predicates...
[2018-06-22 01:13:06,763 INFO ]: Checked inductivity of 117 backedges. 36 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:06,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:06,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 33
[2018-06-22 01:13:06,783 INFO ]: Interpolant automaton has 33 states
[2018-06-22 01:13:06,783 INFO ]: Constructing interpolant automaton starting with 33 interpolants.
[2018-06-22 01:13:06,783 INFO ]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056
[2018-06-22 01:13:06,783 INFO ]: Start difference. First operand 39 states and 42 transitions. Second operand 33 states.
[2018-06-22 01:13:07,633 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:07,633 INFO ]: Finished difference Result 65 states and 71 transitions.
[2018-06-22 01:13:07,633 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2018-06-22 01:13:07,633 INFO ]: Start accepts. Automaton has 33 states. Word has length 36
[2018-06-22 01:13:07,634 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:07,634 INFO ]: With dead ends: 65
[2018-06-22 01:13:07,634 INFO ]: Without dead ends: 64
[2018-06-22 01:13:07,635 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1511, Invalid=3601, Unknown=0, NotChecked=0, Total=5112
[2018-06-22 01:13:07,635 INFO ]: Start minimizeSevpa. Operand 64 states.
[2018-06-22 01:13:07,636 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 38.
[2018-06-22 01:13:07,636 INFO ]: Start removeUnreachable. Operand 38 states.
[2018-06-22 01:13:07,636 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions.
[2018-06-22 01:13:07,636 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36
[2018-06-22 01:13:07,636 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:07,636 INFO ]: Abstraction has 38 states and 40 transitions.
[2018-06-22 01:13:07,636 INFO ]: Interpolant automaton has 33 states.
[2018-06-22 01:13:07,636 INFO ]: Start isEmpty. Operand 38 states and 40 transitions.
[2018-06-22 01:13:07,637 INFO ]: Finished isEmpty. Found accepting run of length 38
[2018-06-22 01:13:07,637 INFO ]: Found error trace
[2018-06-22 01:13:07,637 INFO ]: trace histogram [10, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:07,637 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:07,637 INFO ]: Analyzing trace with hash -1628026470, now seen corresponding path program 22 times
[2018-06-22 01:13:07,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:07,637 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:07,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:07,638 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:07,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:07,649 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:08,106 INFO ]: Checked inductivity of 128 backedges. 64 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:08,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:08,106 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:13:08,112 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 01:13:08,155 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 01:13:08,155 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:08,158 INFO ]: Computing forward predicates...
[2018-06-22 01:13:08,225 INFO ]: Checked inductivity of 128 backedges. 81 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:08,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:08,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 35
[2018-06-22 01:13:08,245 INFO ]: Interpolant automaton has 35 states
[2018-06-22 01:13:08,245 INFO ]: Constructing interpolant automaton starting with 35 interpolants.
[2018-06-22 01:13:08,245 INFO ]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190
[2018-06-22 01:13:08,245 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 35 states.
[2018-06-22 01:13:08,767 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:08,767 INFO ]: Finished difference Result 62 states and 66 transitions.
[2018-06-22 01:13:08,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2018-06-22 01:13:08,770 INFO ]: Start accepts. Automaton has 35 states. Word has length 37
[2018-06-22 01:13:08,770 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:08,770 INFO ]: With dead ends: 62
[2018-06-22 01:13:08,770 INFO ]: Without dead ends: 39
[2018-06-22 01:13:08,771 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=701, Invalid=2491, Unknown=0, NotChecked=0, Total=3192
[2018-06-22 01:13:08,771 INFO ]: Start minimizeSevpa. Operand 39 states.
[2018-06-22 01:13:08,771 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2018-06-22 01:13:08,772 INFO ]: Start removeUnreachable. Operand 39 states.
[2018-06-22 01:13:08,772 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions.
[2018-06-22 01:13:08,772 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37
[2018-06-22 01:13:08,772 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:08,772 INFO ]: Abstraction has 39 states and 41 transitions.
[2018-06-22 01:13:08,772 INFO ]: Interpolant automaton has 35 states.
[2018-06-22 01:13:08,772 INFO ]: Start isEmpty. Operand 39 states and 41 transitions.
[2018-06-22 01:13:08,772 INFO ]: Finished isEmpty. Found accepting run of length 39
[2018-06-22 01:13:08,772 INFO ]: Found error trace
[2018-06-22 01:13:08,772 INFO ]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:08,772 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:08,772 INFO ]: Analyzing trace with hash -248836099, now seen corresponding path program 23 times
[2018-06-22 01:13:08,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:08,772 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:08,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:08,773 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:08,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:08,786 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:09,368 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:09,369 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:09,369 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:13:09,374 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-06-22 01:13:09,422 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s)
[2018-06-22 01:13:09,423 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:09,428 INFO ]: Computing forward predicates...
[2018-06-22 01:13:10,135 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:10,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:10,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 56
[2018-06-22 01:13:10,154 INFO ]: Interpolant automaton has 56 states
[2018-06-22 01:13:10,154 INFO ]: Constructing interpolant automaton starting with 56 interpolants.
[2018-06-22 01:13:10,154 INFO ]: CoverageRelationStatistics Valid=131, Invalid=2949, Unknown=0, NotChecked=0, Total=3080
[2018-06-22 01:13:10,154 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 56 states.
[2018-06-22 01:13:11,484 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:11,484 INFO ]: Finished difference Result 68 states and 74 transitions.
[2018-06-22 01:13:11,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2018-06-22 01:13:11,484 INFO ]: Start accepts. Automaton has 56 states. Word has length 38
[2018-06-22 01:13:11,484 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:11,485 INFO ]: With dead ends: 68
[2018-06-22 01:13:11,485 INFO ]: Without dead ends: 67
[2018-06-22 01:13:11,485 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=376, Invalid=7280, Unknown=0, NotChecked=0, Total=7656
[2018-06-22 01:13:11,485 INFO ]: Start minimizeSevpa. Operand 67 states.
[2018-06-22 01:13:11,487 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 42.
[2018-06-22 01:13:11,487 INFO ]: Start removeUnreachable. Operand 42 states.
[2018-06-22 01:13:11,487 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions.
[2018-06-22 01:13:11,487 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 38
[2018-06-22 01:13:11,487 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:11,487 INFO ]: Abstraction has 42 states and 45 transitions.
[2018-06-22 01:13:11,487 INFO ]: Interpolant automaton has 56 states.
[2018-06-22 01:13:11,487 INFO ]: Start isEmpty. Operand 42 states and 45 transitions.
[2018-06-22 01:13:11,488 INFO ]: Finished isEmpty. Found accepting run of length 40
[2018-06-22 01:13:11,488 INFO ]: Found error trace
[2018-06-22 01:13:11,488 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:11,488 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:11,488 INFO ]: Analyzing trace with hash -443607558, now seen corresponding path program 24 times
[2018-06-22 01:13:11,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:11,488 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:11,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:11,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:11,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:11,502 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:11,910 INFO ]: Checked inductivity of 145 backedges. 45 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:11,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:11,910 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:13:11,916 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-06-22 01:13:11,969 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s)
[2018-06-22 01:13:11,969 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:11,973 INFO ]: Computing forward predicates...
[2018-06-22 01:13:12,043 INFO ]: Checked inductivity of 145 backedges. 45 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:12,062 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:12,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36
[2018-06-22 01:13:12,062 INFO ]: Interpolant automaton has 36 states
[2018-06-22 01:13:12,062 INFO ]: Constructing interpolant automaton starting with 36 interpolants.
[2018-06-22 01:13:12,063 INFO ]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260
[2018-06-22 01:13:12,063 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 36 states.
[2018-06-22 01:13:12,808 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:12,808 INFO ]: Finished difference Result 70 states and 76 transitions.
[2018-06-22 01:13:12,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. 
[2018-06-22 01:13:12,808 INFO ]: Start accepts. Automaton has 36 states. Word has length 39
[2018-06-22 01:13:12,808 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:12,809 INFO ]: With dead ends: 70
[2018-06-22 01:13:12,809 INFO ]: Without dead ends: 69
[2018-06-22 01:13:12,809 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1830, Invalid=4332, Unknown=0, NotChecked=0, Total=6162
[2018-06-22 01:13:12,809 INFO ]: Start minimizeSevpa. Operand 69 states.
[2018-06-22 01:13:12,810 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 41.
[2018-06-22 01:13:12,810 INFO ]: Start removeUnreachable. Operand 41 states.
[2018-06-22 01:13:12,810 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions.
[2018-06-22 01:13:12,811 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39
[2018-06-22 01:13:12,811 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:12,811 INFO ]: Abstraction has 41 states and 43 transitions.
[2018-06-22 01:13:12,811 INFO ]: Interpolant automaton has 36 states.
[2018-06-22 01:13:12,811 INFO ]: Start isEmpty. Operand 41 states and 43 transitions.
[2018-06-22 01:13:12,811 INFO ]: Finished isEmpty. Found accepting run of length 41
[2018-06-22 01:13:12,811 INFO ]: Found error trace
[2018-06-22 01:13:12,811 INFO ]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:12,811 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:12,811 INFO ]: Analyzing trace with hash -1865753190, now seen corresponding path program 25 times
[2018-06-22 01:13:12,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:12,811 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:12,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:12,812 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:12,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:12,822 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:13,405 INFO ]: Checked inductivity of 157 backedges. 81 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:13,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:13,405 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:13:13,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:13:13,456 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:13,460 INFO ]: Computing forward predicates...
[2018-06-22 01:13:13,721 INFO ]: Checked inductivity of 157 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:13,741 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:13,741 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 38
[2018-06-22 01:13:13,742 INFO ]: Interpolant automaton has 38 states
[2018-06-22 01:13:13,742 INFO ]: Constructing interpolant automaton starting with 38 interpolants.
[2018-06-22 01:13:13,742 INFO ]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406
[2018-06-22 01:13:13,742 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 38 states.
[2018-06-22 01:13:14,352 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:14,352 INFO ]: Finished difference Result 67 states and 71 transitions.
[2018-06-22 01:13:14,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2018-06-22 01:13:14,353 INFO ]: Start accepts. Automaton has 38 states. Word has length 40
[2018-06-22 01:13:14,353 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:14,353 INFO ]: With dead ends: 67
[2018-06-22 01:13:14,353 INFO ]: Without dead ends: 42
[2018-06-22 01:13:14,353 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=828, Invalid=2954, Unknown=0, NotChecked=0, Total=3782
[2018-06-22 01:13:14,353 INFO ]: Start minimizeSevpa. Operand 42 states.
[2018-06-22 01:13:14,354 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2018-06-22 01:13:14,354 INFO ]: Start removeUnreachable. Operand 42 states.
[2018-06-22 01:13:14,355 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions.
[2018-06-22 01:13:14,355 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40
[2018-06-22 01:13:14,355 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:14,355 INFO ]: Abstraction has 42 states and 44 transitions.
[2018-06-22 01:13:14,355 INFO ]: Interpolant automaton has 38 states.
[2018-06-22 01:13:14,355 INFO ]: Start isEmpty. Operand 42 states and 44 transitions.
[2018-06-22 01:13:14,355 INFO ]: Finished isEmpty. Found accepting run of length 42
[2018-06-22 01:13:14,355 INFO ]: Found error trace
[2018-06-22 01:13:14,355 INFO ]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:14,355 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:14,355 INFO ]: Analyzing trace with hash -62564265, now seen corresponding path program 26 times
[2018-06-22 01:13:14,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:14,355 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:14,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:14,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:13:14,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:14,372 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:15,861 INFO ]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:15,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:15,862 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:13:15,867 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:13:15,914 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:13:15,914 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:15,919 INFO ]: Computing forward predicates...
[2018-06-22 01:13:16,715 INFO ]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:16,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:16,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 61
[2018-06-22 01:13:16,734 INFO ]: Interpolant automaton has 61 states
[2018-06-22 01:13:16,734 INFO ]: Constructing interpolant automaton starting with 61 interpolants.
[2018-06-22 01:13:16,734 INFO ]: CoverageRelationStatistics Valid=143, Invalid=3517, Unknown=0, NotChecked=0, Total=3660
[2018-06-22 01:13:16,734 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 61 states.
[2018-06-22 01:13:18,248 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:18,248 INFO ]: Finished difference Result 73 states and 79 transitions.
[2018-06-22 01:13:18,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2018-06-22 01:13:18,248 INFO ]: Start accepts. Automaton has 61 states. Word has length 41
[2018-06-22 01:13:18,248 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:18,248 INFO ]: With dead ends: 73
[2018-06-22 01:13:18,248 INFO ]: Without dead ends: 72
[2018-06-22 01:13:18,249 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=410, Invalid=8710, Unknown=0, NotChecked=0, Total=9120
[2018-06-22 01:13:18,249 INFO ]: Start minimizeSevpa. Operand 72 states.
[2018-06-22 01:13:18,251 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 45.
[2018-06-22 01:13:18,251 INFO ]: Start removeUnreachable. Operand 45 states.
[2018-06-22 01:13:18,251 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions.
[2018-06-22 01:13:18,251 INFO ]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41
[2018-06-22 01:13:18,251 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:18,251 INFO ]: Abstraction has 45 states and 48 transitions.
[2018-06-22 01:13:18,251 INFO ]: Interpolant automaton has 61 states.
[2018-06-22 01:13:18,251 INFO ]: Start isEmpty. Operand 45 states and 48 transitions.
[2018-06-22 01:13:18,252 INFO ]: Finished isEmpty. Found accepting run of length 43
[2018-06-22 01:13:18,252 INFO ]: Found error trace
[2018-06-22 01:13:18,252 INFO ]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:18,252 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:18,252 INFO ]: Analyzing trace with hash 1717562, now seen corresponding path program 27 times
[2018-06-22 01:13:18,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:18,252 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:18,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:18,253 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:18,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:18,268 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:19,086 INFO ]: Checked inductivity of 176 backedges. 55 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:19,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:19,086 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)
[2018-06-22 01:13:19,099 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:13:19,159 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s)
[2018-06-22 01:13:19,159 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:19,162 INFO ]: Computing forward predicates...
[2018-06-22 01:13:19,249 INFO ]: Checked inductivity of 176 backedges. 55 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:19,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:19,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 39
[2018-06-22 01:13:19,269 INFO ]: Interpolant automaton has 39 states
[2018-06-22 01:13:19,269 INFO ]: Constructing interpolant automaton starting with 39 interpolants.
[2018-06-22 01:13:19,269 INFO ]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482
[2018-06-22 01:13:19,269 INFO ]: Start difference. First operand 45 states and 48 transitions. Second operand 39 states.
[2018-06-22 01:13:20,205 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:20,205 INFO ]: Finished difference Result 75 states and 81 transitions.
[2018-06-22 01:13:20,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. 
[2018-06-22 01:13:20,205 INFO ]: Start accepts. Automaton has 39 states. Word has length 42
[2018-06-22 01:13:20,206 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:20,206 INFO ]: With dead ends: 75
[2018-06-22 01:13:20,206 INFO ]: Without dead ends: 74
[2018-06-22 01:13:20,206 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2180, Invalid=5130, Unknown=0, NotChecked=0, Total=7310
[2018-06-22 01:13:20,206 INFO ]: Start minimizeSevpa. Operand 74 states.
[2018-06-22 01:13:20,207 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 44.
[2018-06-22 01:13:20,207 INFO ]: Start removeUnreachable. Operand 44 states.
[2018-06-22 01:13:20,208 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions.
[2018-06-22 01:13:20,208 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42
[2018-06-22 01:13:20,208 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:20,208 INFO ]: Abstraction has 44 states and 46 transitions.
[2018-06-22 01:13:20,208 INFO ]: Interpolant automaton has 39 states.
[2018-06-22 01:13:20,208 INFO ]: Start isEmpty. Operand 44 states and 46 transitions.
[2018-06-22 01:13:20,208 INFO ]: Finished isEmpty. Found accepting run of length 44
[2018-06-22 01:13:20,208 INFO ]: Found error trace
[2018-06-22 01:13:20,208 INFO ]: trace histogram [12, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:20,208 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:20,209 INFO ]: Analyzing trace with hash 1047820148, now seen corresponding path program 28 times
[2018-06-22 01:13:20,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:20,209 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:20,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:20,209 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:20,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:20,222 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:20,832 INFO ]: Checked inductivity of 189 backedges. 100 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:20,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:20,832 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:13:20,838 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 01:13:20,888 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 01:13:20,888 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:20,894 INFO ]: Computing forward predicates...
[2018-06-22 01:13:20,990 INFO ]: Checked inductivity of 189 backedges. 121 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:21,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:21,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 41
[2018-06-22 01:13:21,011 INFO ]: Interpolant automaton has 41 states
[2018-06-22 01:13:21,011 INFO ]: Constructing interpolant automaton starting with 41 interpolants.
[2018-06-22 01:13:21,011 INFO ]: CoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640
[2018-06-22 01:13:21,011 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 41 states.
[2018-06-22 01:13:21,767 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 26
[2018-06-22 01:13:21,832 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:21,832 INFO ]: Finished difference Result 72 states and 76 transitions.
[2018-06-22 01:13:21,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2018-06-22 01:13:21,838 INFO ]: Start accepts. Automaton has 41 states. Word has length 43
[2018-06-22 01:13:21,838 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:21,838 INFO ]: With dead ends: 72
[2018-06-22 01:13:21,838 INFO ]: Without dead ends: 45
[2018-06-22 01:13:21,839 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=966, Invalid=3456, Unknown=0, NotChecked=0, Total=4422
[2018-06-22 01:13:21,839 INFO ]: Start minimizeSevpa. Operand 45 states.
[2018-06-22 01:13:21,840 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2018-06-22 01:13:21,840 INFO ]: Start removeUnreachable. Operand 45 states.
[2018-06-22 01:13:21,841 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions.
[2018-06-22 01:13:21,841 INFO ]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43
[2018-06-22 01:13:21,841 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:21,841 INFO ]: Abstraction has 45 states and 47 transitions.
[2018-06-22 01:13:21,841 INFO ]: Interpolant automaton has 41 states.
[2018-06-22 01:13:21,841 INFO ]: Start isEmpty. Operand 45 states and 47 transitions.
[2018-06-22 01:13:21,841 INFO ]: Finished isEmpty. Found accepting run of length 45
[2018-06-22 01:13:21,841 INFO ]: Found error trace
[2018-06-22 01:13:21,841 INFO ]: trace histogram [12, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:21,841 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:21,841 INFO ]: Analyzing trace with hash -1601853545, now seen corresponding path program 29 times
[2018-06-22 01:13:21,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:21,841 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:21,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:21,844 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:21,844 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:21,857 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:22,626 INFO ]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:22,626 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:22,626 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:13:22,631 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-06-22 01:13:22,692 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s)
[2018-06-22 01:13:22,692 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:22,696 INFO ]: Computing forward predicates...
[2018-06-22 01:13:24,144 INFO ]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:24,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:24,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 66
[2018-06-22 01:13:24,163 INFO ]: Interpolant automaton has 66 states
[2018-06-22 01:13:24,163 INFO ]: Constructing interpolant automaton starting with 66 interpolants.
[2018-06-22 01:13:24,163 INFO ]: CoverageRelationStatistics Valid=155, Invalid=4135, Unknown=0, NotChecked=0, Total=4290
[2018-06-22 01:13:24,164 INFO ]: Start difference. First operand 45 states and 47 transitions. Second operand 66 states.
[2018-06-22 01:13:25,949 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:25,949 INFO ]: Finished difference Result 78 states and 84 transitions.
[2018-06-22 01:13:25,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2018-06-22 01:13:25,949 INFO ]: Start accepts. Automaton has 66 states. Word has length 44
[2018-06-22 01:13:25,949 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:25,950 INFO ]: With dead ends: 78
[2018-06-22 01:13:25,950 INFO ]: Without dead ends: 77
[2018-06-22 01:13:25,950 INFO ]: 0 DeclaredPredicates, 121 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=444, Invalid=10268, Unknown=0, NotChecked=0, Total=10712
[2018-06-22 01:13:25,950 INFO ]: Start minimizeSevpa. Operand 77 states.
[2018-06-22 01:13:25,952 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 48.
[2018-06-22 01:13:25,952 INFO ]: Start removeUnreachable. Operand 48 states.
[2018-06-22 01:13:25,952 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions.
[2018-06-22 01:13:25,952 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44
[2018-06-22 01:13:25,952 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:25,952 INFO ]: Abstraction has 48 states and 51 transitions.
[2018-06-22 01:13:25,952 INFO ]: Interpolant automaton has 66 states.
[2018-06-22 01:13:25,952 INFO ]: Start isEmpty. Operand 48 states and 51 transitions.
[2018-06-22 01:13:25,953 INFO ]: Finished isEmpty. Found accepting run of length 46
[2018-06-22 01:13:25,953 INFO ]: Found error trace
[2018-06-22 01:13:25,953 INFO ]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:25,953 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:25,953 INFO ]: Analyzing trace with hash -2137359404, now seen corresponding path program 30 times
[2018-06-22 01:13:25,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:25,953 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:25,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:25,953 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:25,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:25,965 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:26,410 INFO ]: Checked inductivity of 210 backedges. 66 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:26,410 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:26,410 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:13:26,416 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-06-22 01:13:26,477 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s)
[2018-06-22 01:13:26,478 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:26,481 INFO ]: Computing forward predicates...
[2018-06-22 01:13:26,557 INFO ]: Checked inductivity of 210 backedges. 66 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:26,576 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:26,576 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 42
[2018-06-22 01:13:26,576 INFO ]: Interpolant automaton has 42 states
[2018-06-22 01:13:26,576 INFO ]: Constructing interpolant automaton starting with 42 interpolants.
[2018-06-22 01:13:26,577 INFO ]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722
[2018-06-22 01:13:26,577 INFO ]: Start difference. First operand 48 states and 51 transitions. Second operand 42 states.
[2018-06-22 01:13:27,604 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:27,604 INFO ]: Finished difference Result 80 states and 86 transitions.
[2018-06-22 01:13:27,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 64 states. 
[2018-06-22 01:13:27,607 INFO ]: Start accepts. Automaton has 42 states. Word has length 45
[2018-06-22 01:13:27,607 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:27,608 INFO ]: With dead ends: 80
[2018-06-22 01:13:27,608 INFO ]: Without dead ends: 79
[2018-06-22 01:13:27,608 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2561, Invalid=5995, Unknown=0, NotChecked=0, Total=8556
[2018-06-22 01:13:27,608 INFO ]: Start minimizeSevpa. Operand 79 states.
[2018-06-22 01:13:27,610 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 47.
[2018-06-22 01:13:27,610 INFO ]: Start removeUnreachable. Operand 47 states.
[2018-06-22 01:13:27,610 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions.
[2018-06-22 01:13:27,610 INFO ]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 45
[2018-06-22 01:13:27,610 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:27,610 INFO ]: Abstraction has 47 states and 49 transitions.
[2018-06-22 01:13:27,610 INFO ]: Interpolant automaton has 42 states.
[2018-06-22 01:13:27,610 INFO ]: Start isEmpty. Operand 47 states and 49 transitions.
[2018-06-22 01:13:27,611 INFO ]: Finished isEmpty. Found accepting run of length 47
[2018-06-22 01:13:27,611 INFO ]: Found error trace
[2018-06-22 01:13:27,611 INFO ]: trace histogram [13, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:27,611 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:27,613 INFO ]: Analyzing trace with hash -740428108, now seen corresponding path program 31 times
[2018-06-22 01:13:27,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:27,613 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:27,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:27,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 01:13:27,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:27,625 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:28,126 INFO ]: Checked inductivity of 224 backedges. 121 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:28,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:28,126 INFO ]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:13:28,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:13:28,195 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:28,201 INFO ]: Computing forward predicates...
[2018-06-22 01:13:28,290 INFO ]: Checked inductivity of 224 backedges. 144 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:28,322 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 01:13:28,322 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 44
[2018-06-22 01:13:28,322 INFO ]: Interpolant automaton has 44 states
[2018-06-22 01:13:28,322 INFO ]: Constructing interpolant automaton starting with 44 interpolants.
[2018-06-22 01:13:28,322 INFO ]: CoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892
[2018-06-22 01:13:28,322 INFO ]: Start difference. First operand 47 states and 49 transitions. Second operand 44 states.
[2018-06-22 01:13:29,067 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 01:13:29,067 INFO ]: Finished difference Result 77 states and 81 transitions.
[2018-06-22 01:13:29,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2018-06-22 01:13:29,067 INFO ]: Start accepts. Automaton has 44 states. Word has length 46
[2018-06-22 01:13:29,067 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 01:13:29,068 INFO ]: With dead ends: 77
[2018-06-22 01:13:29,068 INFO ]: Without dead ends: 48
[2018-06-22 01:13:29,068 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1115, Invalid=3997, Unknown=0, NotChecked=0, Total=5112
[2018-06-22 01:13:29,068 INFO ]: Start minimizeSevpa. Operand 48 states.
[2018-06-22 01:13:29,069 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-06-22 01:13:29,069 INFO ]: Start removeUnreachable. Operand 48 states.
[2018-06-22 01:13:29,069 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2018-06-22 01:13:29,069 INFO ]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 46
[2018-06-22 01:13:29,069 INFO ]: Finished accepts. word is rejected.
[2018-06-22 01:13:29,069 INFO ]: Abstraction has 48 states and 50 transitions.
[2018-06-22 01:13:29,069 INFO ]: Interpolant automaton has 44 states.
[2018-06-22 01:13:29,069 INFO ]: Start isEmpty. Operand 48 states and 50 transitions.
[2018-06-22 01:13:29,070 INFO ]: Finished isEmpty. Found accepting run of length 48
[2018-06-22 01:13:29,070 INFO ]: Found error trace
[2018-06-22 01:13:29,070 INFO ]: trace histogram [13, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 01:13:29,070 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 01:13:29,070 INFO ]: Analyzing trace with hash 34516913, now seen corresponding path program 32 times
[2018-06-22 01:13:29,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 01:13:29,070 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 01:13:29,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:29,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 01:13:29,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 01:13:29,086 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:29,897 INFO ]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 01:13:29,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 01:13:29,897 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:13:29,903 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 01:13:29,959 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 01:13:29,959 INFO ]: Conjunction of SSA is unsat
[2018-06-22 01:13:29,965 INFO ]: Computing forward predicates...
Received shutdown request...
[2018-06-22 01:13:31,022 INFO ]: Timeout while computing interpolants
[2018-06-22 01:13:31,223 WARN ]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-06-22 01:13:31,223 WARN ]: Verification canceled
[2018-06-22 01:13:31,230 WARN ]: Timeout
[2018-06-22 01:13:31,230 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:13:31 BoogieIcfgContainer
[2018-06-22 01:13:31,230 INFO ]: ------------------------ END TraceAbstraction----------------------------
[2018-06-22 01:13:31,231 INFO ]: Toolchain (without parser) took 59072.97 ms. Allocated memory was 303.0 MB in the beginning and 666.4 MB in the end (delta: 363.3 MB). Free memory was 258.6 MB in the beginning and 292.7 MB in the end (delta: -34.1 MB). Peak memory consumption was 329.2 MB. Max. memory is 3.6 GB.
[2018-06-22 01:13:31,232 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB.
[2018-06-22 01:13:31,233 INFO ]: ChcToBoogie took 56.29 ms. Allocated memory is still 303.0 MB. Free memory was 258.6 MB in the beginning and 255.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB.
[2018-06-22 01:13:31,233 INFO ]: Boogie Preprocessor took 34.95 ms. Allocated memory is still 303.0 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB.
[2018-06-22 01:13:31,234 INFO ]: RCFGBuilder took 326.93 ms. Allocated memory is still 303.0 MB. Free memory was 254.6 MB in the beginning and 244.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB.
[2018-06-22 01:13:31,235 INFO ]: TraceAbstraction took 58645.95 ms. Allocated memory was 303.0 MB in the beginning and 666.4 MB in the end (delta: 363.3 MB). Free memory was 243.5 MB in the beginning and 292.7 MB in the end (delta: -49.2 MB). Peak memory consumption was 314.2 MB. Max. memory is 3.6 GB.
[2018-06-22 01:13:31,241 INFO ]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.06 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB.
 * ChcToBoogie took 56.29 ms. Allocated memory is still 303.0 MB. Free memory was 258.6 MB in the beginning and 255.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB.
 * Boogie Preprocessor took 34.95 ms. Allocated memory is still 303.0 MB. Free memory was 255.6 MB in the beginning and 254.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB.
 * RCFGBuilder took 326.93 ms. Allocated memory is still 303.0 MB. Free memory was 254.6 MB in the beginning and 244.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB.
 * TraceAbstraction took 58645.95 ms. Allocated memory was 303.0 MB in the beginning and 666.4 MB in the end (delta: 363.3 MB). Free memory was 243.5 MB in the beginning and 292.7 MB in the end (delta: -49.2 MB). Peak memory consumption was 314.2 MB. Max. memory is 3.6 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction)
    Unable to prove that assertion always holds (line 0). Cancelled  while BasicCegarLoop was analyzing trace of length 48 with TraceHistMax 13, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates.
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 14 locations, 1 error locations. TIMEOUT Result, 58.5s OverallTime, 41 OverallIterations, 13 TraceHistogramMax, 24.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 441 SDtfs, 1522 SDslu, 7034 SDs, 0 SdLazy, 16456 SolverSat, 2054 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2720 GetRequests, 831 SyntacticMatches, 12 SemanticMatches, 1877 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22924 ImplicationChecksByTransitivity, 40.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=38, 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, 40 MinimizatonAttempts, 482 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 201 NumberOfCheckSat, 2038 ConstructedInterpolants, 6 QuantifiedInterpolants, 302261 SizeOfPredicates, 1299 NumberOfNonLiveVariables, 11763 ConjunctsInSsa, 2868 ConjunctsInUnsatCore, 78 InterpolantComputations, 3 PerfectInterpolantSequences, 1731/5700 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/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-13-31-257.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-13-31-257.csv
Completed graceful shutdown