java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 06:11:18,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 06:11:18,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 06:11:18,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 06:11:18,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 06:11:18,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 06:11:18,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 06:11:18,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 06:11:18,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 06:11:18,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 06:11:18,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 06:11:18,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 06:11:18,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 06:11:18,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 06:11:18,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 06:11:18,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 06:11:18,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 06:11:18,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 06:11:18,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 06:11:18,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 06:11:18,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 06:11:18,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 06:11:18,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 06:11:18,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 06:11:18,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 06:11:18,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 06:11:18,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 06:11:18,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 06:11:18,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 06:11:18,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 06:11:18,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 06:11:18,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 06:11:18,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 06:11:18,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 06:11:18,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 06:11:18,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 06:11:18,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 06:11:18,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 06:11:18,108 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 06:11:18,109 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 06:11:18,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 06:11:18,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 06:11:18,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 06:11:18,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 06:11:18,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 06:11:18,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 06:11:18,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 06:11:18,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 06:11:18,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 06:11:18,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 06:11:18,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 06:11:18,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 06:11:18,112 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 06:11:18,114 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 06:11:18,114 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 06:11:18,167 INFO ]: Repository-Root is: /tmp [2018-06-22 06:11:18,187 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 06:11:18,192 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 06:11:18,193 INFO ]: Initializing SmtParser... [2018-06-22 06:11:18,194 INFO ]: SmtParser initialized [2018-06-22 06:11:18,194 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-22 06:11:18,196 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 06:11:18,294 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 unknown [2018-06-22 06:11:18,568 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-22 06:11:18,575 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 06:11:18,582 INFO ]: Walking toolchain with 4 elements. [2018-06-22 06:11:18,582 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 06:11:18,582 INFO ]: Initializing ChcToBoogie... [2018-06-22 06:11:18,582 INFO ]: ChcToBoogie initialized [2018-06-22 06:11:18,586 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,639 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18 Unit [2018-06-22 06:11:18,639 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 06:11:18,640 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 06:11:18,640 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 06:11:18,640 INFO ]: Boogie Preprocessor initialized [2018-06-22 06:11:18,661 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,661 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,670 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,670 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,676 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,677 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,679 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (1/1) ... [2018-06-22 06:11:18,692 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 06:11:18,693 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 06:11:18,693 INFO ]: Initializing RCFGBuilder... [2018-06-22 06:11:18,693 INFO ]: RCFGBuilder initialized [2018-06-22 06:11:18,694 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (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 06:11:18,705 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 06:11:18,706 INFO ]: Found specification of procedure gotoProc [2018-06-22 06:11:18,706 INFO ]: Found implementation of procedure gotoProc [2018-06-22 06:11:18,706 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 06:11:18,706 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 06:11:18,706 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 06:11:18,924 INFO ]: Using library mode [2018-06-22 06:11:18,925 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:11:18 BoogieIcfgContainer [2018-06-22 06:11:18,925 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 06:11:18,926 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 06:11:18,926 INFO ]: Initializing TraceAbstraction... [2018-06-22 06:11:18,929 INFO ]: TraceAbstraction initialized [2018-06-22 06:11:18,930 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 06:11:18" (1/3) ... [2018-06-22 06:11:18,931 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d00b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 06:11:18, skipping insertion in model container [2018-06-22 06:11:18,931 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 06:11:18" (2/3) ... [2018-06-22 06:11:18,931 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d00b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:11:18, skipping insertion in model container [2018-06-22 06:11:18,931 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:11:18" (3/3) ... [2018-06-22 06:11:18,933 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 06:11:18,943 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 06:11:18,952 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 06:11:18,997 INFO ]: Using default assertion order modulation [2018-06-22 06:11:18,998 INFO ]: Interprodecural is true [2018-06-22 06:11:18,998 INFO ]: Hoare is false [2018-06-22 06:11:18,998 INFO ]: Compute interpolants for FPandBP [2018-06-22 06:11:18,998 INFO ]: Backedges is TWOTRACK [2018-06-22 06:11:18,998 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 06:11:18,998 INFO ]: Difference is false [2018-06-22 06:11:18,998 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 06:11:18,998 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 06:11:19,022 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 06:11:19,041 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 06:11:19,041 INFO ]: Found error trace [2018-06-22 06:11:19,042 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 06:11:19,042 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 06:11:19,057 INFO ]: Analyzing trace with hash 1285054476, now seen corresponding path program 1 times [2018-06-22 06:11:19,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 06:11:19,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 06:11:19,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:19,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 06:11:19,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:19,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 06:11:19,313 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 06:11:19,315 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 06:11:19,315 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 06:11:19,317 INFO ]: Interpolant automaton has 3 states [2018-06-22 06:11:19,327 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 06:11:19,328 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 06:11:19,330 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 06:11:19,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 06:11:19,379 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-22 06:11:19,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 06:11:19,381 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 06:11:19,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 06:11:19,388 INFO ]: With dead ends: 9 [2018-06-22 06:11:19,388 INFO ]: Without dead ends: 9 [2018-06-22 06:11:19,390 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 06:11:19,403 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 06:11:19,418 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 06:11:19,422 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 06:11:19,423 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-22 06:11:19,424 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-22 06:11:19,424 INFO ]: Finished accepts. word is rejected. [2018-06-22 06:11:19,424 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-22 06:11:19,424 INFO ]: Interpolant automaton has 3 states. [2018-06-22 06:11:19,424 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-22 06:11:19,424 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 06:11:19,424 INFO ]: Found error trace [2018-06-22 06:11:19,424 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 06:11:19,425 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 06:11:19,425 INFO ]: Analyzing trace with hash 1180100628, now seen corresponding path program 1 times [2018-06-22 06:11:19,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 06:11:19,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 06:11:19,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:19,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 06:11:19,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:19,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 06:11:19,677 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-06-22 06:11:19,683 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 06:11:19,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 06:11:19,684 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 06:11:19,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 06:11:19,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 06:11:19,764 INFO ]: Computing forward predicates... [2018-06-22 06:11:19,934 WARN ]: expecting exponential blowup for input size 9 [2018-06-22 06:11:20,192 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 06:11:20,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 06:11:20,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 06:11:20,217 INFO ]: Interpolant automaton has 6 states [2018-06-22 06:11:20,217 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 06:11:20,217 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 06:11:20,218 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-22 06:11:20,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 06:11:20,348 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-22 06:11:20,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 06:11:20,348 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-22 06:11:20,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 06:11:20,349 INFO ]: With dead ends: 11 [2018-06-22 06:11:20,349 INFO ]: Without dead ends: 11 [2018-06-22 06:11:20,350 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 06:11:20,350 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 06:11:20,351 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 06:11:20,351 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 06:11:20,351 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-22 06:11:20,351 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-06-22 06:11:20,352 INFO ]: Finished accepts. word is rejected. [2018-06-22 06:11:20,352 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-22 06:11:20,352 INFO ]: Interpolant automaton has 6 states. [2018-06-22 06:11:20,352 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-22 06:11:20,352 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 06:11:20,352 INFO ]: Found error trace [2018-06-22 06:11:20,352 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 06:11:20,352 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 06:11:20,352 INFO ]: Analyzing trace with hash 145098516, now seen corresponding path program 2 times [2018-06-22 06:11:20,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 06:11:20,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 06:11:20,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:20,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 06:11:20,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:20,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 06:11:20,769 WARN ]: Spent 210.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-06-22 06:11:21,026 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-06-22 06:11:21,151 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 06:11:21,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 06:11:21,151 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 06:11:21,158 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 06:11:21,243 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 06:11:21,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 06:11:21,246 INFO ]: Computing forward predicates... [2018-06-22 06:11:21,790 WARN ]: Spent 311.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2018-06-22 06:11:22,346 WARN ]: Spent 408.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9 [2018-06-22 06:11:22,351 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 06:11:22,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 06:11:22,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 06:11:22,424 INFO ]: Interpolant automaton has 10 states [2018-06-22 06:11:22,424 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 06:11:22,424 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 06:11:22,424 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-06-22 06:11:22,567 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-22 06:11:22,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 06:11:22,703 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-22 06:11:22,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 06:11:22,703 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-22 06:11:22,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 06:11:22,704 INFO ]: With dead ends: 13 [2018-06-22 06:11:22,704 INFO ]: Without dead ends: 13 [2018-06-22 06:11:22,704 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-22 06:11:22,704 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 06:11:22,706 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 06:11:22,706 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 06:11:22,706 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-22 06:11:22,706 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-06-22 06:11:22,706 INFO ]: Finished accepts. word is rejected. [2018-06-22 06:11:22,706 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-22 06:11:22,706 INFO ]: Interpolant automaton has 10 states. [2018-06-22 06:11:22,706 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-22 06:11:22,707 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 06:11:22,707 INFO ]: Found error trace [2018-06-22 06:11:22,707 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 06:11:22,707 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 06:11:22,707 INFO ]: Analyzing trace with hash 1940481556, now seen corresponding path program 3 times [2018-06-22 06:11:22,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 06:11:22,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 06:11:22,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:22,708 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 06:11:22,708 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 06:11:22,748 INFO ]: Conjunction of SSA is sat [2018-06-22 06:11:22,751 INFO ]: Counterexample might be feasible [2018-06-22 06:11:22,767 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:11:22 BoogieIcfgContainer [2018-06-22 06:11:22,768 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 06:11:22,768 INFO ]: Toolchain (without parser) took 4192.54 ms. Allocated memory was 308.8 MB in the beginning and 329.8 MB in the end (delta: 21.0 MB). Free memory was 263.2 MB in the beginning and 225.0 MB in the end (delta: 38.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 3.6 GB. [2018-06-22 06:11:22,769 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 06:11:22,770 INFO ]: ChcToBoogie took 57.49 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 06:11:22,770 INFO ]: Boogie Preprocessor took 52.00 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 259.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 06:11:22,771 INFO ]: RCFGBuilder took 231.89 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 247.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 06:11:22,771 INFO ]: TraceAbstraction took 3841.40 ms. Allocated memory was 308.8 MB in the beginning and 329.8 MB in the end (delta: 21.0 MB). Free memory was 247.2 MB in the beginning and 225.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 3.6 GB. [2018-06-22 06:11:22,774 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.49 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.00 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 259.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 231.89 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 247.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3841.40 ms. Allocated memory was 308.8 MB in the beginning and 329.8 MB in the end (delta: 21.0 MB). Free memory was 247.2 MB in the beginning and 225.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, false, false, false, 0, false, false, false, false, 0, false, false, false, false, false, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int; [L0] havoc hbv_False_3_Bool, hbv_False_6_Bool, hbv_False_4_Bool, hbv_False_13_Bool, hbv_False_5_Int, hbv_False_7_Bool, hbv_False_9_Bool, hbv_False_8_Bool, hbv_False_12_Bool, hbv_False_11_Bool, hbv_False_2_Bool, hbv_False_15_Int, hbv_False_10_Int, hbv_False_14_Bool, hbv_False_1_Bool; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_9_Bool, hbv_state_11_Int, hbv_state_1_Int, hbv_state_4_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_12_Bool, hbv_state_5_Bool, hbv_state_13_Bool, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_10_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_9_Bool, hbv_state_11_Int, hbv_state_1_Int, hbv_state_4_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_12_Bool, hbv_state_5_Bool, hbv_state_13_Bool, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_10_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_9_Bool, hbv_state_11_Int, hbv_state_1_Int, hbv_state_4_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_12_Bool, hbv_state_5_Bool, hbv_state_13_Bool, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_10_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_9_Bool, hbv_state_11_Int, hbv_state_1_Int, hbv_state_4_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_12_Bool, hbv_state_5_Bool, hbv_state_13_Bool, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_10_Bool, hbv_state_15_Int; [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] hhv_state_0_Bool, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Int, hhv_state_4_Bool, hhv_state_5_Bool, hhv_state_6_Bool, hhv_state_7_Bool, hhv_state_8_Int, hhv_state_9_Bool, hhv_state_10_Bool, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Bool, hhv_state_14_Int := hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int; [L0] havoc hbv_state_9_Bool, hbv_state_11_Int, hbv_state_1_Int, hbv_state_4_Bool, hbv_state_8_Bool, hbv_state_14_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_12_Bool, hbv_state_5_Bool, hbv_state_13_Bool, hbv_state_3_Bool, hbv_state_7_Bool, hbv_state_10_Bool, hbv_state_15_Int; [L0] assume (((((((((((!hhv_state_2_Bool && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_5_Bool))) && !((hhv_state_4_Bool || hhv_state_0_Bool) && (!hhv_state_4_Bool || !hhv_state_0_Bool))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || (hhv_state_4_Bool && hhv_state_6_Bool)) && ((!hhv_state_4_Bool || !hhv_state_7_Bool) || !hhv_state_6_Bool))) && hhv_state_3_Int == hhv_state_8_Int) && !((!(hhv_state_8_Int == 5) || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_8_Int == 5))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_7_Bool || !hhv_state_10_Bool))) && hhv_state_3_Int == 0) && !((((!hhv_state_11_Bool && !hhv_state_10_Bool) || hhv_state_12_Bool) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((hhv_state_11_Bool || hhv_state_10_Bool) && (!hhv_state_11_Bool || !hhv_state_10_Bool))))) && !hhv_state_1_Bool) && !((hhv_state_2_Bool || hhv_state_6_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && !((!hhv_state_11_Bool || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_11_Bool)); [L0] RET call gotoProc(0, false, false, false, 0, false, false, false, false, 0, false, false, false, false, false, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 3.7s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 0 SDslu, 50 SDs, 0 SdLazy, 34 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 969 SizeOfPredicates, 4 NumberOfNonLiveVariables, 306 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_06-11-22-785.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_06-11-22-785.csv Received shutdown request...