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/llreve-bench/smt2/faulty__limit2!.smt2'


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


This is Ultimate 0.1.23-8d74a04
[2018-06-22 02:09:08,702 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-06-22 02:09:08,704 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-06-22 02:09:08,718 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-06-22 02:09:08,719 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-06-22 02:09:08,719 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-06-22 02:09:08,721 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-06-22 02:09:08,724 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-06-22 02:09:08,725 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-06-22 02:09:08,726 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-06-22 02:09:08,728 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-06-22 02:09:08,729 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-06-22 02:09:08,729 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-06-22 02:09:08,730 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-06-22 02:09:08,731 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-06-22 02:09:08,734 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-06-22 02:09:08,735 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-06-22 02:09:08,746 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-06-22 02:09:08,747 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-06-22 02:09:08,748 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-06-22 02:09:08,749 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-06-22 02:09:08,751 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-06-22 02:09:08,751 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-06-22 02:09:08,752 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-06-22 02:09:08,752 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-06-22 02:09:08,758 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-06-22 02:09:08,759 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-06-22 02:09:08,760 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-06-22 02:09:08,761 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-06-22 02:09:08,761 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-06-22 02:09:08,761 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-06-22 02:09:08,765 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-06-22 02:09:08,765 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-06-22 02:09:08,766 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-06-22 02:09:08,766 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-06-22 02:09:08,767 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf
[2018-06-22 02:09:08,787 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-06-22 02:09:08,787 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-06-22 02:09:08,788 INFO  L131        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2018-06-22 02:09:08,788 INFO  L133        SettingsManager]:  * Logger pattern=[%d{ISO8601} %-5p]: %m%n
[2018-06-22 02:09:08,791 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-06-22 02:09:08,792 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-06-22 02:09:08,792 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-06-22 02:09:08,792 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-06-22 02:09:08,792 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-06-22 02:09:08,792 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-06-22 02:09:08,793 INFO  L133        SettingsManager]:  * Compute trace for counterexample result=false
[2018-06-22 02:09:08,796 INFO  L131        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2018-06-22 02:09:08,796 INFO  L133        SettingsManager]:  * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true
[2018-06-22 02:09:08,845 INFO ]: Repository-Root is: /tmp
[2018-06-22 02:09:08,862 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-06-22 02:09:08,867 INFO ]: [Toolchain 1]: Toolchain data selected.
[2018-06-22 02:09:08,869 INFO ]: Initializing SmtParser...
[2018-06-22 02:09:08,869 INFO ]: SmtParser initialized
[2018-06-22 02:09:08,870 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2
[2018-06-22 02:09:08,871 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 02:09:08,968 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2
unknown
de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@1ff4d438
[2018-06-22 02:09:09,191 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2
[2018-06-22 02:09:09,196 INFO ]: ####################### [Toolchain 1] #######################
[2018-06-22 02:09:09,202 INFO ]: Walking toolchain with 4 elements.
[2018-06-22 02:09:09,202 INFO ]: ------------------------ChcToBoogie----------------------------
[2018-06-22 02:09:09,202 INFO ]: Initializing ChcToBoogie...
[2018-06-22 02:09:09,203 INFO ]: ChcToBoogie initialized
[2018-06-22 02:09:09,206 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,264 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09 Unit
[2018-06-22 02:09:09,264 INFO ]: ------------------------ END ChcToBoogie----------------------------
[2018-06-22 02:09:09,265 INFO ]: ------------------------Boogie Preprocessor----------------------------
[2018-06-22 02:09:09,265 INFO ]: Initializing Boogie Preprocessor...
[2018-06-22 02:09:09,265 INFO ]: Boogie Preprocessor initialized
[2018-06-22 02:09:09,287 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,287 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,300 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,300 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,307 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,318 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,320 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (1/1) ...
[2018-06-22 02:09:09,322 INFO ]: ------------------------ END Boogie Preprocessor----------------------------
[2018-06-22 02:09:09,322 INFO ]: ------------------------RCFGBuilder----------------------------
[2018-06-22 02:09:09,322 INFO ]: Initializing RCFGBuilder...
[2018-06-22 02:09:09,322 INFO ]: RCFGBuilder initialized
[2018-06-22 02:09:09,325 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (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 02:09:09,338 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration
[2018-06-22 02:09:09,338 INFO ]: Found specification of procedure gotoProc
[2018-06-22 02:09:09,338 INFO ]: Found implementation of procedure gotoProc
[2018-06-22 02:09:09,338 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2018-06-22 02:09:09,339 INFO ]: Found specification of procedure Ultimate.START
[2018-06-22 02:09:09,339 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 02:09:09,824 INFO ]: Using library mode
[2018-06-22 02:09:09,825 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:09:09 BoogieIcfgContainer
[2018-06-22 02:09:09,825 INFO ]: ------------------------ END RCFGBuilder----------------------------
[2018-06-22 02:09:09,826 INFO ]: ------------------------TraceAbstraction----------------------------
[2018-06-22 02:09:09,826 INFO ]: Initializing TraceAbstraction...
[2018-06-22 02:09:09,848 INFO ]: TraceAbstraction initialized
[2018-06-22 02:09:09,848 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:09:09" (1/3) ...
[2018-06-22 02:09:09,849 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2347b64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:09:09, skipping insertion in model container
[2018-06-22 02:09:09,849 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:09:09" (2/3) ...
[2018-06-22 02:09:09,849 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2347b64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:09:09, skipping insertion in model container
[2018-06-22 02:09:09,849 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:09:09" (3/3) ...
[2018-06-22 02:09:09,851 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2018-06-22 02:09:09,859 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-06-22 02:09:09,866 INFO ]: Appying trace abstraction to program that has 1 error locations.
[2018-06-22 02:09:09,905 INFO ]: Using default assertion order modulation
[2018-06-22 02:09:09,905 INFO ]: Interprodecural is true
[2018-06-22 02:09:09,905 INFO ]: Hoare is false
[2018-06-22 02:09:09,905 INFO ]: Compute interpolants for FPandBP
[2018-06-22 02:09:09,905 INFO ]: Backedges is TWOTRACK
[2018-06-22 02:09:09,906 INFO ]: Determinization is PREDICATE_ABSTRACTION
[2018-06-22 02:09:09,906 INFO ]: Difference is false
[2018-06-22 02:09:09,906 INFO ]: Minimize is MINIMIZE_SEVPA
[2018-06-22 02:09:09,906 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-06-22 02:09:09,927 INFO ]: Start isEmpty. Operand 28 states.
[2018-06-22 02:09:09,939 INFO ]: Finished isEmpty. Found accepting run of length 9
[2018-06-22 02:09:09,939 INFO ]: Found error trace
[2018-06-22 02:09:09,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:09,941 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:09,946 INFO ]: Analyzing trace with hash -802299303, now seen corresponding path program 1 times
[2018-06-22 02:09:09,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:09,948 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:09,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:09,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:09,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:10,025 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:10,101 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 02:09:10,103 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:10,103 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-06-22 02:09:10,104 INFO ]: Interpolant automaton has 4 states
[2018-06-22 02:09:10,115 INFO ]: Constructing interpolant automaton starting with 4 interpolants.
[2018-06-22 02:09:10,115 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-06-22 02:09:10,117 INFO ]: Start difference. First operand 28 states. Second operand 4 states.
[2018-06-22 02:09:10,658 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:10,658 INFO ]: Finished difference Result 45 states and 76 transitions.
[2018-06-22 02:09:10,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 02:09:10,659 INFO ]: Start accepts. Automaton has 4 states. Word has length 8
[2018-06-22 02:09:10,660 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:10,670 INFO ]: With dead ends: 45
[2018-06-22 02:09:10,670 INFO ]: Without dead ends: 45
[2018-06-22 02:09:10,672 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-06-22 02:09:10,685 INFO ]: Start minimizeSevpa. Operand 45 states.
[2018-06-22 02:09:10,720 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2018-06-22 02:09:10,721 INFO ]: Start removeUnreachable. Operand 45 states.
[2018-06-22 02:09:10,724 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions.
[2018-06-22 02:09:10,726 INFO ]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 8
[2018-06-22 02:09:10,726 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:10,726 INFO ]: Abstraction has 45 states and 76 transitions.
[2018-06-22 02:09:10,726 INFO ]: Interpolant automaton has 4 states.
[2018-06-22 02:09:10,726 INFO ]: Start isEmpty. Operand 45 states and 76 transitions.
[2018-06-22 02:09:10,728 INFO ]: Finished isEmpty. Found accepting run of length 9
[2018-06-22 02:09:10,728 INFO ]: Found error trace
[2018-06-22 02:09:10,728 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:10,728 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:10,728 INFO ]: Analyzing trace with hash -791663916, now seen corresponding path program 1 times
[2018-06-22 02:09:10,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:10,728 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:10,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:10,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:10,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:10,734 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:10,768 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 02:09:10,768 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:10,768 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-06-22 02:09:10,770 INFO ]: Interpolant automaton has 4 states
[2018-06-22 02:09:10,770 INFO ]: Constructing interpolant automaton starting with 4 interpolants.
[2018-06-22 02:09:10,770 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-06-22 02:09:10,770 INFO ]: Start difference. First operand 45 states and 76 transitions. Second operand 4 states.
[2018-06-22 02:09:11,032 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:11,032 INFO ]: Finished difference Result 64 states and 109 transitions.
[2018-06-22 02:09:11,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 02:09:11,033 INFO ]: Start accepts. Automaton has 4 states. Word has length 8
[2018-06-22 02:09:11,033 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:11,036 INFO ]: With dead ends: 64
[2018-06-22 02:09:11,036 INFO ]: Without dead ends: 64
[2018-06-22 02:09:11,037 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-06-22 02:09:11,037 INFO ]: Start minimizeSevpa. Operand 64 states.
[2018-06-22 02:09:11,048 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2018-06-22 02:09:11,048 INFO ]: Start removeUnreachable. Operand 64 states.
[2018-06-22 02:09:11,051 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions.
[2018-06-22 02:09:11,051 INFO ]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8
[2018-06-22 02:09:11,051 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:11,051 INFO ]: Abstraction has 64 states and 109 transitions.
[2018-06-22 02:09:11,051 INFO ]: Interpolant automaton has 4 states.
[2018-06-22 02:09:11,051 INFO ]: Start isEmpty. Operand 64 states and 109 transitions.
[2018-06-22 02:09:11,052 INFO ]: Finished isEmpty. Found accepting run of length 10
[2018-06-22 02:09:11,052 INFO ]: Found error trace
[2018-06-22 02:09:11,052 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:11,052 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:11,052 INFO ]: Analyzing trace with hash 1249031438, now seen corresponding path program 1 times
[2018-06-22 02:09:11,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:11,052 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:11,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:11,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,058 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:11,081 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 02:09:11,081 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:11,081 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-06-22 02:09:11,081 INFO ]: Interpolant automaton has 4 states
[2018-06-22 02:09:11,081 INFO ]: Constructing interpolant automaton starting with 4 interpolants.
[2018-06-22 02:09:11,081 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-06-22 02:09:11,082 INFO ]: Start difference. First operand 64 states and 109 transitions. Second operand 4 states.
[2018-06-22 02:09:11,300 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:11,300 INFO ]: Finished difference Result 83 states and 142 transitions.
[2018-06-22 02:09:11,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 02:09:11,315 INFO ]: Start accepts. Automaton has 4 states. Word has length 9
[2018-06-22 02:09:11,315 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:11,317 INFO ]: With dead ends: 83
[2018-06-22 02:09:11,317 INFO ]: Without dead ends: 83
[2018-06-22 02:09:11,317 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-06-22 02:09:11,317 INFO ]: Start minimizeSevpa. Operand 83 states.
[2018-06-22 02:09:11,329 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2018-06-22 02:09:11,329 INFO ]: Start removeUnreachable. Operand 83 states.
[2018-06-22 02:09:11,332 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 142 transitions.
[2018-06-22 02:09:11,332 INFO ]: Start accepts. Automaton has 83 states and 142 transitions. Word has length 9
[2018-06-22 02:09:11,332 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:11,332 INFO ]: Abstraction has 83 states and 142 transitions.
[2018-06-22 02:09:11,332 INFO ]: Interpolant automaton has 4 states.
[2018-06-22 02:09:11,332 INFO ]: Start isEmpty. Operand 83 states and 142 transitions.
[2018-06-22 02:09:11,333 INFO ]: Finished isEmpty. Found accepting run of length 12
[2018-06-22 02:09:11,333 INFO ]: Found error trace
[2018-06-22 02:09:11,333 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:11,333 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:11,334 INFO ]: Analyzing trace with hash -1263114815, now seen corresponding path program 1 times
[2018-06-22 02:09:11,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:11,334 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:11,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:11,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,347 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:11,372 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 02:09:11,372 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:11,372 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-06-22 02:09:11,372 INFO ]: Interpolant automaton has 3 states
[2018-06-22 02:09:11,372 INFO ]: Constructing interpolant automaton starting with 3 interpolants.
[2018-06-22 02:09:11,372 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:11,372 INFO ]: Start difference. First operand 83 states and 142 transitions. Second operand 3 states.
[2018-06-22 02:09:11,390 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:11,390 INFO ]: Finished difference Result 95 states and 158 transitions.
[2018-06-22 02:09:11,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-06-22 02:09:11,390 INFO ]: Start accepts. Automaton has 3 states. Word has length 11
[2018-06-22 02:09:11,390 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:11,393 INFO ]: With dead ends: 95
[2018-06-22 02:09:11,393 INFO ]: Without dead ends: 95
[2018-06-22 02:09:11,393 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:11,393 INFO ]: Start minimizeSevpa. Operand 95 states.
[2018-06-22 02:09:11,403 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 87.
[2018-06-22 02:09:11,403 INFO ]: Start removeUnreachable. Operand 87 states.
[2018-06-22 02:09:11,405 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 146 transitions.
[2018-06-22 02:09:11,405 INFO ]: Start accepts. Automaton has 87 states and 146 transitions. Word has length 11
[2018-06-22 02:09:11,405 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:11,405 INFO ]: Abstraction has 87 states and 146 transitions.
[2018-06-22 02:09:11,405 INFO ]: Interpolant automaton has 3 states.
[2018-06-22 02:09:11,406 INFO ]: Start isEmpty. Operand 87 states and 146 transitions.
[2018-06-22 02:09:11,407 INFO ]: Finished isEmpty. Found accepting run of length 12
[2018-06-22 02:09:11,407 INFO ]: Found error trace
[2018-06-22 02:09:11,407 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:11,407 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:11,407 INFO ]: Analyzing trace with hash -986773499, now seen corresponding path program 1 times
[2018-06-22 02:09:11,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:11,407 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:11,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:11,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,419 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:11,472 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-06-22 02:09:11,472 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:11,472 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-06-22 02:09:11,472 INFO ]: Interpolant automaton has 3 states
[2018-06-22 02:09:11,472 INFO ]: Constructing interpolant automaton starting with 3 interpolants.
[2018-06-22 02:09:11,472 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:11,473 INFO ]: Start difference. First operand 87 states and 146 transitions. Second operand 3 states.
[2018-06-22 02:09:11,594 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:11,594 INFO ]: Finished difference Result 119 states and 220 transitions.
[2018-06-22 02:09:11,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-06-22 02:09:11,594 INFO ]: Start accepts. Automaton has 3 states. Word has length 11
[2018-06-22 02:09:11,594 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:11,599 INFO ]: With dead ends: 119
[2018-06-22 02:09:11,599 INFO ]: Without dead ends: 119
[2018-06-22 02:09:11,600 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:11,600 INFO ]: Start minimizeSevpa. Operand 119 states.
[2018-06-22 02:09:11,615 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 91.
[2018-06-22 02:09:11,615 INFO ]: Start removeUnreachable. Operand 91 states.
[2018-06-22 02:09:11,617 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 154 transitions.
[2018-06-22 02:09:11,617 INFO ]: Start accepts. Automaton has 91 states and 154 transitions. Word has length 11
[2018-06-22 02:09:11,617 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:11,617 INFO ]: Abstraction has 91 states and 154 transitions.
[2018-06-22 02:09:11,617 INFO ]: Interpolant automaton has 3 states.
[2018-06-22 02:09:11,617 INFO ]: Start isEmpty. Operand 91 states and 154 transitions.
[2018-06-22 02:09:11,621 INFO ]: Finished isEmpty. Found accepting run of length 21
[2018-06-22 02:09:11,621 INFO ]: Found error trace
[2018-06-22 02:09:11,621 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:11,621 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:11,621 INFO ]: Analyzing trace with hash -262491131, now seen corresponding path program 1 times
[2018-06-22 02:09:11,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:11,621 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:11,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:11,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,637 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:11,711 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-06-22 02:09:11,711 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:11,712 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-06-22 02:09:11,712 INFO ]: Interpolant automaton has 3 states
[2018-06-22 02:09:11,712 INFO ]: Constructing interpolant automaton starting with 3 interpolants.
[2018-06-22 02:09:11,712 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:11,712 INFO ]: Start difference. First operand 91 states and 154 transitions. Second operand 3 states.
[2018-06-22 02:09:11,824 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:11,824 INFO ]: Finished difference Result 95 states and 158 transitions.
[2018-06-22 02:09:11,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-06-22 02:09:11,824 INFO ]: Start accepts. Automaton has 3 states. Word has length 20
[2018-06-22 02:09:11,825 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:11,826 INFO ]: With dead ends: 95
[2018-06-22 02:09:11,826 INFO ]: Without dead ends: 95
[2018-06-22 02:09:11,826 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:11,827 INFO ]: Start minimizeSevpa. Operand 95 states.
[2018-06-22 02:09:11,835 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2018-06-22 02:09:11,835 INFO ]: Start removeUnreachable. Operand 95 states.
[2018-06-22 02:09:11,837 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 158 transitions.
[2018-06-22 02:09:11,837 INFO ]: Start accepts. Automaton has 95 states and 158 transitions. Word has length 20
[2018-06-22 02:09:11,838 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:11,838 INFO ]: Abstraction has 95 states and 158 transitions.
[2018-06-22 02:09:11,838 INFO ]: Interpolant automaton has 3 states.
[2018-06-22 02:09:11,838 INFO ]: Start isEmpty. Operand 95 states and 158 transitions.
[2018-06-22 02:09:11,841 INFO ]: Finished isEmpty. Found accepting run of length 21
[2018-06-22 02:09:11,841 INFO ]: Found error trace
[2018-06-22 02:09:11,841 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:11,841 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:11,842 INFO ]: Analyzing trace with hash -1983174735, now seen corresponding path program 1 times
[2018-06-22 02:09:11,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:11,842 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:11,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:11,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:11,868 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:12,081 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-06-22 02:09:12,081 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:12,081 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-06-22 02:09:12,082 INFO ]: Interpolant automaton has 6 states
[2018-06-22 02:09:12,082 INFO ]: Constructing interpolant automaton starting with 6 interpolants.
[2018-06-22 02:09:12,082 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-06-22 02:09:12,082 INFO ]: Start difference. First operand 95 states and 158 transitions. Second operand 6 states.
[2018-06-22 02:09:12,369 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:12,369 INFO ]: Finished difference Result 143 states and 260 transitions.
[2018-06-22 02:09:12,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-06-22 02:09:12,370 INFO ]: Start accepts. Automaton has 6 states. Word has length 20
[2018-06-22 02:09:12,370 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:12,373 INFO ]: With dead ends: 143
[2018-06-22 02:09:12,373 INFO ]: Without dead ends: 143
[2018-06-22 02:09:12,374 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-06-22 02:09:12,374 INFO ]: Start minimizeSevpa. Operand 143 states.
[2018-06-22 02:09:12,389 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 103.
[2018-06-22 02:09:12,389 INFO ]: Start removeUnreachable. Operand 103 states.
[2018-06-22 02:09:12,392 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 170 transitions.
[2018-06-22 02:09:12,392 INFO ]: Start accepts. Automaton has 103 states and 170 transitions. Word has length 20
[2018-06-22 02:09:12,392 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:12,392 INFO ]: Abstraction has 103 states and 170 transitions.
[2018-06-22 02:09:12,392 INFO ]: Interpolant automaton has 6 states.
[2018-06-22 02:09:12,392 INFO ]: Start isEmpty. Operand 103 states and 170 transitions.
[2018-06-22 02:09:12,394 INFO ]: Finished isEmpty. Found accepting run of length 22
[2018-06-22 02:09:12,394 INFO ]: Found error trace
[2018-06-22 02:09:12,394 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:12,394 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:12,395 INFO ]: Analyzing trace with hash -821555797, now seen corresponding path program 1 times
[2018-06-22 02:09:12,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:12,395 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:12,395 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:12,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:12,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:12,404 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:12,434 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-06-22 02:09:12,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:12,435 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-06-22 02:09:12,435 INFO ]: Interpolant automaton has 3 states
[2018-06-22 02:09:12,435 INFO ]: Constructing interpolant automaton starting with 3 interpolants.
[2018-06-22 02:09:12,435 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:12,435 INFO ]: Start difference. First operand 103 states and 170 transitions. Second operand 3 states.
[2018-06-22 02:09:12,491 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:12,492 INFO ]: Finished difference Result 122 states and 213 transitions.
[2018-06-22 02:09:12,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-06-22 02:09:12,492 INFO ]: Start accepts. Automaton has 3 states. Word has length 21
[2018-06-22 02:09:12,492 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:12,495 INFO ]: With dead ends: 122
[2018-06-22 02:09:12,495 INFO ]: Without dead ends: 118
[2018-06-22 02:09:12,495 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-06-22 02:09:12,495 INFO ]: Start minimizeSevpa. Operand 118 states.
[2018-06-22 02:09:12,506 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 103.
[2018-06-22 02:09:12,506 INFO ]: Start removeUnreachable. Operand 103 states.
[2018-06-22 02:09:12,508 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions.
[2018-06-22 02:09:12,508 INFO ]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 21
[2018-06-22 02:09:12,509 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:12,509 INFO ]: Abstraction has 103 states and 166 transitions.
[2018-06-22 02:09:12,509 INFO ]: Interpolant automaton has 3 states.
[2018-06-22 02:09:12,509 INFO ]: Start isEmpty. Operand 103 states and 166 transitions.
[2018-06-22 02:09:12,510 INFO ]: Finished isEmpty. Found accepting run of length 22
[2018-06-22 02:09:12,510 INFO ]: Found error trace
[2018-06-22 02:09:12,510 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:12,510 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:12,510 INFO ]: Analyzing trace with hash 449715580, now seen corresponding path program 1 times
[2018-06-22 02:09:12,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:12,510 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:12,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:12,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:12,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:12,523 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:12,759 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-06-22 02:09:12,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 02:09:12,759 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 02:09:12,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:12,810 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:12,821 INFO ]: Computing forward predicates...
[2018-06-22 02:09:12,848 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-06-22 02:09:12,883 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 02:09:12,883 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5
[2018-06-22 02:09:12,883 INFO ]: Interpolant automaton has 5 states
[2018-06-22 02:09:12,883 INFO ]: Constructing interpolant automaton starting with 5 interpolants.
[2018-06-22 02:09:12,883 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-06-22 02:09:12,883 INFO ]: Start difference. First operand 103 states and 166 transitions. Second operand 5 states.
[2018-06-22 02:09:13,050 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:13,050 INFO ]: Finished difference Result 104 states and 178 transitions.
[2018-06-22 02:09:13,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-06-22 02:09:13,051 INFO ]: Start accepts. Automaton has 5 states. Word has length 21
[2018-06-22 02:09:13,051 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:13,052 INFO ]: With dead ends: 104
[2018-06-22 02:09:13,052 INFO ]: Without dead ends: 74
[2018-06-22 02:09:13,053 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2018-06-22 02:09:13,053 INFO ]: Start minimizeSevpa. Operand 74 states.
[2018-06-22 02:09:13,069 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 66.
[2018-06-22 02:09:13,069 INFO ]: Start removeUnreachable. Operand 66 states.
[2018-06-22 02:09:13,070 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions.
[2018-06-22 02:09:13,070 INFO ]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 21
[2018-06-22 02:09:13,070 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:13,070 INFO ]: Abstraction has 66 states and 99 transitions.
[2018-06-22 02:09:13,070 INFO ]: Interpolant automaton has 5 states.
[2018-06-22 02:09:13,070 INFO ]: Start isEmpty. Operand 66 states and 99 transitions.
[2018-06-22 02:09:13,071 INFO ]: Finished isEmpty. Found accepting run of length 30
[2018-06-22 02:09:13,071 INFO ]: Found error trace
[2018-06-22 02:09:13,071 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:13,071 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:13,071 INFO ]: Analyzing trace with hash 385940401, now seen corresponding path program 1 times
[2018-06-22 02:09:13,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:13,071 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:13,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:13,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:13,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:13,112 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:13,549 INFO ]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-06-22 02:09:13,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 02:09:13,549 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 02:09:13,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:13,605 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:13,608 INFO ]: Computing forward predicates...
[2018-06-22 02:09:14,062 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 9
[2018-06-22 02:09:14,110 INFO ]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-06-22 02:09:14,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 02:09:14,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13
[2018-06-22 02:09:14,136 INFO ]: Interpolant automaton has 13 states
[2018-06-22 02:09:14,136 INFO ]: Constructing interpolant automaton starting with 13 interpolants.
[2018-06-22 02:09:14,136 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2018-06-22 02:09:14,136 INFO ]: Start difference. First operand 66 states and 99 transitions. Second operand 13 states.
[2018-06-22 02:09:14,570 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34
[2018-06-22 02:09:15,558 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:15,558 INFO ]: Finished difference Result 150 states and 296 transitions.
[2018-06-22 02:09:15,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2018-06-22 02:09:15,559 INFO ]: Start accepts. Automaton has 13 states. Word has length 29
[2018-06-22 02:09:15,559 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:15,562 INFO ]: With dead ends: 150
[2018-06-22 02:09:15,562 INFO ]: Without dead ends: 150
[2018-06-22 02:09:15,562 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506
[2018-06-22 02:09:15,563 INFO ]: Start minimizeSevpa. Operand 150 states.
[2018-06-22 02:09:15,582 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 84.
[2018-06-22 02:09:15,582 INFO ]: Start removeUnreachable. Operand 84 states.
[2018-06-22 02:09:15,583 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions.
[2018-06-22 02:09:15,583 INFO ]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 29
[2018-06-22 02:09:15,583 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:15,584 INFO ]: Abstraction has 84 states and 129 transitions.
[2018-06-22 02:09:15,584 INFO ]: Interpolant automaton has 13 states.
[2018-06-22 02:09:15,584 INFO ]: Start isEmpty. Operand 84 states and 129 transitions.
[2018-06-22 02:09:15,585 INFO ]: Finished isEmpty. Found accepting run of length 31
[2018-06-22 02:09:15,585 INFO ]: Found error trace
[2018-06-22 02:09:15,585 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:15,585 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:15,585 INFO ]: Analyzing trace with hash 1548166043, now seen corresponding path program 1 times
[2018-06-22 02:09:15,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:15,585 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:15,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:15,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:15,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:15,597 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:15,676 INFO ]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-06-22 02:09:15,676 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-06-22 02:09:15,676 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-06-22 02:09:15,677 INFO ]: Interpolant automaton has 5 states
[2018-06-22 02:09:15,677 INFO ]: Constructing interpolant automaton starting with 5 interpolants.
[2018-06-22 02:09:15,677 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-06-22 02:09:15,677 INFO ]: Start difference. First operand 84 states and 129 transitions. Second operand 5 states.
[2018-06-22 02:09:15,747 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:15,747 INFO ]: Finished difference Result 61 states and 99 transitions.
[2018-06-22 02:09:15,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-06-22 02:09:15,751 INFO ]: Start accepts. Automaton has 5 states. Word has length 30
[2018-06-22 02:09:15,751 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:15,752 INFO ]: With dead ends: 61
[2018-06-22 02:09:15,752 INFO ]: Without dead ends: 51
[2018-06-22 02:09:15,752 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-06-22 02:09:15,752 INFO ]: Start minimizeSevpa. Operand 51 states.
[2018-06-22 02:09:15,757 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47.
[2018-06-22 02:09:15,757 INFO ]: Start removeUnreachable. Operand 47 states.
[2018-06-22 02:09:15,757 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions.
[2018-06-22 02:09:15,758 INFO ]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 30
[2018-06-22 02:09:15,758 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:15,758 INFO ]: Abstraction has 47 states and 64 transitions.
[2018-06-22 02:09:15,758 INFO ]: Interpolant automaton has 5 states.
[2018-06-22 02:09:15,758 INFO ]: Start isEmpty. Operand 47 states and 64 transitions.
[2018-06-22 02:09:15,759 INFO ]: Finished isEmpty. Found accepting run of length 48
[2018-06-22 02:09:15,759 INFO ]: Found error trace
[2018-06-22 02:09:15,759 INFO ]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:15,759 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:15,759 INFO ]: Analyzing trace with hash 167934897, now seen corresponding path program 2 times
[2018-06-22 02:09:15,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:15,759 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:15,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:15,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY
[2018-06-22 02:09:15,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:15,794 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:16,045 INFO ]: Checked inductivity of 68 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2018-06-22 02:09:16,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 02:09:16,045 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 02:09:16,051 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-06-22 02:09:16,098 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-06-22 02:09:16,098 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:16,104 INFO ]: Computing forward predicates...
[2018-06-22 02:09:16,474 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 28
[2018-06-22 02:09:16,975 INFO ]: Checked inductivity of 68 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2018-06-22 02:09:16,996 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 02:09:16,996 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20
[2018-06-22 02:09:16,996 INFO ]: Interpolant automaton has 20 states
[2018-06-22 02:09:16,996 INFO ]: Constructing interpolant automaton starting with 20 interpolants.
[2018-06-22 02:09:16,996 INFO ]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380
[2018-06-22 02:09:16,997 INFO ]: Start difference. First operand 47 states and 64 transitions. Second operand 20 states.
[2018-06-22 02:09:17,401 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2018-06-22 02:09:17,966 WARN ]: Spent 230.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 15
[2018-06-22 02:09:18,141 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52
[2018-06-22 02:09:18,501 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:18,501 INFO ]: Finished difference Result 75 states and 118 transitions.
[2018-06-22 02:09:18,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2018-06-22 02:09:18,502 INFO ]: Start accepts. Automaton has 20 states. Word has length 47
[2018-06-22 02:09:18,502 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:18,503 INFO ]: With dead ends: 75
[2018-06-22 02:09:18,503 INFO ]: Without dead ends: 63
[2018-06-22 02:09:18,504 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992
[2018-06-22 02:09:18,504 INFO ]: Start minimizeSevpa. Operand 63 states.
[2018-06-22 02:09:18,507 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 59.
[2018-06-22 02:09:18,507 INFO ]: Start removeUnreachable. Operand 59 states.
[2018-06-22 02:09:18,508 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions.
[2018-06-22 02:09:18,508 INFO ]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 47
[2018-06-22 02:09:18,509 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:18,509 INFO ]: Abstraction has 59 states and 80 transitions.
[2018-06-22 02:09:18,509 INFO ]: Interpolant automaton has 20 states.
[2018-06-22 02:09:18,509 INFO ]: Start isEmpty. Operand 59 states and 80 transitions.
[2018-06-22 02:09:18,511 INFO ]: Finished isEmpty. Found accepting run of length 66
[2018-06-22 02:09:18,511 INFO ]: Found error trace
[2018-06-22 02:09:18,511 INFO ]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:18,511 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:18,511 INFO ]: Analyzing trace with hash -811336783, now seen corresponding path program 3 times
[2018-06-22 02:09:18,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:18,511 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:18,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:18,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 02:09:18,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:18,538 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:19,186 INFO ]: Checked inductivity of 155 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked.
[2018-06-22 02:09:19,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 02:09:19,186 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 02:09:19,201 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-06-22 02:09:19,244 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s)
[2018-06-22 02:09:19,244 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:19,250 INFO ]: Computing forward predicates...
[2018-06-22 02:09:21,247 INFO ]: Checked inductivity of 155 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2018-06-22 02:09:21,271 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 02:09:21,271 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31
[2018-06-22 02:09:21,271 INFO ]: Interpolant automaton has 31 states
[2018-06-22 02:09:21,271 INFO ]: Constructing interpolant automaton starting with 31 interpolants.
[2018-06-22 02:09:21,272 INFO ]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930
[2018-06-22 02:09:21,272 INFO ]: Start difference. First operand 59 states and 80 transitions. Second operand 31 states.
[2018-06-22 02:09:21,631 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 56
[2018-06-22 02:09:21,887 WARN ]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 182
[2018-06-22 02:09:22,430 WARN ]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 303
[2018-06-22 02:09:22,696 WARN ]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 164
[2018-06-22 02:09:23,078 WARN ]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 264
[2018-06-22 02:09:23,320 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 138
[2018-06-22 02:09:23,763 WARN ]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 212
[2018-06-22 02:09:24,097 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2018-06-22 02:09:24,389 WARN ]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 150
[2018-06-22 02:09:24,731 WARN ]: Spent 169.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 89
[2018-06-22 02:09:25,231 WARN ]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2018-06-22 02:09:25,347 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:25,347 INFO ]: Finished difference Result 82 states and 125 transitions.
[2018-06-22 02:09:25,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2018-06-22 02:09:25,347 INFO ]: Start accepts. Automaton has 31 states. Word has length 65
[2018-06-22 02:09:25,348 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:25,349 INFO ]: With dead ends: 82
[2018-06-22 02:09:25,349 INFO ]: Without dead ends: 72
[2018-06-22 02:09:25,350 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=325, Invalid=1837, Unknown=0, NotChecked=0, Total=2162
[2018-06-22 02:09:25,350 INFO ]: Start minimizeSevpa. Operand 72 states.
[2018-06-22 02:09:25,354 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 65.
[2018-06-22 02:09:25,354 INFO ]: Start removeUnreachable. Operand 65 states.
[2018-06-22 02:09:25,357 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions.
[2018-06-22 02:09:25,357 INFO ]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 65
[2018-06-22 02:09:25,358 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:25,358 INFO ]: Abstraction has 65 states and 88 transitions.
[2018-06-22 02:09:25,358 INFO ]: Interpolant automaton has 31 states.
[2018-06-22 02:09:25,358 INFO ]: Start isEmpty. Operand 65 states and 88 transitions.
[2018-06-22 02:09:25,361 INFO ]: Finished isEmpty. Found accepting run of length 75
[2018-06-22 02:09:25,361 INFO ]: Found error trace
[2018-06-22 02:09:25,362 INFO ]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:25,362 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:25,362 INFO ]: Analyzing trace with hash -1244223567, now seen corresponding path program 4 times
[2018-06-22 02:09:25,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:25,362 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:25,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:25,363 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 02:09:25,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:25,389 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:25,816 INFO ]: Checked inductivity of 212 backedges. 14 proven. 51 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked.
[2018-06-22 02:09:25,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more.
[2018-06-22 02:09:25,817 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 02:09:25,836 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-06-22 02:09:25,888 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-06-22 02:09:25,888 INFO ]: Conjunction of SSA is unsat
[2018-06-22 02:09:25,895 INFO ]: Computing forward predicates...
[2018-06-22 02:09:27,139 WARN ]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 70
[2018-06-22 02:09:27,625 INFO ]: Checked inductivity of 212 backedges. 14 proven. 51 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked.
[2018-06-22 02:09:27,655 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-06-22 02:09:27,655 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32
[2018-06-22 02:09:27,656 INFO ]: Interpolant automaton has 32 states
[2018-06-22 02:09:27,656 INFO ]: Constructing interpolant automaton starting with 32 interpolants.
[2018-06-22 02:09:27,656 INFO ]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992
[2018-06-22 02:09:27,656 INFO ]: Start difference. First operand 65 states and 88 transitions. Second operand 32 states.
[2018-06-22 02:09:27,883 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57
[2018-06-22 02:09:28,399 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89
[2018-06-22 02:09:28,816 WARN ]: Spent 168.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108
[2018-06-22 02:09:29,233 WARN ]: Spent 223.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122
[2018-06-22 02:09:29,490 WARN ]: Spent 208.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78
[2018-06-22 02:09:29,695 WARN ]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 121
[2018-06-22 02:09:29,898 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96
[2018-06-22 02:09:30,086 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 15
[2018-06-22 02:09:30,364 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78
[2018-06-22 02:09:30,613 INFO ]: Subtrahend was deterministic. Have not used determinization.
[2018-06-22 02:09:30,613 INFO ]: Finished difference Result 93 states and 126 transitions.
[2018-06-22 02:09:30,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2018-06-22 02:09:30,613 INFO ]: Start accepts. Automaton has 32 states. Word has length 74
[2018-06-22 02:09:30,614 INFO ]: Finished accepts. some prefix is accepted.
[2018-06-22 02:09:30,615 INFO ]: With dead ends: 93
[2018-06-22 02:09:30,615 INFO ]: Without dead ends: 81
[2018-06-22 02:09:30,616 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=309, Invalid=2043, Unknown=0, NotChecked=0, Total=2352
[2018-06-22 02:09:30,616 INFO ]: Start minimizeSevpa. Operand 81 states.
[2018-06-22 02:09:30,619 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 77.
[2018-06-22 02:09:30,619 INFO ]: Start removeUnreachable. Operand 77 states.
[2018-06-22 02:09:30,621 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions.
[2018-06-22 02:09:30,621 INFO ]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 74
[2018-06-22 02:09:30,621 INFO ]: Finished accepts. word is rejected.
[2018-06-22 02:09:30,621 INFO ]: Abstraction has 77 states and 104 transitions.
[2018-06-22 02:09:30,621 INFO ]: Interpolant automaton has 32 states.
[2018-06-22 02:09:30,621 INFO ]: Start isEmpty. Operand 77 states and 104 transitions.
[2018-06-22 02:09:30,624 INFO ]: Finished isEmpty. Found accepting run of length 93
[2018-06-22 02:09:30,624 INFO ]: Found error trace
[2018-06-22 02:09:30,624 INFO ]: trace histogram [10, 10, 10, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-06-22 02:09:30,624 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]===
[2018-06-22 02:09:30,625 INFO ]: Analyzing trace with hash -146462799, now seen corresponding path program 5 times
[2018-06-22 02:09:30,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-06-22 02:09:30,625 INFO ]: Using refinement strategy CamelRefinementStrategy
[2018-06-22 02:09:30,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:30,625 INFO ]: Changing assertion order to NOT_INCREMENTALLY
[2018-06-22 02:09:30,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-06-22 02:09:30,660 INFO ]: Conjunction of SSA is sat
[2018-06-22 02:09:30,663 INFO ]: Counterexample might be feasible
[2018-06-22 02:09:30,678 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:09:30 BoogieIcfgContainer
[2018-06-22 02:09:30,678 INFO ]: ------------------------ END TraceAbstraction----------------------------
[2018-06-22 02:09:30,679 INFO ]: Toolchain (without parser) took 21481.78 ms. Allocated memory was 304.6 MB in the beginning and 499.6 MB in the end (delta: 195.0 MB). Free memory was 259.1 MB in the beginning and 222.1 MB in the end (delta: 37.0 MB). Peak memory consumption was 232.0 MB. Max. memory is 3.6 GB.
[2018-06-22 02:09:30,679 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB.
[2018-06-22 02:09:30,680 INFO ]: ChcToBoogie took 62.29 ms. Allocated memory is still 304.6 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB.
[2018-06-22 02:09:30,680 INFO ]: Boogie Preprocessor took 56.79 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB.
[2018-06-22 02:09:30,680 INFO ]: RCFGBuilder took 502.98 ms. Allocated memory is still 304.6 MB. Free memory was 255.1 MB in the beginning and 243.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 3.6 GB.
[2018-06-22 02:09:30,681 INFO ]: TraceAbstraction took 20851.35 ms. Allocated memory was 304.6 MB in the beginning and 499.6 MB in the end (delta: 195.0 MB). Free memory was 243.0 MB in the beginning and 222.1 MB in the end (delta: 20.9 MB). Peak memory consumption was 215.9 MB. Max. memory is 3.6 GB.
[2018-06-22 02:09:30,685 INFO ]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.10 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB.
 * ChcToBoogie took 62.29 ms. Allocated memory is still 304.6 MB. Free memory was 259.1 MB in the beginning and 257.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB.
 * Boogie Preprocessor took 56.79 ms. Allocated memory is still 304.6 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB.
 * RCFGBuilder took 502.98 ms. Allocated memory is still 304.6 MB. Free memory was 255.1 MB in the beginning and 243.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 3.6 GB.
 * TraceAbstraction took 20851.35 ms. Allocated memory was 304.6 MB in the beginning and 499.6 MB in the end (delta: 195.0 MB). Free memory was 243.0 MB in the beginning and 222.1 MB in the end (delta: 20.9 MB). Peak memory consumption was 215.9 MB. Max. memory is 3.6 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [UNKNOWN] : assertion can be violated
    assertion can be violated
We found a FailurePath: 
[L0]  CALL        call gotoProc(0, 0, 0, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND FALSE  !(gotoSwitch == 3)
[L0]  COND FALSE  !(gotoSwitch == 2)
[L0]              assume ((!(hbv_False_2_Int <= 1) && !(hbv_False_1_Int <= 0)) && !(hbv_False_1_Int + hbv_False_3_Int == (if hbv_False_2_Int == 10 then 10 else hbv_False_2_Int + hbv_False_4_Int))) && hbv_False_1_Int == hbv_False_2_Int;
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hbv_False_1_Int - 1, hbv_False_2_Int - 1, hbv_False_3_Int, hbv_False_4_Int;
[L0]              havoc hbv_False_2_Int, hbv_False_3_Int, hbv_False_1_Int, hbv_False_4_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1);
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int;
[L0]              havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int;
[L0]              assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == hhv_INV_REC_f^f_1_Int) && hhv_INV_REC_f^f_1_Int <= 1;
[L0]  CALL        call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              gotoSwitch := gotoSwitch_in;
[L0]  COND FALSE  !(gotoSwitch == 4)
[L0]  COND TRUE   gotoSwitch == 3
[L0]              hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int;
[L0]              assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int;
[L0]  RET         call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0);
[L0]              hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int := hhv_INV_REC_f^f_0_Int - 1, hbv_INV_REC_f^f_1_Int;
[L0]              havoc hbv_INV_REC_f^f_1_Int;
[L0]              assume hhv_INV_REC_f__1_0_Int <= 0 && hhv_INV_REC_f__1_1_Int == hhv_INV_REC_f__1_0_Int;
[L0]              hhv_INV_REC_f__1_PRE_0_Int := hhv_INV_REC_f__1_0_Int;
[L0]              assume ((hbv_INV_REC_f__1_PRE_2_Int == hbv_INV_REC_f__1_PRE_1_Int && hhv_INV_REC_f__1_PRE_0_Int == hbv_INV_REC_f__1_PRE_2_Int - 1) && hbv_INV_REC_f__1_PRE_1_Int <= 1) && !(hbv_INV_REC_f__1_PRE_2_Int <= 0);
[L0]  RET         call gotoProc(0, 0, 0, 0, 0);
[L0]              assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 28 locations, 1 error locations. UNSAFE Result, 20.7s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 614 SDtfs, 433 SDslu, 2044 SDs, 0 SdLazy, 1485 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=7, 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 184 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 591 ConstructedInterpolants, 0 QuantifiedInterpolants, 339066 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 760/960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-09-30-702.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-09-30-702.csv
Received shutdown request...