java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:51:38,697 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:51:38,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:51:38,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:51:38,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:51:38,730 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:51:38,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:51:38,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:51:38,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:51:38,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:51:38,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:51:38,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:51:38,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:51:38,767 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:51:38,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:51:38,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:51:38,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:51:38,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:51:38,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:51:38,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:51:38,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:51:38,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:51:38,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:51:38,806 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:51:38,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:51:38,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:51:38,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:51:38,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:51:38,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:51:38,818 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:51:38,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:51:38,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:51:38,819 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:51:38,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:51:38,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:51:38,829 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:51:38,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:51:38,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:51:38,870 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:51:38,870 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:51:38,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:51:38,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:51:38,878 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:51:38,878 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:51:38,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:51:38,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:51:38,879 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:51:38,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:51:38,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:51:38,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:51:38,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:51:38,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:51:38,880 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:51:38,882 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:51:38,883 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:51:38,974 INFO ]: Repository-Root is: /tmp [2018-06-18 13:51:39,006 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:51:39,020 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:51:39,022 INFO ]: Initializing SmtParser... [2018-06-18 13:51:39,022 INFO ]: SmtParser initialized [2018-06-18 13:51:39,022 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 [2018-06-18 13:51:39,024 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-18 13:51:39,265 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 unknown [2018-06-18 13:51:39,660 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 [2018-06-18 13:51:39,674 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:51:39,679 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:51:39,687 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:51:39,687 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:51:39,687 INFO ]: ChcToBoogie initialized [2018-06-18 13:51:39,695 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,789 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39 Unit [2018-06-18 13:51:39,799 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:51:39,800 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:51:39,800 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:51:39,800 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:51:39,844 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,844 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,853 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,853 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,857 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,858 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,866 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (1/1) ... [2018-06-18 13:51:39,868 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:51:39,869 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:51:39,869 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:51:39,869 INFO ]: RCFGBuilder initialized [2018-06-18 13:51:39,870 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:51:39,894 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:51:39,894 INFO ]: Found specification of procedure False [2018-06-18 13:51:39,894 INFO ]: Found implementation of procedure False [2018-06-18 13:51:39,894 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:51:39,894 INFO ]: Found specification of procedure state [2018-06-18 13:51:39,894 INFO ]: Found implementation of procedure state [2018-06-18 13:51:39,894 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:51:39,894 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:51:39,894 INFO ]: Found implementation of procedure Ultimate.START [2018-06-18 13:51:40,267 INFO ]: Using library mode [2018-06-18 13:51:40,268 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:51:40 BoogieIcfgContainer [2018-06-18 13:51:40,268 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:51:40,269 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:51:40,269 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:51:40,276 INFO ]: TraceAbstraction initialized [2018-06-18 13:51:40,276 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:51:39" (1/3) ... [2018-06-18 13:51:40,282 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eadcfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:51:40, skipping insertion in model container [2018-06-18 13:51:40,282 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:51:39" (2/3) ... [2018-06-18 13:51:40,282 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eadcfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:51:40, skipping insertion in model container [2018-06-18 13:51:40,282 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:51:40" (3/3) ... [2018-06-18 13:51:40,284 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:51:40,303 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:51:40,322 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:51:40,405 INFO ]: Using default assertion order modulation [2018-06-18 13:51:40,406 INFO ]: Interprodecural is true [2018-06-18 13:51:40,406 INFO ]: Hoare is false [2018-06-18 13:51:40,406 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:51:40,406 INFO ]: Backedges is TWOTRACK [2018-06-18 13:51:40,406 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:51:40,406 INFO ]: Difference is false [2018-06-18 13:51:40,406 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:51:40,406 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:51:40,426 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:51:40,449 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:51:40,449 INFO ]: Found error trace [2018-06-18 13:51:40,450 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:51:40,450 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:51:40,457 INFO ]: Analyzing trace with hash -597537630, now seen corresponding path program 1 times [2018-06-18 13:51:40,459 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:51:40,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:51:40,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:40,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:51:40,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:40,565 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:40,576 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:51:40,690 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 13:51:40,692 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:51:40,712 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:51:40,714 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:51:40,729 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:51:40,730 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:51:40,732 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:51:40,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:51:40,828 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:51:40,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:51:40,830 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:51:40,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:51:40,841 INFO ]: With dead ends: 13 [2018-06-18 13:51:40,841 INFO ]: Without dead ends: 13 [2018-06-18 13:51:40,843 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:51:40,861 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:51:40,885 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:51:40,886 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:51:40,887 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:51:40,888 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:51:40,888 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:51:40,888 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:51:40,888 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:51:40,888 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:51:40,889 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:51:40,890 INFO ]: Found error trace [2018-06-18 13:51:40,890 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:51:40,890 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:51:40,890 INFO ]: Analyzing trace with hash 1530833734, now seen corresponding path program 1 times [2018-06-18 13:51:40,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:51:40,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:51:40,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:40,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:51:40,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:40,925 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:40,933 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:51:41,111 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:51:41,111 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:51:41,111 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-18 13:51:41,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:51:41,168 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:41,176 INFO ]: Computing forward predicates... [2018-06-18 13:51:41,714 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-18 13:51:41,972 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:51:42,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:51:42,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-18 13:51:42,007 INFO ]: Interpolant automaton has 9 states [2018-06-18 13:51:42,007 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-18 13:51:42,007 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-18 13:51:42,007 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-18 13:51:42,319 WARN ]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-18 13:51:42,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:51:42,378 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:51:42,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:51:42,379 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-18 13:51:42,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:51:42,380 INFO ]: With dead ends: 15 [2018-06-18 13:51:42,380 INFO ]: Without dead ends: 15 [2018-06-18 13:51:42,381 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-18 13:51:42,381 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:51:42,384 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:51:42,384 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:51:42,385 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:51:42,385 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:51:42,385 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:51:42,385 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:51:42,385 INFO ]: Interpolant automaton has 9 states. [2018-06-18 13:51:42,385 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:51:42,385 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:51:42,385 INFO ]: Found error trace [2018-06-18 13:51:42,386 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:51:42,386 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:51:42,386 INFO ]: Analyzing trace with hash -1486246934, now seen corresponding path program 2 times [2018-06-18 13:51:42,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:51:42,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:51:42,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:42,387 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:51:42,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:42,413 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:42,414 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:51:42,804 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:51:42,804 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:51:42,804 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-18 13:51:42,813 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:51:42,840 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:51:42,840 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:42,842 INFO ]: Computing forward predicates... [2018-06-18 13:51:43,158 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 4 [2018-06-18 13:51:43,338 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:51:43,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:51:43,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-18 13:51:43,359 INFO ]: Interpolant automaton has 12 states [2018-06-18 13:51:43,359 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 13:51:43,360 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-18 13:51:43,360 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-18 13:51:44,045 WARN ]: Spent 492.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-06-18 13:51:44,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:51:44,059 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:51:44,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:51:44,059 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 13:51:44,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:51:44,060 INFO ]: With dead ends: 17 [2018-06-18 13:51:44,060 INFO ]: Without dead ends: 17 [2018-06-18 13:51:44,061 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-06-18 13:51:44,061 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:51:44,064 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:51:44,064 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:51:44,064 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:51:44,064 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:51:44,065 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:51:44,065 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:51:44,065 INFO ]: Interpolant automaton has 12 states. [2018-06-18 13:51:44,065 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:51:44,065 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:51:44,065 INFO ]: Found error trace [2018-06-18 13:51:44,065 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:51:44,066 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:51:44,066 INFO ]: Analyzing trace with hash -2056434034, now seen corresponding path program 3 times [2018-06-18 13:51:44,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:51:44,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:51:44,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:44,067 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:51:44,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:44,086 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:44,087 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:51:44,330 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:51:44,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:51:44,330 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-18 13:51:44,343 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:51:44,385 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:51:44,385 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:51:44,388 INFO ]: Computing forward predicates... [2018-06-18 13:51:44,881 WARN ]: Spent 151.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-06-18 13:51:44,954 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:51:44,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:51:44,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-18 13:51:44,978 INFO ]: Interpolant automaton has 16 states [2018-06-18 13:51:44,978 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-18 13:51:44,978 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-18 13:51:44,978 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-18 13:51:45,157 WARN ]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-06-18 13:51:45,495 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-18 13:51:45,889 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-06-18 13:51:45,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:51:45,934 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 13:51:45,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:51:45,935 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-18 13:51:45,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:51:45,936 INFO ]: With dead ends: 23 [2018-06-18 13:51:45,936 INFO ]: Without dead ends: 23 [2018-06-18 13:51:45,937 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-06-18 13:51:45,937 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 13:51:45,941 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-18 13:51:45,941 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:51:45,942 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:51:45,942 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 21 [2018-06-18 13:51:45,942 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:51:45,942 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:51:45,942 INFO ]: Interpolant automaton has 16 states. [2018-06-18 13:51:45,942 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:51:45,943 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:51:45,943 INFO ]: Found error trace [2018-06-18 13:51:45,943 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:51:45,943 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:51:45,943 INFO ]: Analyzing trace with hash 1986427350, now seen corresponding path program 4 times [2018-06-18 13:51:45,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:51:45,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:51:45,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:45,944 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:51:45,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:51:45,964 INFO ]: Conjunction of SSA is sat [2018-06-18 13:51:45,971 INFO ]: Counterexample might be feasible [2018-06-18 13:51:45,987 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:51:45 BoogieIcfgContainer [2018-06-18 13:51:45,987 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:51:45,991 INFO ]: Toolchain (without parser) took 6316.39 ms. Allocated memory was 304.1 MB in the beginning and 337.6 MB in the end (delta: 33.6 MB). Free memory was 260.5 MB in the beginning and 200.3 MB in the end (delta: 60.1 MB). Peak memory consumption was 93.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:51:45,992 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:51:45,992 INFO ]: ChcToBoogie took 112.20 ms. Allocated memory is still 304.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:51:45,993 INFO ]: Boogie Preprocessor took 68.27 ms. Allocated memory is still 304.1 MB. Free memory was 257.5 MB in the beginning and 256.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-18 13:51:45,993 INFO ]: RCFGBuilder took 399.31 ms. Allocated memory is still 304.1 MB. Free memory was 256.5 MB in the beginning and 248.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:51:45,994 INFO ]: TraceAbstraction took 5717.83 ms. Allocated memory was 304.1 MB in the beginning and 337.6 MB in the end (delta: 33.6 MB). Free memory was 248.5 MB in the beginning and 200.3 MB in the end (delta: 48.1 MB). Peak memory consumption was 81.7 MB. Max. memory is 3.6 GB. [2018-06-18 13:51:45,997 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 112.20 ms. Allocated memory is still 304.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 68.27 ms. Allocated memory is still 304.1 MB. Free memory was 257.5 MB in the beginning and 256.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 399.31 ms. Allocated memory is still 304.1 MB. Free memory was 256.5 MB in the beginning and 248.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5717.83 ms. Allocated memory was 304.1 MB in the beginning and 337.6 MB in the end (delta: 33.6 MB). Free memory was 248.5 MB in the beginning and 200.3 MB in the end (delta: 48.1 MB). Peak memory consumption was 81.7 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_Bool, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_1_Bool, hbv_False_8_Bool); [L0] assume (((((((((!((hhv_state_2_Bool || hhv_state_5_Bool) && (!hhv_state_5_Bool || !hhv_state_2_Bool)) && !(((hbv_state_2_Bool && hbv_state_3_Bool) || !hbv_state_5_Bool) && ((!hbv_state_3_Bool || hbv_state_5_Bool) || !hbv_state_2_Bool))) && !(((!hhv_state_5_Bool || !hhv_state_3_Bool) || hhv_state_6_Bool) && (!hhv_state_6_Bool || (hhv_state_5_Bool && hhv_state_3_Bool)))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_6_Bool) && (!hbv_state_3_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || (hbv_state_2_Bool && hbv_state_6_Bool)))) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !((!hbv_state_7_Bool || !hbv_state_6_Bool) && (hbv_state_7_Bool || hbv_state_6_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_6_Bool)) || ((!hbv_state_3_Bool && hbv_state_2_Bool) && !hbv_state_6_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_3_Bool) || hbv_state_6_Bool) && (hbv_state_2_Bool || !hbv_state_6_Bool))))) && !((hhv_state_3_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_3_Bool))) && !((hhv_state_4_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_4_Bool))) && !((!hbv_state_3_Bool || !hbv_state_4_Bool) && (hbv_state_4_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool)); [L0] CALL call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] assume (((((((((!((hhv_state_2_Bool || hhv_state_5_Bool) && (!hhv_state_5_Bool || !hhv_state_2_Bool)) && !(((hbv_state_2_Bool && hbv_state_3_Bool) || !hbv_state_5_Bool) && ((!hbv_state_3_Bool || hbv_state_5_Bool) || !hbv_state_2_Bool))) && !(((!hhv_state_5_Bool || !hhv_state_3_Bool) || hhv_state_6_Bool) && (!hhv_state_6_Bool || (hhv_state_5_Bool && hhv_state_3_Bool)))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_6_Bool) && (!hbv_state_3_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || (hbv_state_2_Bool && hbv_state_6_Bool)))) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !((!hbv_state_7_Bool || !hbv_state_6_Bool) && (hbv_state_7_Bool || hbv_state_6_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_6_Bool)) || ((!hbv_state_3_Bool && hbv_state_2_Bool) && !hbv_state_6_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_3_Bool) || hbv_state_6_Bool) && (hbv_state_2_Bool || !hbv_state_6_Bool))))) && !((hhv_state_3_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_3_Bool))) && !((hhv_state_4_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_4_Bool))) && !((!hbv_state_3_Bool || !hbv_state_4_Bool) && (hbv_state_4_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool)); [L0] CALL call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] assume (((((((((!((hhv_state_2_Bool || hhv_state_5_Bool) && (!hhv_state_5_Bool || !hhv_state_2_Bool)) && !(((hbv_state_2_Bool && hbv_state_3_Bool) || !hbv_state_5_Bool) && ((!hbv_state_3_Bool || hbv_state_5_Bool) || !hbv_state_2_Bool))) && !(((!hhv_state_5_Bool || !hhv_state_3_Bool) || hhv_state_6_Bool) && (!hhv_state_6_Bool || (hhv_state_5_Bool && hhv_state_3_Bool)))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_6_Bool) && (!hbv_state_3_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || (hbv_state_2_Bool && hbv_state_6_Bool)))) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !((!hbv_state_7_Bool || !hbv_state_6_Bool) && (hbv_state_7_Bool || hbv_state_6_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_6_Bool)) || ((!hbv_state_3_Bool && hbv_state_2_Bool) && !hbv_state_6_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_3_Bool) || hbv_state_6_Bool) && (hbv_state_2_Bool || !hbv_state_6_Bool))))) && !((hhv_state_3_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_3_Bool))) && !((hhv_state_4_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_4_Bool))) && !((!hbv_state_3_Bool || !hbv_state_4_Bool) && (hbv_state_4_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool)); [L0] CALL call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] assume (((((((((!((hhv_state_2_Bool || hhv_state_5_Bool) && (!hhv_state_5_Bool || !hhv_state_2_Bool)) && !(((hbv_state_2_Bool && hbv_state_3_Bool) || !hbv_state_5_Bool) && ((!hbv_state_3_Bool || hbv_state_5_Bool) || !hbv_state_2_Bool))) && !(((!hhv_state_5_Bool || !hhv_state_3_Bool) || hhv_state_6_Bool) && (!hhv_state_6_Bool || (hhv_state_5_Bool && hhv_state_3_Bool)))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_6_Bool) && (!hbv_state_3_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || (hbv_state_2_Bool && hbv_state_6_Bool)))) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !((!hbv_state_7_Bool || !hbv_state_6_Bool) && (hbv_state_7_Bool || hbv_state_6_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_6_Bool)) || ((!hbv_state_3_Bool && hbv_state_2_Bool) && !hbv_state_6_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_3_Bool) || hbv_state_6_Bool) && (hbv_state_2_Bool || !hbv_state_6_Bool))))) && !((hhv_state_3_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_3_Bool))) && !((hhv_state_4_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_4_Bool))) && !((!hbv_state_3_Bool || !hbv_state_4_Bool) && (hbv_state_4_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool)); [L0] CALL call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] assume (((((((((!((hhv_state_2_Bool || hhv_state_5_Bool) && (!hhv_state_5_Bool || !hhv_state_2_Bool)) && !(((hbv_state_2_Bool && hbv_state_3_Bool) || !hbv_state_5_Bool) && ((!hbv_state_3_Bool || hbv_state_5_Bool) || !hbv_state_2_Bool))) && !(((!hhv_state_5_Bool || !hhv_state_3_Bool) || hhv_state_6_Bool) && (!hhv_state_6_Bool || (hhv_state_5_Bool && hhv_state_3_Bool)))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_6_Bool) && (!hbv_state_3_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || (hbv_state_2_Bool && hbv_state_6_Bool)))) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !((!hbv_state_7_Bool || !hbv_state_6_Bool) && (hbv_state_7_Bool || hbv_state_6_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_6_Bool)) || ((!hbv_state_3_Bool && hbv_state_2_Bool) && !hbv_state_6_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_3_Bool) || hbv_state_6_Bool) && (hbv_state_2_Bool || !hbv_state_6_Bool))))) && !((hhv_state_3_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_3_Bool))) && !((hhv_state_4_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_4_Bool))) && !((!hbv_state_3_Bool || !hbv_state_4_Bool) && (hbv_state_4_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool)); [L0] CALL call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] assume (((((!hhv_state_2_Bool && !hhv_state_1_Bool) && !((!hhv_state_1_Bool || !hhv_state_4_Bool) && (hhv_state_1_Bool || hhv_state_4_Bool))) && !((!hhv_state_3_Bool || !hhv_state_0_Bool) && (hhv_state_0_Bool || hhv_state_3_Bool))) && !hhv_state_0_Bool) && !(((hhv_state_5_Bool && hhv_state_3_Bool) || !hhv_state_6_Bool) && ((!hhv_state_3_Bool || hhv_state_6_Bool) || !hhv_state_5_Bool))) && !((hhv_state_2_Bool || hhv_state_5_Bool) && (!hhv_state_2_Bool || !hhv_state_5_Bool)); [L0] RET call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] RET call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] RET call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] RET call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] RET call state(hbv_state_4_Bool, hbv_state_7_Bool, hbv_state_1_Bool, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_2_Bool, hbv_state_5_Bool, hbv_state_8_Bool); [L0] RET call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_1_Bool, hbv_False_8_Bool); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 5.6s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 43 SDslu, 175 SDs, 0 SdLazy, 138 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=4, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 5072 SizeOfPredicates, 36 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 22/68 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/_6counter2.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-51-46-010.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counter2.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-51-46-010.csv Received shutdown request...