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/_6counter.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 15:50:48,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 15:50:48,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 15:50:48,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 15:50:48,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 15:50:48,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 15:50:48,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 15:50:48,441 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 15:50:48,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 15:50:48,443 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 15:50:48,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 15:50:48,445 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 15:50:48,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 15:50:48,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 15:50:48,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 15:50:48,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 15:50:48,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 15:50:48,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 15:50:48,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 15:50:48,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 15:50:48,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 15:50:48,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 15:50:48,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 15:50:48,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 15:50:48,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 15:50:48,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 15:50:48,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 15:50:48,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 15:50:48,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 15:50:48,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 15:50:48,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 15:50:48,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 15:50:48,477 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 15:50:48,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 15:50:48,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 15:50:48,483 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:48,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 15:50:48,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 15:50:48,505 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 15:50:48,506 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 15:50:48,507 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 15:50:48,507 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 15:50:48,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 15:50:48,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 15:50:48,508 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 15:50:48,508 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 15:50:48,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 15:50:48,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 15:50:48,508 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 15:50:48,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 15:50:48,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 15:50:48,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 15:50:48,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 15:50:48,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 15:50:48,509 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 15:50:48,513 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 15:50:48,513 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 15:50:48,556 INFO ]: Repository-Root is: /tmp [2018-06-22 15:50:48,573 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 15:50:48,579 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 15:50:48,581 INFO ]: Initializing SmtParser... [2018-06-22 15:50:48,581 INFO ]: SmtParser initialized [2018-06-22 15:50:48,582 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter.smt2 [2018-06-22 15:50:48,583 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:48,669 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter.smt2 unknown [2018-06-22 15:50:48,847 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counter.smt2 [2018-06-22 15:50:48,852 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 15:50:48,858 INFO ]: Walking toolchain with 4 elements. [2018-06-22 15:50:48,858 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 15:50:48,858 INFO ]: Initializing ChcToBoogie... [2018-06-22 15:50:48,858 INFO ]: ChcToBoogie initialized [2018-06-22 15:50:48,861 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,908 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48 Unit [2018-06-22 15:50:48,908 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 15:50:48,909 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 15:50:48,909 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 15:50:48,909 INFO ]: Boogie Preprocessor initialized [2018-06-22 15:50:48,931 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,932 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,938 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,939 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,941 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,942 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,945 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (1/1) ... [2018-06-22 15:50:48,946 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 15:50:48,946 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 15:50:48,946 INFO ]: Initializing RCFGBuilder... [2018-06-22 15:50:48,946 INFO ]: RCFGBuilder initialized [2018-06-22 15:50:48,947 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (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:48,969 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 15:50:48,969 INFO ]: Found specification of procedure False [2018-06-22 15:50:48,969 INFO ]: Found implementation of procedure False [2018-06-22 15:50:48,969 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-22 15:50:48,969 INFO ]: Found specification of procedure state [2018-06-22 15:50:48,969 INFO ]: Found implementation of procedure state [2018-06-22 15:50:48,969 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 15:50:48,969 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 15:50:48,969 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 15:50:49,198 INFO ]: Using library mode [2018-06-22 15:50:49,199 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:49 BoogieIcfgContainer [2018-06-22 15:50:49,199 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 15:50:49,200 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 15:50:49,200 INFO ]: Initializing TraceAbstraction... [2018-06-22 15:50:49,212 INFO ]: TraceAbstraction initialized [2018-06-22 15:50:49,212 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:48" (1/3) ... [2018-06-22 15:50:49,213 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5225a5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 03:50:49, skipping insertion in model container [2018-06-22 15:50:49,217 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:48" (2/3) ... [2018-06-22 15:50:49,217 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5225a5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:50:49, skipping insertion in model container [2018-06-22 15:50:49,217 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:49" (3/3) ... [2018-06-22 15:50:49,219 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 15:50:49,230 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 15:50:49,244 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 15:50:49,313 INFO ]: Using default assertion order modulation [2018-06-22 15:50:49,314 INFO ]: Interprodecural is true [2018-06-22 15:50:49,314 INFO ]: Hoare is false [2018-06-22 15:50:49,314 INFO ]: Compute interpolants for FPandBP [2018-06-22 15:50:49,314 INFO ]: Backedges is TWOTRACK [2018-06-22 15:50:49,314 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 15:50:49,314 INFO ]: Difference is false [2018-06-22 15:50:49,314 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 15:50:49,314 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 15:50:49,327 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 15:50:49,339 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 15:50:49,339 INFO ]: Found error trace [2018-06-22 15:50:49,340 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:49,340 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:49,346 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-22 15:50:49,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:49,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:49,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:49,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:49,382 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:49,423 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:49,497 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:49,499 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 15:50:49,499 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 15:50:49,500 INFO ]: Interpolant automaton has 4 states [2018-06-22 15:50:49,510 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 15:50:49,511 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 15:50:49,513 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 15:50:49,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:49,592 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-22 15:50:49,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 15:50:49,594 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 15:50:49,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:49,607 INFO ]: With dead ends: 13 [2018-06-22 15:50:49,607 INFO ]: Without dead ends: 13 [2018-06-22 15:50:49,611 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:49,625 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 15:50:49,650 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 15:50:49,652 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 15:50:49,652 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 15:50:49,653 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-22 15:50:49,653 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:49,653 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 15:50:49,653 INFO ]: Interpolant automaton has 4 states. [2018-06-22 15:50:49,653 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 15:50:49,654 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 15:50:49,654 INFO ]: Found error trace [2018-06-22 15:50:49,654 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:49,654 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:49,654 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-22 15:50:49,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:49,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:49,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:49,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:49,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:49,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:49,962 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:49,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:49,962 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:49,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:50,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:50,024 INFO ]: Computing forward predicates... [2018-06-22 15:50:50,882 WARN ]: Spent 303.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-06-22 15:50:50,967 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:50,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:50,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 15:50:50,988 INFO ]: Interpolant automaton has 8 states [2018-06-22 15:50:50,989 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 15:50:50,989 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 15:50:50,989 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2018-06-22 15:50:51,304 WARN ]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 15:50:51,793 WARN ]: Spent 371.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-06-22 15:50:51,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:51,879 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-22 15:50:51,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 15:50:51,880 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 15:50:51,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:51,881 INFO ]: With dead ends: 15 [2018-06-22 15:50:51,881 INFO ]: Without dead ends: 15 [2018-06-22 15:50:51,882 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 15:50:51,882 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 15:50:51,884 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 15:50:51,884 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 15:50:51,885 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 15:50:51,885 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 15:50:51,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:51,885 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 15:50:51,885 INFO ]: Interpolant automaton has 8 states. [2018-06-22 15:50:51,885 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 15:50:51,886 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 15:50:51,886 INFO ]: Found error trace [2018-06-22 15:50:51,886 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:51,886 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:51,886 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-22 15:50:51,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:51,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:51,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:51,887 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:51,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:51,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:52,190 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:52,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:52,190 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:52,198 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 15:50:52,216 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 15:50:52,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:52,218 INFO ]: Computing forward predicates... [2018-06-22 15:50:52,814 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-06-22 15:50:53,132 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:53,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:53,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 15:50:53,204 INFO ]: Interpolant automaton has 12 states [2018-06-22 15:50:53,204 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 15:50:53,204 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-22 15:50:53,204 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-22 15:50:53,463 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-06-22 15:50:53,614 WARN ]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 28 [2018-06-22 15:50:53,827 WARN ]: Spent 194.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2018-06-22 15:50:54,151 WARN ]: Spent 274.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-06-22 15:50:54,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:54,175 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 15:50:54,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 15:50:54,176 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 15:50:54,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:54,176 INFO ]: With dead ends: 19 [2018-06-22 15:50:54,176 INFO ]: Without dead ends: 19 [2018-06-22 15:50:54,177 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-06-22 15:50:54,177 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 15:50:54,180 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 15:50:54,180 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 15:50:54,181 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 15:50:54,181 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-22 15:50:54,181 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:54,181 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 15:50:54,181 INFO ]: Interpolant automaton has 12 states. [2018-06-22 15:50:54,181 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 15:50:54,182 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 15:50:54,182 INFO ]: Found error trace [2018-06-22 15:50:54,182 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:54,182 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:54,182 INFO ]: Analyzing trace with hash 1762711629, now seen corresponding path program 3 times [2018-06-22 15:50:54,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:54,182 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:54,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:54,183 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:54,183 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:54,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:54,457 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 15:50:54,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:54,457 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:54,469 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 15:50:54,499 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 15:50:54,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:54,502 INFO ]: Computing forward predicates... [2018-06-22 15:50:55,157 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 15:50:55,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:55,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 15:50:55,177 INFO ]: Interpolant automaton has 19 states [2018-06-22 15:50:55,177 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 15:50:55,177 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-22 15:50:55,177 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 19 states. [2018-06-22 15:50:55,667 WARN ]: Spent 410.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-06-22 15:50:56,147 WARN ]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 24 [2018-06-22 15:50:56,347 WARN ]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-06-22 15:50:56,384 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:56,384 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 15:50:56,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 15:50:56,385 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-22 15:50:56,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:56,386 INFO ]: With dead ends: 21 [2018-06-22 15:50:56,386 INFO ]: Without dead ends: 21 [2018-06-22 15:50:56,386 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-06-22 15:50:56,386 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 15:50:56,389 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 15:50:56,389 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 15:50:56,390 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 15:50:56,390 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-22 15:50:56,390 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:56,390 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 15:50:56,390 INFO ]: Interpolant automaton has 19 states. [2018-06-22 15:50:56,390 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 15:50:56,391 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 15:50:56,391 INFO ]: Found error trace [2018-06-22 15:50:56,391 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:56,391 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:56,391 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 4 times [2018-06-22 15:50:56,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:56,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:56,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:56,392 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:56,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:56,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:56,854 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 15:50:56,854 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:56,854 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 15:50:56,860 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 15:50:56,882 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 15:50:56,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:56,886 INFO ]: Computing forward predicates... [2018-06-22 15:50:57,454 INFO ]: Checked inductivity of 55 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 15:50:57,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:57,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-22 15:50:57,486 INFO ]: Interpolant automaton has 20 states [2018-06-22 15:50:57,486 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 15:50:57,486 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-22 15:50:57,486 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 20 states. [2018-06-22 15:50:57,843 WARN ]: Spent 280.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-06-22 15:50:58,204 WARN ]: Spent 229.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 18 [2018-06-22 15:50:58,553 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2018-06-22 15:50:58,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:58,588 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-22 15:50:58,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 15:50:58,588 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 15:50:58,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:58,589 INFO ]: With dead ends: 23 [2018-06-22 15:50:58,589 INFO ]: Without dead ends: 23 [2018-06-22 15:50:58,590 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2018-06-22 15:50:58,590 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 15:50:58,593 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 15:50:58,593 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 15:50:58,594 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 15:50:58,594 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-22 15:50:58,594 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:58,594 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 15:50:58,594 INFO ]: Interpolant automaton has 20 states. [2018-06-22 15:50:58,594 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 15:50:58,595 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 15:50:58,595 INFO ]: Found error trace [2018-06-22 15:50:58,595 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:58,595 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:58,595 INFO ]: Analyzing trace with hash -1661294575, now seen corresponding path program 5 times [2018-06-22 15:50:58,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:58,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:58,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:58,596 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:58,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:58,613 INFO ]: Conjunction of SSA is sat [2018-06-22 15:50:58,615 INFO ]: Counterexample might be feasible [2018-06-22 15:50:58,631 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:50:58 BoogieIcfgContainer [2018-06-22 15:50:58,631 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 15:50:58,632 INFO ]: Toolchain (without parser) took 9779.25 ms. Allocated memory was 308.3 MB in the beginning and 467.7 MB in the end (delta: 159.4 MB). Free memory was 263.8 MB in the beginning and 195.9 MB in the end (delta: 67.9 MB). Peak memory consumption was 227.3 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:58,632 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 15:50:58,633 INFO ]: ChcToBoogie took 50.28 ms. Allocated memory is still 308.3 MB. Free memory was 263.8 MB in the beginning and 261.8 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:58,633 INFO ]: Boogie Preprocessor took 37.27 ms. Allocated memory is still 308.3 MB. Free memory was 261.8 MB in the beginning and 260.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:58,634 INFO ]: RCFGBuilder took 252.48 ms. Allocated memory is still 308.3 MB. Free memory was 259.8 MB in the beginning and 251.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:58,634 INFO ]: TraceAbstraction took 9430.76 ms. Allocated memory was 308.3 MB in the beginning and 467.7 MB in the end (delta: 159.4 MB). Free memory was 251.7 MB in the beginning and 195.9 MB in the end (delta: 55.8 MB). Peak memory consumption was 215.1 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:58,637 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.28 ms. Allocated memory is still 308.3 MB. Free memory was 263.8 MB in the beginning and 261.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.27 ms. Allocated memory is still 308.3 MB. Free memory was 261.8 MB in the beginning and 260.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 252.48 ms. Allocated memory is still 308.3 MB. Free memory was 259.8 MB in the beginning and 251.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 9430.76 ms. Allocated memory was 308.3 MB in the beginning and 467.7 MB in the end (delta: 159.4 MB). Free memory was 251.7 MB in the beginning and 195.9 MB in the end (delta: 55.8 MB). Peak memory consumption was 215.1 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_8_Bool, hbv_False_9_Bool, hbv_False_1_Bool, hbv_False_10_Bool); [L0] assume (((((((((((!((hhv_state_5_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_5_Bool)) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || ((!hbv_state_4_Bool && hbv_state_2_Bool) && !hbv_state_3_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_4_Bool) || hbv_state_3_Bool) && (hbv_state_2_Bool || !hbv_state_3_Bool))))) && !((!hbv_state_9_Bool || !hbv_state_3_Bool) && (hbv_state_9_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool))) && !((!hbv_state_4_Bool || !hbv_state_5_Bool) && (hbv_state_5_Bool || hbv_state_4_Bool))) && !((hhv_state_8_Bool || hhv_state_4_Bool) && (!hhv_state_4_Bool || !hhv_state_8_Bool))) && !((hhv_state_6_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_6_Bool))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_3_Bool) && (!hbv_state_4_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_4_Bool)) || (hbv_state_2_Bool && hbv_state_3_Bool)))) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_7_Bool || !hhv_state_2_Bool))) && !((hhv_state_3_Bool || hbv_state_3_Bool) && (!hhv_state_3_Bool || !hbv_state_3_Bool))) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !((!hhv_state_4_Bool || ((!hhv_state_6_Bool || hbv_state_8_Bool) && (hhv_state_6_Bool || !hbv_state_8_Bool))) && (((hhv_state_6_Bool && !hbv_state_8_Bool) || hhv_state_4_Bool) || (!hhv_state_6_Bool && hbv_state_8_Bool))); [L0] CALL call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] assume (((((((((((!((hhv_state_5_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_5_Bool)) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || ((!hbv_state_4_Bool && hbv_state_2_Bool) && !hbv_state_3_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_4_Bool) || hbv_state_3_Bool) && (hbv_state_2_Bool || !hbv_state_3_Bool))))) && !((!hbv_state_9_Bool || !hbv_state_3_Bool) && (hbv_state_9_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool))) && !((!hbv_state_4_Bool || !hbv_state_5_Bool) && (hbv_state_5_Bool || hbv_state_4_Bool))) && !((hhv_state_8_Bool || hhv_state_4_Bool) && (!hhv_state_4_Bool || !hhv_state_8_Bool))) && !((hhv_state_6_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_6_Bool))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_3_Bool) && (!hbv_state_4_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_4_Bool)) || (hbv_state_2_Bool && hbv_state_3_Bool)))) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_7_Bool || !hhv_state_2_Bool))) && !((hhv_state_3_Bool || hbv_state_3_Bool) && (!hhv_state_3_Bool || !hbv_state_3_Bool))) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !((!hhv_state_4_Bool || ((!hhv_state_6_Bool || hbv_state_8_Bool) && (hhv_state_6_Bool || !hbv_state_8_Bool))) && (((hhv_state_6_Bool && !hbv_state_8_Bool) || hhv_state_4_Bool) || (!hhv_state_6_Bool && hbv_state_8_Bool))); [L0] CALL call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] assume (((((((((((!((hhv_state_5_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_5_Bool)) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || ((!hbv_state_4_Bool && hbv_state_2_Bool) && !hbv_state_3_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_4_Bool) || hbv_state_3_Bool) && (hbv_state_2_Bool || !hbv_state_3_Bool))))) && !((!hbv_state_9_Bool || !hbv_state_3_Bool) && (hbv_state_9_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool))) && !((!hbv_state_4_Bool || !hbv_state_5_Bool) && (hbv_state_5_Bool || hbv_state_4_Bool))) && !((hhv_state_8_Bool || hhv_state_4_Bool) && (!hhv_state_4_Bool || !hhv_state_8_Bool))) && !((hhv_state_6_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_6_Bool))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_3_Bool) && (!hbv_state_4_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_4_Bool)) || (hbv_state_2_Bool && hbv_state_3_Bool)))) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_7_Bool || !hhv_state_2_Bool))) && !((hhv_state_3_Bool || hbv_state_3_Bool) && (!hhv_state_3_Bool || !hbv_state_3_Bool))) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !((!hhv_state_4_Bool || ((!hhv_state_6_Bool || hbv_state_8_Bool) && (hhv_state_6_Bool || !hbv_state_8_Bool))) && (((hhv_state_6_Bool && !hbv_state_8_Bool) || hhv_state_4_Bool) || (!hhv_state_6_Bool && hbv_state_8_Bool))); [L0] CALL call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] assume (((((((((((!((hhv_state_5_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_5_Bool)) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || ((!hbv_state_4_Bool && hbv_state_2_Bool) && !hbv_state_3_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_4_Bool) || hbv_state_3_Bool) && (hbv_state_2_Bool || !hbv_state_3_Bool))))) && !((!hbv_state_9_Bool || !hbv_state_3_Bool) && (hbv_state_9_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool))) && !((!hbv_state_4_Bool || !hbv_state_5_Bool) && (hbv_state_5_Bool || hbv_state_4_Bool))) && !((hhv_state_8_Bool || hhv_state_4_Bool) && (!hhv_state_4_Bool || !hhv_state_8_Bool))) && !((hhv_state_6_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_6_Bool))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_3_Bool) && (!hbv_state_4_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_4_Bool)) || (hbv_state_2_Bool && hbv_state_3_Bool)))) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_7_Bool || !hhv_state_2_Bool))) && !((hhv_state_3_Bool || hbv_state_3_Bool) && (!hhv_state_3_Bool || !hbv_state_3_Bool))) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !((!hhv_state_4_Bool || ((!hhv_state_6_Bool || hbv_state_8_Bool) && (hhv_state_6_Bool || !hbv_state_8_Bool))) && (((hhv_state_6_Bool && !hbv_state_8_Bool) || hhv_state_4_Bool) || (!hhv_state_6_Bool && hbv_state_8_Bool))); [L0] CALL call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] assume (((((((((((!((hhv_state_5_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_5_Bool)) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || ((!hbv_state_4_Bool && hbv_state_2_Bool) && !hbv_state_3_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_4_Bool) || hbv_state_3_Bool) && (hbv_state_2_Bool || !hbv_state_3_Bool))))) && !((!hbv_state_9_Bool || !hbv_state_3_Bool) && (hbv_state_9_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool))) && !((!hbv_state_4_Bool || !hbv_state_5_Bool) && (hbv_state_5_Bool || hbv_state_4_Bool))) && !((hhv_state_8_Bool || hhv_state_4_Bool) && (!hhv_state_4_Bool || !hhv_state_8_Bool))) && !((hhv_state_6_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_6_Bool))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_3_Bool) && (!hbv_state_4_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_4_Bool)) || (hbv_state_2_Bool && hbv_state_3_Bool)))) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_7_Bool || !hhv_state_2_Bool))) && !((hhv_state_3_Bool || hbv_state_3_Bool) && (!hhv_state_3_Bool || !hbv_state_3_Bool))) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !((!hhv_state_4_Bool || ((!hhv_state_6_Bool || hbv_state_8_Bool) && (hhv_state_6_Bool || !hbv_state_8_Bool))) && (((hhv_state_6_Bool && !hbv_state_8_Bool) || hhv_state_4_Bool) || (!hhv_state_6_Bool && hbv_state_8_Bool))); [L0] CALL call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] assume (((((((((((!((hhv_state_5_Bool || hhv_state_0_Bool) && (!hhv_state_0_Bool || !hhv_state_5_Bool)) && !((hbv_state_1_Bool || hbv_state_2_Bool) && (!hbv_state_1_Bool || !hbv_state_2_Bool))) && !(((hhv_state_1_Bool || (!hbv_state_2_Bool && hbv_state_3_Bool)) || ((!hbv_state_4_Bool && hbv_state_2_Bool) && !hbv_state_3_Bool)) && (!hhv_state_1_Bool || (((!hbv_state_2_Bool || hbv_state_4_Bool) || hbv_state_3_Bool) && (hbv_state_2_Bool || !hbv_state_3_Bool))))) && !((!hbv_state_9_Bool || !hbv_state_3_Bool) && (hbv_state_9_Bool || hbv_state_3_Bool))) && !((hhv_state_2_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || !hhv_state_2_Bool))) && !((!hbv_state_4_Bool || !hbv_state_5_Bool) && (hbv_state_5_Bool || hbv_state_4_Bool))) && !((hhv_state_8_Bool || hhv_state_4_Bool) && (!hhv_state_4_Bool || !hhv_state_8_Bool))) && !((hhv_state_6_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_6_Bool))) && !((!hhv_state_0_Bool || ((!hbv_state_2_Bool || !hbv_state_3_Bool) && (!hbv_state_4_Bool || hbv_state_2_Bool))) && ((hhv_state_0_Bool || (!hbv_state_2_Bool && hbv_state_4_Bool)) || (hbv_state_2_Bool && hbv_state_3_Bool)))) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_7_Bool || !hhv_state_2_Bool))) && !((hhv_state_3_Bool || hbv_state_3_Bool) && (!hhv_state_3_Bool || !hbv_state_3_Bool))) && !((!hbv_state_6_Bool || !hbv_state_7_Bool) && (hbv_state_6_Bool || hbv_state_7_Bool))) && !((!hhv_state_4_Bool || ((!hhv_state_6_Bool || hbv_state_8_Bool) && (hhv_state_6_Bool || !hbv_state_8_Bool))) && (((hhv_state_6_Bool && !hbv_state_8_Bool) || hhv_state_4_Bool) || (!hhv_state_6_Bool && hbv_state_8_Bool))); [L0] CALL call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] assume (((((((!((!hhv_state_5_Bool || !hhv_state_0_Bool) && (hhv_state_0_Bool || hhv_state_5_Bool)) && !hhv_state_2_Bool) && !((!hhv_state_8_Bool || !hhv_state_4_Bool) && (hhv_state_8_Bool || hhv_state_4_Bool))) && !hhv_state_1_Bool) && !((!hhv_state_1_Bool || !hhv_state_6_Bool) && (hhv_state_1_Bool || hhv_state_6_Bool))) && !!hhv_state_4_Bool) && !!hhv_state_3_Bool) && !hhv_state_0_Bool) && !((hhv_state_2_Bool || hhv_state_7_Bool) && (!hhv_state_2_Bool || !hhv_state_7_Bool)); [L0] RET call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] RET call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] RET call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] RET call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] RET call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_Bool); [L0] RET call state(hbv_state_5_Bool, hbv_state_9_Bool, hbv_state_1_Bool, hbv_state_8_Bool, hbv_state_7_Bool, hbv_state_4_Bool, hbv_state_3_Bool, hbv_state_2_Bool, hbv_state_6_Bool, hbv_state_10_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_8_Bool, hbv_False_9_Bool, hbv_False_1_Bool, hbv_False_10_Bool); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 9.3s OverallTime, 6 OverallIterations, 7 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 128 SDslu, 342 SDs, 0 SdLazy, 291 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=5, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 28312 SizeOfPredicates, 86 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 61/208 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/_6counter.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_15-50-58-652.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counter.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_15-50-58-652.csv Received shutdown request...