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_No_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 15:50:55,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 15:50:55,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 15:50:55,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 15:50:55,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 15:50:55,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 15:50:55,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 15:50:55,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 15:50:55,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 15:50:55,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 15:50:55,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 15:50:55,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 15:50:55,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 15:50:55,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 15:50:55,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 15:50:55,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 15:50:55,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 15:50:55,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 15:50:55,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 15:50:55,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 15:50:55,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 15:50:55,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 15:50:55,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 15:50:55,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 15:50:55,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 15:50:55,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 15:50:55,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 15:50:55,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 15:50:55,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 15:50:55,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 15:50:55,964 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 15:50:55,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 15:50:55,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 15:50:55,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 15:50:55,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 15:50:55,966 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 15:50:55,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 15:50:55,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 15:50:55,988 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 15:50:55,988 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 15:50:55,989 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 15:50:55,989 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 15:50:55,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 15:50:55,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 15:50:55,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 15:50:55,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 15:50:55,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 15:50:55,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 15:50:55,991 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 15:50:55,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 15:50:55,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 15:50:55,992 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 15:50:55,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 15:50:55,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 15:50:55,992 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 15:50:55,995 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 15:50:55,995 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 15:50:56,047 INFO ]: Repository-Root is: /tmp [2018-06-22 15:50:56,065 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 15:50:56,068 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 15:50:56,070 INFO ]: Initializing SmtParser... [2018-06-22 15:50:56,070 INFO ]: SmtParser initialized [2018-06-22 15:50:56,070 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 [2018-06-22 15:50:56,072 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 15:50:56,161 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 unknown [2018-06-22 15:50:56,580 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters.smt2 [2018-06-22 15:50:56,584 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 15:50:56,589 INFO ]: Walking toolchain with 4 elements. [2018-06-22 15:50:56,589 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 15:50:56,589 INFO ]: Initializing ChcToBoogie... [2018-06-22 15:50:56,589 INFO ]: ChcToBoogie initialized [2018-06-22 15:50:56,593 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,643 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56 Unit [2018-06-22 15:50:56,643 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 15:50:56,644 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 15:50:56,644 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 15:50:56,644 INFO ]: Boogie Preprocessor initialized [2018-06-22 15:50:56,667 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,692 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,698 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,698 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,701 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,702 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,703 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (1/1) ... [2018-06-22 15:50:56,704 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 15:50:56,705 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 15:50:56,705 INFO ]: Initializing RCFGBuilder... [2018-06-22 15:50:56,705 INFO ]: RCFGBuilder initialized [2018-06-22 15:50:56,706 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (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 15:50:56,716 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 15:50:56,716 INFO ]: Found specification of procedure False [2018-06-22 15:50:56,716 INFO ]: Found implementation of procedure False Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 15:50:56,716 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-22 15:50:56,716 INFO ]: Found specification of procedure state [2018-06-22 15:50:56,716 INFO ]: Found implementation of procedure state [2018-06-22 15:50:56,716 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 15:50:56,716 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 15:50:56,716 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 15:50:56,892 INFO ]: Using library mode [2018-06-22 15:50:56,892 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:56 BoogieIcfgContainer [2018-06-22 15:50:56,892 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 15:50:56,894 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 15:50:56,894 INFO ]: Initializing TraceAbstraction... [2018-06-22 15:50:56,901 INFO ]: TraceAbstraction initialized [2018-06-22 15:50:56,901 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:56" (1/3) ... [2018-06-22 15:50:56,902 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70304ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 03:50:56, skipping insertion in model container [2018-06-22 15:50:56,902 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:56" (2/3) ... [2018-06-22 15:50:56,902 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70304ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:50:56, skipping insertion in model container [2018-06-22 15:50:56,902 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:56" (3/3) ... [2018-06-22 15:50:56,904 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 15:50:56,911 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 15:50:56,918 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 15:50:56,961 INFO ]: Using default assertion order modulation [2018-06-22 15:50:56,961 INFO ]: Interprodecural is true [2018-06-22 15:50:56,961 INFO ]: Hoare is false [2018-06-22 15:50:56,961 INFO ]: Compute interpolants for FPandBP [2018-06-22 15:50:56,961 INFO ]: Backedges is TWOTRACK [2018-06-22 15:50:56,961 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 15:50:56,961 INFO ]: Difference is false [2018-06-22 15:50:56,961 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 15:50:56,961 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 15:50:56,973 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 15:50:56,983 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 15:50:56,983 INFO ]: Found error trace [2018-06-22 15:50:56,984 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:56,984 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:56,988 INFO ]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times [2018-06-22 15:50:56,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:56,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:57,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:57,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:57,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:57,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:57,324 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 15:50:57,326 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 15:50:57,326 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 15:50:57,328 INFO ]: Interpolant automaton has 4 states [2018-06-22 15:50:57,339 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 15:50:57,340 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 15:50:57,341 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 15:50:57,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:57,430 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-22 15:50:57,431 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 15:50:57,432 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 15:50:57,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:57,442 INFO ]: With dead ends: 13 [2018-06-22 15:50:57,442 INFO ]: Without dead ends: 13 [2018-06-22 15:50:57,444 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 15:50:57,459 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 15:50:57,479 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 15:50:57,480 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 15:50:57,481 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 15:50:57,482 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-22 15:50:57,482 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:57,482 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 15:50:57,482 INFO ]: Interpolant automaton has 4 states. [2018-06-22 15:50:57,483 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 15:50:57,484 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 15:50:57,484 INFO ]: Found error trace [2018-06-22 15:50:57,484 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:57,484 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:57,484 INFO ]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times [2018-06-22 15:50:57,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:57,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:57,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:57,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:57,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:57,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:57,981 WARN ]: Spent 339.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-06-22 15:50:58,072 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 15:50:58,077 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:58,077 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 15:50:58,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:58,135 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:58,147 INFO ]: Computing forward predicates... [2018-06-22 15:50:59,173 WARN ]: Spent 518.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2018-06-22 15:50:59,359 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 15:50:59,383 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:59,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 15:50:59,384 INFO ]: Interpolant automaton has 9 states [2018-06-22 15:50:59,384 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 15:50:59,385 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 15:50:59,385 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-22 15:50:59,915 WARN ]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-22 15:51:00,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:00,085 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-22 15:51:00,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 15:51:00,086 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 15:51:00,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:00,087 INFO ]: With dead ends: 15 [2018-06-22 15:51:00,087 INFO ]: Without dead ends: 15 [2018-06-22 15:51:00,087 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 15:51:00,087 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 15:51:00,090 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 15:51:00,090 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 15:51:00,091 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 15:51:00,091 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 15:51:00,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:00,091 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 15:51:00,091 INFO ]: Interpolant automaton has 9 states. [2018-06-22 15:51:00,091 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 15:51:00,092 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 15:51:00,092 INFO ]: Found error trace [2018-06-22 15:51:00,092 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:00,092 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:00,092 INFO ]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times [2018-06-22 15:51:00,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:00,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:00,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:00,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:51:00,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:00,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:00,373 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 15:51:00,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:00,373 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 15:51:00,384 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 15:51:00,429 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 15:51:00,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:00,433 INFO ]: Computing forward predicates... [2018-06-22 15:51:01,224 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 15:51:01,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:01,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 15:51:01,253 INFO ]: Interpolant automaton has 12 states [2018-06-22 15:51:01,254 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 15:51:01,254 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 15:51:01,254 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-22 15:51:01,503 WARN ]: Spent 180.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-06-22 15:51:01,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:01,796 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-22 15:51:01,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 15:51:01,796 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 15:51:01,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:01,797 INFO ]: With dead ends: 17 [2018-06-22 15:51:01,797 INFO ]: Without dead ends: 17 [2018-06-22 15:51:01,798 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-22 15:51:01,798 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 15:51:01,800 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 15:51:01,801 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 15:51:01,801 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 15:51:01,801 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-22 15:51:01,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:01,801 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 15:51:01,801 INFO ]: Interpolant automaton has 12 states. [2018-06-22 15:51:01,801 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 15:51:01,802 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 15:51:01,802 INFO ]: Found error trace [2018-06-22 15:51:01,802 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:01,802 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:01,802 INFO ]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times [2018-06-22 15:51:01,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:01,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:01,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:01,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:51:01,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:01,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:02,075 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 15:51:02,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:02,075 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 15:51:02,093 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 15:51:02,133 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 15:51:02,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:02,137 INFO ]: Computing forward predicates... [2018-06-22 15:51:02,515 WARN ]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2018-06-22 15:51:02,895 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 15:51:02,915 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:02,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 15:51:02,915 INFO ]: Interpolant automaton has 16 states [2018-06-22 15:51:02,915 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 15:51:02,915 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 15:51:02,915 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-22 15:51:03,312 WARN ]: Spent 367.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-06-22 15:51:03,587 WARN ]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2018-06-22 15:51:03,923 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-06-22 15:51:04,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:04,031 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 15:51:04,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 15:51:04,034 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 15:51:04,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:04,035 INFO ]: With dead ends: 19 [2018-06-22 15:51:04,035 INFO ]: Without dead ends: 19 [2018-06-22 15:51:04,035 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-06-22 15:51:04,036 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 15:51:04,039 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 15:51:04,039 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 15:51:04,039 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 15:51:04,039 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-22 15:51:04,039 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:04,040 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 15:51:04,040 INFO ]: Interpolant automaton has 16 states. [2018-06-22 15:51:04,040 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 15:51:04,042 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 15:51:04,042 INFO ]: Found error trace [2018-06-22 15:51:04,042 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:04,042 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:04,042 INFO ]: Analyzing trace with hash -434924750, now seen corresponding path program 4 times [2018-06-22 15:51:04,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:04,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:04,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:04,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:51:04,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:04,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:04,388 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-06-22 15:51:04,521 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 15:51:04,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:04,521 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 15:51:04,527 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 15:51:04,561 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 15:51:04,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:04,564 INFO ]: Computing forward predicates... [2018-06-22 15:51:05,165 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-06-22 15:51:05,326 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 15:51:05,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:05,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 15:51:05,346 INFO ]: Interpolant automaton has 20 states [2018-06-22 15:51:05,346 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 15:51:05,346 INFO ]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-06-22 15:51:05,346 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-22 15:51:05,667 WARN ]: Spent 293.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2018-06-22 15:51:05,842 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 39 [2018-06-22 15:51:06,111 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 40 [2018-06-22 15:51:06,368 WARN ]: Spent 232.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2018-06-22 15:51:06,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:06,410 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 15:51:06,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 15:51:06,410 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 15:51:06,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:06,411 INFO ]: With dead ends: 21 [2018-06-22 15:51:06,411 INFO ]: Without dead ends: 21 [2018-06-22 15:51:06,411 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-06-22 15:51:06,411 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 15:51:06,414 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 15:51:06,414 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 15:51:06,415 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 15:51:06,415 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-22 15:51:06,415 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:06,415 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 15:51:06,415 INFO ]: Interpolant automaton has 20 states. [2018-06-22 15:51:06,415 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 15:51:06,416 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 15:51:06,416 INFO ]: Found error trace [2018-06-22 15:51:06,416 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:06,416 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:06,416 INFO ]: Analyzing trace with hash 1986427350, now seen corresponding path program 5 times [2018-06-22 15:51:06,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:06,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:06,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:06,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:51:06,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:06,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:06,949 WARN ]: Spent 238.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-06-22 15:51:07,451 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 15:51:07,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:07,451 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 15:51:07,464 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 15:51:07,515 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 15:51:07,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:07,520 INFO ]: Computing forward predicates... [2018-06-22 15:51:08,139 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-06-22 15:51:10,162 WARN ]: Spent 551.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-06-22 15:51:11,325 WARN ]: Spent 841.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-06-22 15:51:11,691 INFO ]: Checked inductivity of 55 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 15:51:11,711 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:11,711 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-22 15:51:11,711 INFO ]: Interpolant automaton has 25 states [2018-06-22 15:51:11,711 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 15:51:11,712 INFO ]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-06-22 15:51:11,712 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 25 states. [2018-06-22 15:51:13,210 WARN ]: Spent 1.41 s on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2018-06-22 15:51:13,816 WARN ]: Spent 393.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 51 [2018-06-22 15:51:14,153 WARN ]: Spent 280.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 52 [2018-06-22 15:51:14,587 WARN ]: Spent 266.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 41 [2018-06-22 15:51:14,853 WARN ]: Spent 208.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 40 [2018-06-22 15:51:15,315 WARN ]: Spent 359.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 52 [2018-06-22 15:51:16,538 WARN ]: Spent 1.07 s on a formula simplification. DAG size of input: 170 DAG size of output: 121 [2018-06-22 15:51:16,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:16,614 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-22 15:51:16,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 15:51:16,614 INFO ]: Start accepts. Automaton has 25 states. Word has length 29 [2018-06-22 15:51:16,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:16,615 INFO ]: With dead ends: 25 [2018-06-22 15:51:16,615 INFO ]: Without dead ends: 25 [2018-06-22 15:51:16,616 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 15:51:16,616 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 15:51:16,619 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 15:51:16,619 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 15:51:16,620 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 15:51:16,620 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 29 [2018-06-22 15:51:16,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:16,621 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 15:51:16,621 INFO ]: Interpolant automaton has 25 states. [2018-06-22 15:51:16,621 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 15:51:16,621 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 15:51:16,622 INFO ]: Found error trace [2018-06-22 15:51:16,622 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:16,622 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:16,622 INFO ]: Analyzing trace with hash -411423458, now seen corresponding path program 6 times [2018-06-22 15:51:16,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:16,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:16,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:16,623 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:51:16,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:16,660 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:17,284 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 15:51:17,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:17,284 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) [2018-06-22 15:51:17,300 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 15:51:17,377 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 15:51:17,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:17,382 INFO ]: Computing forward predicates... [2018-06-22 15:51:18,176 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-06-22 15:51:18,605 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-06-22 15:51:19,040 WARN ]: Spent 208.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-06-22 15:51:19,502 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 15:51:19,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:19,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-22 15:51:19,561 INFO ]: Interpolant automaton has 33 states [2018-06-22 15:51:19,561 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 15:51:19,563 INFO ]: CoverageRelationStatistics Valid=68, Invalid=988, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 15:51:19,563 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 33 states. [2018-06-22 15:51:20,474 WARN ]: Spent 823.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 109 [2018-06-22 15:51:20,829 WARN ]: Spent 233.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 51 [2018-06-22 15:51:21,093 WARN ]: Spent 210.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 45 [2018-06-22 15:51:21,400 WARN ]: Spent 225.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 48 [2018-06-22 15:51:21,754 WARN ]: Spent 297.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 73 [2018-06-22 15:51:22,177 WARN ]: Spent 333.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 81 [2018-06-22 15:51:22,585 WARN ]: Spent 324.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 72 [2018-06-22 15:51:23,394 WARN ]: Spent 731.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 96 [2018-06-22 15:51:23,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:23,460 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-22 15:51:23,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 15:51:23,460 INFO ]: Start accepts. Automaton has 33 states. Word has length 37 [2018-06-22 15:51:23,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:23,461 INFO ]: With dead ends: 27 [2018-06-22 15:51:23,461 INFO ]: Without dead ends: 27 [2018-06-22 15:51:23,462 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 15:51:23,462 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 15:51:23,465 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 15:51:23,465 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 15:51:23,466 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 15:51:23,466 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-22 15:51:23,466 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:23,466 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 15:51:23,466 INFO ]: Interpolant automaton has 33 states. [2018-06-22 15:51:23,466 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 15:51:23,467 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 15:51:23,467 INFO ]: Found error trace [2018-06-22 15:51:23,467 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:23,467 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:23,468 INFO ]: Analyzing trace with hash -544278078, now seen corresponding path program 7 times [2018-06-22 15:51:23,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:23,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:23,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:23,468 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:51:23,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:23,514 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:24,685 WARN ]: Spent 968.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-06-22 15:51:25,057 WARN ]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 15:51:25,590 INFO ]: Checked inductivity of 136 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 15:51:25,591 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:25,591 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 15:51:25,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:51:25,651 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:25,657 INFO ]: Computing forward predicates... [2018-06-22 15:51:26,287 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-06-22 15:51:26,490 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-22 15:51:27,100 INFO ]: Checked inductivity of 136 backedges. 2 proven. 96 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 15:51:27,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:27,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-06-22 15:51:27,119 INFO ]: Interpolant automaton has 35 states [2018-06-22 15:51:27,119 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 15:51:27,120 INFO ]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 15:51:27,120 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 35 states. [2018-06-22 15:51:27,344 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-06-22 15:51:27,634 WARN ]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2018-06-22 15:51:27,766 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2018-06-22 15:51:28,015 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-06-22 15:51:28,415 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2018-06-22 15:51:28,579 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-06-22 15:51:28,749 WARN ]: Spent 129.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2018-06-22 15:51:28,941 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2018-06-22 15:51:28,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:28,980 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-22 15:51:28,980 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 15:51:28,980 INFO ]: Start accepts. Automaton has 35 states. Word has length 41 [2018-06-22 15:51:28,980 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:28,981 INFO ]: With dead ends: 29 [2018-06-22 15:51:28,981 INFO ]: Without dead ends: 29 [2018-06-22 15:51:28,982 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=284, Invalid=1696, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 15:51:28,982 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 15:51:28,985 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 15:51:28,985 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 15:51:28,986 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 15:51:28,986 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-22 15:51:28,986 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:28,986 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 15:51:28,986 INFO ]: Interpolant automaton has 35 states. [2018-06-22 15:51:28,986 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 15:51:28,987 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 15:51:28,987 INFO ]: Found error trace [2018-06-22 15:51:28,987 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:28,987 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:28,987 INFO ]: Analyzing trace with hash 1442343014, now seen corresponding path program 8 times [2018-06-22 15:51:28,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:28,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:28,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:28,988 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:51:28,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:29,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:30,342 WARN ]: Spent 233.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 15:51:30,716 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 15:51:30,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:51:30,716 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 15:51:30,722 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 15:51:30,781 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 15:51:30,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:51:30,793 INFO ]: Computing forward predicates... [2018-06-22 15:51:32,365 WARN ]: Spent 480.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-06-22 15:51:32,541 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-06-22 15:51:32,925 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-06-22 15:51:33,330 WARN ]: Spent 290.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-06-22 15:51:33,811 WARN ]: Spent 363.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-06-22 15:51:34,488 WARN ]: Spent 527.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-06-22 15:51:35,381 INFO ]: Checked inductivity of 171 backedges. 1 proven. 125 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 15:51:35,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:51:35,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-06-22 15:51:35,402 INFO ]: Interpolant automaton has 41 states [2018-06-22 15:51:35,402 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 15:51:35,402 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 15:51:35,403 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-06-22 15:51:35,974 WARN ]: Spent 435.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 100 [2018-06-22 15:51:36,347 WARN ]: Spent 212.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 48 [2018-06-22 15:51:36,631 WARN ]: Spent 212.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 42 [2018-06-22 15:51:36,956 WARN ]: Spent 244.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 46 [2018-06-22 15:51:37,290 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 43 [2018-06-22 15:51:37,611 WARN ]: Spent 217.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 52 [2018-06-22 15:51:37,940 WARN ]: Spent 257.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 51 [2018-06-22 15:51:38,272 WARN ]: Spent 250.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 52 [2018-06-22 15:51:38,659 WARN ]: Spent 302.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 51 [2018-06-22 15:51:39,292 WARN ]: Spent 535.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 92 [2018-06-22 15:51:39,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:51:39,357 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-22 15:51:39,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 15:51:39,361 INFO ]: Start accepts. Automaton has 41 states. Word has length 45 [2018-06-22 15:51:39,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:51:39,362 INFO ]: With dead ends: 31 [2018-06-22 15:51:39,362 INFO ]: Without dead ends: 31 [2018-06-22 15:51:39,364 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=343, Invalid=2309, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 15:51:39,364 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 15:51:39,368 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 15:51:39,368 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 15:51:39,368 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 15:51:39,368 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-22 15:51:39,373 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:51:39,373 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 15:51:39,373 INFO ]: Interpolant automaton has 41 states. [2018-06-22 15:51:39,373 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 15:51:39,375 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 15:51:39,375 INFO ]: Found error trace [2018-06-22 15:51:39,375 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:51:39,375 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:51:39,375 INFO ]: Analyzing trace with hash 352352522, now seen corresponding path program 9 times [2018-06-22 15:51:39,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:51:39,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:51:39,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:39,376 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:51:39,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:51:39,410 INFO ]: Conjunction of SSA is sat [2018-06-22 15:51:39,414 INFO ]: Counterexample might be feasible [2018-06-22 15:51:39,438 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:39 BoogieIcfgContainer [2018-06-22 15:51:39,438 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 15:51:39,439 INFO ]: Toolchain (without parser) took 42854.95 ms. Allocated memory was 303.6 MB in the beginning and 708.3 MB in the end (delta: 404.8 MB). Free memory was 256.1 MB in the beginning and 592.5 MB in the end (delta: -336.4 MB). Peak memory consumption was 68.3 MB. Max. memory is 3.6 GB. [2018-06-22 15:51:39,440 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 15:51:39,440 INFO ]: ChcToBoogie took 54.11 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 254.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 15:51:39,441 INFO ]: Boogie Preprocessor took 60.78 ms. Allocated memory is still 303.6 MB. Free memory is still 254.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 15:51:39,441 INFO ]: RCFGBuilder took 187.54 ms. Allocated memory is still 303.6 MB. Free memory was 254.1 MB in the beginning and 244.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 15:51:39,441 INFO ]: TraceAbstraction took 42544.86 ms. Allocated memory was 303.6 MB in the beginning and 708.3 MB in the end (delta: 404.8 MB). Free memory was 242.2 MB in the beginning and 592.5 MB in the end (delta: -350.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 3.6 GB. [2018-06-22 15:51:39,447 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.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 54.11 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 254.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 60.78 ms. Allocated memory is still 303.6 MB. Free memory is still 254.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 187.54 ms. Allocated memory is still 303.6 MB. Free memory was 254.1 MB in the beginning and 244.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 42544.86 ms. Allocated memory was 303.6 MB in the beginning and 708.3 MB in the end (delta: 404.8 MB). Free memory was 242.2 MB in the beginning and 592.5 MB in the end (delta: -350.4 MB). Peak memory consumption was 54.4 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 False(); [L0] assume !hbv_False_1_Bool; [L0] CALL call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool)) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((hbv_state_7_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_7_Bool))) && !((hbv_state_5_Bool || hbv_state_6_Bool) && (!hbv_state_5_Bool || !hbv_state_6_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_7_Bool || hbv_state_4_Bool) && ((hbv_state_7_Bool || hbv_state_3_Bool) || !hbv_state_4_Bool)) || !hhv_state_1_Bool) && ((hhv_state_1_Bool || (hbv_state_7_Bool && !hbv_state_4_Bool)) || ((!hbv_state_3_Bool && hbv_state_4_Bool) && !hbv_state_7_Bool)))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_6_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_6_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_6_Bool) && (!hbv_state_9_Bool || !hbv_state_6_Bool))))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !((((hbv_state_7_Bool && hbv_state_4_Bool) || (hbv_state_3_Bool && !hbv_state_4_Bool)) || hhv_state_0_Bool) && (((!hbv_state_4_Bool || !hbv_state_7_Bool) && (!hbv_state_3_Bool || hbv_state_4_Bool)) || !hhv_state_0_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume (((((((((((!hhv_state_2_Bool && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_5_Bool))) && !((hhv_state_4_Bool || hhv_state_0_Bool) && (!hhv_state_4_Bool || !hhv_state_0_Bool))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || (hhv_state_4_Bool && hhv_state_6_Bool)) && ((!hhv_state_4_Bool || !hhv_state_7_Bool) || !hhv_state_6_Bool))) && hhv_state_3_Int == hhv_state_8_Int) && !((!(hhv_state_8_Int == 5) || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_8_Int == 5))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_7_Bool || !hhv_state_10_Bool))) && hhv_state_3_Int == 0) && !((((!hhv_state_11_Bool && !hhv_state_10_Bool) || hhv_state_12_Bool) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((hhv_state_11_Bool || hhv_state_10_Bool) && (!hhv_state_11_Bool || !hhv_state_10_Bool))))) && !hhv_state_1_Bool) && !((hhv_state_2_Bool || hhv_state_6_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && !((!hhv_state_11_Bool || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_11_Bool)); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 42.4s OverallTime, 10 OverallIterations, 11 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 563 SDslu, 1227 SDs, 0 SdLazy, 1080 SolverSat, 666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 154 SyntacticMatches, 3 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=9, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 298848 SizeOfPredicates, 373 NumberOfNonLiveVariables, 2279 ConjunctsInSsa, 618 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 295/1074 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/_6counters.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_15-51-39-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_15-51-39-457.csv Received shutdown request...