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/_6counter2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 15:50:15,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 15:50:15,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 15:50:15,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 15:50:15,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 15:50:15,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 15:50:15,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 15:50:15,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 15:50:15,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 15:50:15,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 15:50:15,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 15:50:15,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 15:50:15,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 15:50:15,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 15:50:15,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 15:50:15,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 15:50:15,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 15:50:15,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 15:50:15,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 15:50:15,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 15:50:15,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 15:50:15,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 15:50:15,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 15:50:15,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 15:50:15,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 15:50:15,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 15:50:15,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 15:50:15,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 15:50:15,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 15:50:15,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 15:50:15,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 15:50:15,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 15:50:15,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 15:50:15,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 15:50:15,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 15:50:15,554 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:15,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 15:50:15,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 15:50:15,572 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 15:50:15,573 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 15:50:15,574 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 15:50:15,574 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 15:50:15,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 15:50:15,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 15:50:15,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 15:50:15,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 15:50:15,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 15:50:15,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 15:50:15,575 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 15:50:15,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 15:50:15,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 15:50:15,576 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 15:50:15,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 15:50:15,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 15:50:15,576 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 15:50:15,578 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 15:50:15,578 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 15:50:15,617 INFO ]: Repository-Root is: /tmp [2018-06-22 15:50:15,634 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 15:50:15,639 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 15:50:15,641 INFO ]: Initializing SmtParser... [2018-06-22 15:50:15,641 INFO ]: SmtParser initialized [2018-06-22 15:50:15,641 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 [2018-06-22 15:50:15,643 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:15,726 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 unknown [2018-06-22 15:50:15,917 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter2.smt2 [2018-06-22 15:50:15,924 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 15:50:15,929 INFO ]: Walking toolchain with 4 elements. [2018-06-22 15:50:15,930 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 15:50:15,930 INFO ]: Initializing ChcToBoogie... [2018-06-22 15:50:15,930 INFO ]: ChcToBoogie initialized [2018-06-22 15:50:15,933 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:15,977 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15 Unit [2018-06-22 15:50:15,977 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 15:50:15,977 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 15:50:15,977 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 15:50:15,977 INFO ]: Boogie Preprocessor initialized [2018-06-22 15:50:16,001 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,001 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,007 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,007 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,013 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,014 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,015 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (1/1) ... [2018-06-22 15:50:16,017 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 15:50:16,017 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 15:50:16,017 INFO ]: Initializing RCFGBuilder... [2018-06-22 15:50:16,017 INFO ]: RCFGBuilder initialized [2018-06-22 15:50:16,018 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (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:16,033 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 15:50:16,034 INFO ]: Found specification of procedure False [2018-06-22 15:50:16,034 INFO ]: Found implementation of procedure False [2018-06-22 15:50:16,034 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-22 15:50:16,034 INFO ]: Found specification of procedure state [2018-06-22 15:50:16,034 INFO ]: Found implementation of procedure state [2018-06-22 15:50:16,034 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 15:50:16,034 INFO ]: Found specification of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 15:50:16,034 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 15:50:16,297 INFO ]: Using library mode [2018-06-22 15:50:16,306 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:16 BoogieIcfgContainer [2018-06-22 15:50:16,317 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 15:50:16,319 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 15:50:16,319 INFO ]: Initializing TraceAbstraction... [2018-06-22 15:50:16,327 INFO ]: TraceAbstraction initialized [2018-06-22 15:50:16,327 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:15" (1/3) ... [2018-06-22 15:50:16,328 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528e650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 03:50:16, skipping insertion in model container [2018-06-22 15:50:16,328 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:15" (2/3) ... [2018-06-22 15:50:16,329 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528e650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:50:16, skipping insertion in model container [2018-06-22 15:50:16,329 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:16" (3/3) ... [2018-06-22 15:50:16,330 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 15:50:16,340 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 15:50:16,350 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 15:50:16,383 INFO ]: Using default assertion order modulation [2018-06-22 15:50:16,383 INFO ]: Interprodecural is true [2018-06-22 15:50:16,384 INFO ]: Hoare is false [2018-06-22 15:50:16,384 INFO ]: Compute interpolants for FPandBP [2018-06-22 15:50:16,384 INFO ]: Backedges is TWOTRACK [2018-06-22 15:50:16,384 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 15:50:16,384 INFO ]: Difference is false [2018-06-22 15:50:16,384 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 15:50:16,384 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 15:50:16,396 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 15:50:16,408 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 15:50:16,408 INFO ]: Found error trace [2018-06-22 15:50:16,409 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:16,409 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:16,413 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-22 15:50:16,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:16,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:16,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:16,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:16,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:16,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:16,588 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:16,589 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 15:50:16,590 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 15:50:16,591 INFO ]: Interpolant automaton has 4 states [2018-06-22 15:50:16,604 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 15:50:16,604 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 15:50:16,607 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 15:50:16,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:16,708 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-22 15:50:16,709 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 15:50:16,710 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 15:50:16,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:16,719 INFO ]: With dead ends: 13 [2018-06-22 15:50:16,719 INFO ]: Without dead ends: 13 [2018-06-22 15:50:16,721 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-22 15:50:16,734 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 15:50:16,753 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 15:50:16,754 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 15:50:16,754 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 15:50:16,755 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-22 15:50:16,755 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:16,755 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 15:50:16,755 INFO ]: Interpolant automaton has 4 states. [2018-06-22 15:50:16,755 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 15:50:16,757 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 15:50:16,757 INFO ]: Found error trace [2018-06-22 15:50:16,757 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:16,757 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:16,757 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-22 15:50:16,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:16,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:16,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:16,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:16,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:16,776 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:17,015 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:17,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:17,016 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:17,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:17,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:17,069 INFO ]: Computing forward predicates... [2018-06-22 15:50:17,497 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:17,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:17,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 15:50:17,519 INFO ]: Interpolant automaton has 9 states [2018-06-22 15:50:17,519 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 15:50:17,519 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 15:50:17,519 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-06-22 15:50:17,664 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 15:50:17,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:17,686 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-22 15:50:17,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 15:50:17,687 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 15:50:17,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:17,688 INFO ]: With dead ends: 15 [2018-06-22 15:50:17,688 INFO ]: Without dead ends: 15 [2018-06-22 15:50:17,689 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-22 15:50:17,689 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 15:50:17,698 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 15:50:17,698 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 15:50:17,698 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 15:50:17,698 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 15:50:17,698 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:17,699 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 15:50:17,699 INFO ]: Interpolant automaton has 9 states. [2018-06-22 15:50:17,699 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 15:50:17,700 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 15:50:17,700 INFO ]: Found error trace [2018-06-22 15:50:17,700 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:17,700 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:17,701 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-22 15:50:17,701 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:17,701 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:17,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:17,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:17,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:17,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:17,987 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 15:50:18,013 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:50:18,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:18,013 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:50:18,021 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 15:50:18,067 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 15:50:18,067 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:18,069 INFO ]: Computing forward predicates... [2018-06-22 15:50:18,458 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 5 DAG size of output: 4 [2018-06-22 15:50:18,539 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:50:18,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:18,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 15:50:18,560 INFO ]: Interpolant automaton has 12 states [2018-06-22 15:50:18,560 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 15:50:18,560 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-22 15:50:18,560 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-22 15:50:18,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:18,862 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-22 15:50:18,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 15:50:18,862 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 15:50:18,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:18,863 INFO ]: With dead ends: 17 [2018-06-22 15:50:18,863 INFO ]: Without dead ends: 17 [2018-06-22 15:50:18,863 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-22 15:50:18,864 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 15:50:18,866 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 15:50:18,866 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 15:50:18,867 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 15:50:18,867 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-22 15:50:18,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:18,867 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 15:50:18,867 INFO ]: Interpolant automaton has 12 states. [2018-06-22 15:50:18,867 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 15:50:18,868 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 15:50:18,868 INFO ]: Found error trace [2018-06-22 15:50:18,868 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:18,868 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:18,868 INFO ]: Analyzing trace with hash 2119922091, now seen corresponding path program 3 times [2018-06-22 15:50:18,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:18,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:18,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:18,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:18,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:18,891 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:19,188 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:50:19,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:19,192 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:50:19,199 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 15:50:19,250 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 15:50:19,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:19,254 INFO ]: Computing forward predicates... [2018-06-22 15:50:19,639 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-06-22 15:50:19,949 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:50:19,973 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:19,973 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 15:50:19,974 INFO ]: Interpolant automaton has 16 states [2018-06-22 15:50:19,974 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 15:50:19,974 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-22 15:50:19,974 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-22 15:50:20,145 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-06-22 15:50:20,444 WARN ]: Spent 191.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 13 [2018-06-22 15:50:20,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:20,855 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 15:50:20,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 15:50:20,856 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 15:50:20,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:20,856 INFO ]: With dead ends: 21 [2018-06-22 15:50:20,856 INFO ]: Without dead ends: 21 [2018-06-22 15:50:20,857 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-06-22 15:50:20,857 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 15:50:20,860 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 15:50:20,860 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 15:50:20,861 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 15:50:20,861 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 21 [2018-06-22 15:50:20,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:20,861 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 15:50:20,861 INFO ]: Interpolant automaton has 16 states. [2018-06-22 15:50:20,861 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 15:50:20,862 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 15:50:20,862 INFO ]: Found error trace [2018-06-22 15:50:20,862 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:20,862 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:20,862 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 4 times [2018-06-22 15:50:20,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:20,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:20,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:20,863 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:20,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:20,882 INFO ]: Conjunction of SSA is sat [2018-06-22 15:50:20,884 INFO ]: Counterexample might be feasible [2018-06-22 15:50:20,901 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:50:20 BoogieIcfgContainer [2018-06-22 15:50:20,901 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 15:50:20,901 INFO ]: Toolchain (without parser) took 4977.25 ms. Allocated memory was 308.3 MB in the beginning and 343.9 MB in the end (delta: 35.7 MB). Free memory was 262.7 MB in the beginning and 204.7 MB in the end (delta: 58.0 MB). Peak memory consumption was 93.6 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:20,993 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 15:50:20,994 INFO ]: ChcToBoogie took 47.13 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 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:50:20,994 INFO ]: Boogie Preprocessor took 39.24 ms. Allocated memory is still 308.3 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 15:50:20,994 INFO ]: RCFGBuilder took 300.35 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 252.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:20,995 INFO ]: TraceAbstraction took 4581.96 ms. Allocated memory was 308.3 MB in the beginning and 343.9 MB in the end (delta: 35.7 MB). Free memory was 252.7 MB in the beginning and 204.7 MB in the end (delta: 48.0 MB). Peak memory consumption was 83.7 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:20,998 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 308.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 47.13 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.24 ms. Allocated memory is still 308.3 MB. Free memory is still 260.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 300.35 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 252.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4581.96 ms. Allocated memory was 308.3 MB in the beginning and 343.9 MB in the end (delta: 35.7 MB). Free memory was 252.7 MB in the beginning and 204.7 MB in the end (delta: 48.0 MB). Peak memory consumption was 83.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, 4.5s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 SDtfs, 46 SDslu, 173 SDs, 0 SdLazy, 134 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.7s 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 5072 SizeOfPredicates, 36 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 20/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_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_15-50-21-014.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counter2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_15-50-21-014.csv Received shutdown request...