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/eldarica-misc/LIA/HOLA/33.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:03:39,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:03:39,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:03:39,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:03:39,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:03:39,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:03:39,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:03:39,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:03:39,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:03:39,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:03:39,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:03:39,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:03:39,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:03:39,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:03:39,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:03:39,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:03:39,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:03:39,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:03:39,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:03:39,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:03:39,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:03:39,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:03:39,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:03:39,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:03:39,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:03:39,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:03:39,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:03:39,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:03:39,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:03:39,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:03:39,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:03:39,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:03:39,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:03:39,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:03:39,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:03:39,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:03:39,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:03:39,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:03:39,718 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:03:39,718 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:03:39,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:03:39,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:03:39,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:03:39,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:03:39,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:03:39,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:03:39,720 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:03:39,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:03:39,720 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:03:39,720 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:03:39,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:03:39,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:03:39,721 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:03:39,722 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:03:39,722 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:03:39,773 INFO ]: Repository-Root is: /tmp [2018-06-22 01:03:39,788 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:03:39,793 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:03:39,794 INFO ]: Initializing SmtParser... [2018-06-22 01:03:39,795 INFO ]: SmtParser initialized [2018-06-22 01:03:39,795 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/33.c.smt2 [2018-06-22 01:03:39,796 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 01:03:39,871 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/33.c.smt2 unknown [2018-06-22 01:03:40,580 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/33.c.smt2 [2018-06-22 01:03:40,585 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:03:40,592 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:03:40,593 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:03:40,593 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:03:40,593 INFO ]: ChcToBoogie initialized [2018-06-22 01:03:40,596 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,695 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40 Unit [2018-06-22 01:03:40,695 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:03:40,696 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:03:40,696 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:03:40,696 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:03:40,717 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,717 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,745 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,745 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,763 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,765 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,776 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (1/1) ... [2018-06-22 01:03:40,783 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:03:40,783 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:03:40,783 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:03:40,783 INFO ]: RCFGBuilder initialized [2018-06-22 01:03:40,792 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (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 01:03:40,819 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:03:40,819 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:03:40,819 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:03:40,819 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:03:40,819 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:03:40,819 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 01:03:42,066 INFO ]: Using library mode [2018-06-22 01:03:42,067 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:03:42 BoogieIcfgContainer [2018-06-22 01:03:42,067 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:03:42,070 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:03:42,070 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:03:42,073 INFO ]: TraceAbstraction initialized [2018-06-22 01:03:42,073 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:03:40" (1/3) ... [2018-06-22 01:03:42,074 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2cd504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:03:42, skipping insertion in model container [2018-06-22 01:03:42,074 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:40" (2/3) ... [2018-06-22 01:03:42,074 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2cd504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:03:42, skipping insertion in model container [2018-06-22 01:03:42,074 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:03:42" (3/3) ... [2018-06-22 01:03:42,076 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:03:42,087 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:03:42,096 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:03:42,147 INFO ]: Using default assertion order modulation [2018-06-22 01:03:42,148 INFO ]: Interprodecural is true [2018-06-22 01:03:42,148 INFO ]: Hoare is false [2018-06-22 01:03:42,148 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:03:42,148 INFO ]: Backedges is TWOTRACK [2018-06-22 01:03:42,148 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:03:42,148 INFO ]: Difference is false [2018-06-22 01:03:42,148 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:03:42,148 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:03:42,173 INFO ]: Start isEmpty. Operand 56 states. [2018-06-22 01:03:42,186 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:03:42,186 INFO ]: Found error trace [2018-06-22 01:03:42,187 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:42,187 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:42,193 INFO ]: Analyzing trace with hash -133807688, now seen corresponding path program 1 times [2018-06-22 01:03:42,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:42,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:42,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:42,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:42,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:42,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:44,007 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:44,009 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:44,009 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:03:44,011 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:03:44,022 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:03:44,022 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:03:44,024 INFO ]: Start difference. First operand 56 states. Second operand 13 states. [2018-06-22 01:03:44,459 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 01:03:44,978 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-06-22 01:03:45,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:45,233 INFO ]: Finished difference Result 97 states and 112 transitions. [2018-06-22 01:03:45,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:03:45,235 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:03:45,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:45,245 INFO ]: With dead ends: 97 [2018-06-22 01:03:45,245 INFO ]: Without dead ends: 94 [2018-06-22 01:03:45,248 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:03:45,266 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 01:03:45,286 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 58. [2018-06-22 01:03:45,288 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 01:03:45,289 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-06-22 01:03:45,290 INFO ]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 19 [2018-06-22 01:03:45,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:45,290 INFO ]: Abstraction has 58 states and 66 transitions. [2018-06-22 01:03:45,290 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:03:45,290 INFO ]: Start isEmpty. Operand 58 states and 66 transitions. [2018-06-22 01:03:45,292 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:45,292 INFO ]: Found error trace [2018-06-22 01:03:45,292 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:45,292 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:45,292 INFO ]: Analyzing trace with hash -714472129, now seen corresponding path program 1 times [2018-06-22 01:03:45,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:45,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:45,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:45,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:45,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:45,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:46,069 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:46,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:46,102 INFO ]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-06-22 01:03:46,105 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:03:46,106 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:03:46,106 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:03:46,107 INFO ]: Start difference. First operand 58 states and 66 transitions. Second operand 27 states. [2018-06-22 01:03:47,907 WARN ]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-06-22 01:03:49,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:49,692 INFO ]: Finished difference Result 230 states and 267 transitions. [2018-06-22 01:03:49,694 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-22 01:03:49,694 INFO ]: Start accepts. Automaton has 27 states. Word has length 44 [2018-06-22 01:03:49,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:49,703 INFO ]: With dead ends: 230 [2018-06-22 01:03:49,703 INFO ]: Without dead ends: 229 [2018-06-22 01:03:49,710 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2636 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-06-22 01:03:49,711 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-22 01:03:49,726 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 78. [2018-06-22 01:03:49,726 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 01:03:49,728 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-06-22 01:03:49,728 INFO ]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 44 [2018-06-22 01:03:49,728 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:49,728 INFO ]: Abstraction has 78 states and 89 transitions. [2018-06-22 01:03:49,728 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:03:49,728 INFO ]: Start isEmpty. Operand 78 states and 89 transitions. [2018-06-22 01:03:49,730 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:03:49,730 INFO ]: Found error trace [2018-06-22 01:03:49,730 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:49,730 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:49,730 INFO ]: Analyzing trace with hash -1043112705, now seen corresponding path program 1 times [2018-06-22 01:03:49,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:49,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:49,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:49,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:49,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:49,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:50,232 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:50,232 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:50,232 INFO ]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-06-22 01:03:50,233 INFO ]: Interpolant automaton has 27 states [2018-06-22 01:03:50,233 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 01:03:50,233 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:03:50,233 INFO ]: Start difference. First operand 78 states and 89 transitions. Second operand 27 states. [2018-06-22 01:03:52,447 WARN ]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:03:52,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:52,791 INFO ]: Finished difference Result 183 states and 212 transitions. [2018-06-22 01:03:52,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-22 01:03:52,793 INFO ]: Start accepts. Automaton has 27 states. Word has length 44 [2018-06-22 01:03:52,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:52,795 INFO ]: With dead ends: 183 [2018-06-22 01:03:52,795 INFO ]: Without dead ends: 179 [2018-06-22 01:03:52,799 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1608, Invalid=4398, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 01:03:52,799 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 01:03:52,806 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 75. [2018-06-22 01:03:52,806 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 01:03:52,808 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-06-22 01:03:52,809 INFO ]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 44 [2018-06-22 01:03:52,809 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:52,809 INFO ]: Abstraction has 75 states and 85 transitions. [2018-06-22 01:03:52,809 INFO ]: Interpolant automaton has 27 states. [2018-06-22 01:03:52,809 INFO ]: Start isEmpty. Operand 75 states and 85 transitions. [2018-06-22 01:03:52,810 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 01:03:52,810 INFO ]: Found error trace [2018-06-22 01:03:52,810 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:52,810 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:52,811 INFO ]: Analyzing trace with hash -538427477, now seen corresponding path program 1 times [2018-06-22 01:03:52,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:52,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:52,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:52,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:52,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:52,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:53,040 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:53,040 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:53,040 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:03:53,040 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:03:53,040 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:03:53,040 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:03:53,041 INFO ]: Start difference. First operand 75 states and 85 transitions. Second operand 8 states. [2018-06-22 01:03:53,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:53,253 INFO ]: Finished difference Result 204 states and 235 transitions. [2018-06-22 01:03:53,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:03:53,253 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-22 01:03:53,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:53,255 INFO ]: With dead ends: 204 [2018-06-22 01:03:53,255 INFO ]: Without dead ends: 203 [2018-06-22 01:03:53,255 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:53,255 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-22 01:03:53,264 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 80. [2018-06-22 01:03:53,264 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 01:03:53,265 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-06-22 01:03:53,265 INFO ]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 50 [2018-06-22 01:03:53,265 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:53,265 INFO ]: Abstraction has 80 states and 91 transitions. [2018-06-22 01:03:53,265 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:03:53,266 INFO ]: Start isEmpty. Operand 80 states and 91 transitions. [2018-06-22 01:03:53,267 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-22 01:03:53,267 INFO ]: Found error trace [2018-06-22 01:03:53,267 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:53,267 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:53,267 INFO ]: Analyzing trace with hash 870408171, now seen corresponding path program 1 times [2018-06-22 01:03:53,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:53,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:53,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:53,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:53,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:53,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:53,452 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:53,452 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:53,452 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:03:53,452 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:03:53,453 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:03:53,453 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:03:53,453 INFO ]: Start difference. First operand 80 states and 91 transitions. Second operand 8 states. [2018-06-22 01:03:53,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:53,524 INFO ]: Finished difference Result 74 states and 82 transitions. [2018-06-22 01:03:53,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:03:53,525 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-22 01:03:53,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:53,525 INFO ]: With dead ends: 74 [2018-06-22 01:03:53,525 INFO ]: Without dead ends: 72 [2018-06-22 01:03:53,525 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:03:53,525 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 01:03:53,529 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 01:03:53,529 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:03:53,530 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-06-22 01:03:53,530 INFO ]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 50 [2018-06-22 01:03:53,531 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:53,531 INFO ]: Abstraction has 72 states and 79 transitions. [2018-06-22 01:03:53,531 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:03:53,531 INFO ]: Start isEmpty. Operand 72 states and 79 transitions. [2018-06-22 01:03:53,533 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:03:53,533 INFO ]: Found error trace [2018-06-22 01:03:53,533 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:53,533 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:53,533 INFO ]: Analyzing trace with hash 1833321901, now seen corresponding path program 1 times [2018-06-22 01:03:53,533 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:53,533 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:53,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:53,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:53,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:53,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:53,702 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:53,702 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:53,702 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:03:53,702 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:03:53,702 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:03:53,702 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:03:53,703 INFO ]: Start difference. First operand 72 states and 79 transitions. Second operand 10 states. [2018-06-22 01:03:54,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:54,021 INFO ]: Finished difference Result 282 states and 317 transitions. [2018-06-22 01:03:54,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:03:54,021 INFO ]: Start accepts. Automaton has 10 states. Word has length 52 [2018-06-22 01:03:54,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:54,024 INFO ]: With dead ends: 282 [2018-06-22 01:03:54,024 INFO ]: Without dead ends: 281 [2018-06-22 01:03:54,025 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:03:54,025 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 01:03:54,032 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 79. [2018-06-22 01:03:54,032 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:03:54,033 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-06-22 01:03:54,033 INFO ]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 52 [2018-06-22 01:03:54,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:54,033 INFO ]: Abstraction has 79 states and 88 transitions. [2018-06-22 01:03:54,033 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:03:54,033 INFO ]: Start isEmpty. Operand 79 states and 88 transitions. [2018-06-22 01:03:54,035 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:03:54,035 INFO ]: Found error trace [2018-06-22 01:03:54,035 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:54,035 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:54,035 INFO ]: Analyzing trace with hash 1438375277, now seen corresponding path program 1 times [2018-06-22 01:03:54,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:54,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:54,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:54,036 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:54,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:54,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:54,259 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:54,259 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:54,259 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:03:54,260 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:03:54,260 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:03:54,260 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:03:54,260 INFO ]: Start difference. First operand 79 states and 88 transitions. Second operand 10 states. [2018-06-22 01:03:54,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:54,548 INFO ]: Finished difference Result 120 states and 132 transitions. [2018-06-22 01:03:54,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:03:54,548 INFO ]: Start accepts. Automaton has 10 states. Word has length 52 [2018-06-22 01:03:54,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:54,549 INFO ]: With dead ends: 120 [2018-06-22 01:03:54,549 INFO ]: Without dead ends: 116 [2018-06-22 01:03:54,549 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:03:54,549 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 01:03:54,554 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 76. [2018-06-22 01:03:54,554 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:03:54,555 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-06-22 01:03:54,555 INFO ]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 52 [2018-06-22 01:03:54,555 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:54,555 INFO ]: Abstraction has 76 states and 83 transitions. [2018-06-22 01:03:54,555 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:03:54,555 INFO ]: Start isEmpty. Operand 76 states and 83 transitions. [2018-06-22 01:03:54,556 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:03:54,556 INFO ]: Found error trace [2018-06-22 01:03:54,556 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:54,556 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:54,556 INFO ]: Analyzing trace with hash -714426515, now seen corresponding path program 1 times [2018-06-22 01:03:54,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:54,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:54,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:54,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:54,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:54,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:54,923 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:54,923 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:54,923 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:03:54,924 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:03:54,924 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:03:54,925 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:03:54,925 INFO ]: Start difference. First operand 76 states and 83 transitions. Second operand 10 states. [2018-06-22 01:03:55,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:55,420 INFO ]: Finished difference Result 420 states and 467 transitions. [2018-06-22 01:03:55,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-22 01:03:55,421 INFO ]: Start accepts. Automaton has 10 states. Word has length 52 [2018-06-22 01:03:55,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:55,423 INFO ]: With dead ends: 420 [2018-06-22 01:03:55,423 INFO ]: Without dead ends: 419 [2018-06-22 01:03:55,424 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:03:55,424 INFO ]: Start minimizeSevpa. Operand 419 states. [2018-06-22 01:03:55,432 INFO ]: Finished minimizeSevpa. Reduced states from 419 to 79. [2018-06-22 01:03:55,432 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:03:55,433 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-06-22 01:03:55,433 INFO ]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 52 [2018-06-22 01:03:55,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:55,433 INFO ]: Abstraction has 79 states and 87 transitions. [2018-06-22 01:03:55,433 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:03:55,433 INFO ]: Start isEmpty. Operand 79 states and 87 transitions. [2018-06-22 01:03:55,434 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:03:55,434 INFO ]: Found error trace [2018-06-22 01:03:55,434 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:55,434 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:55,434 INFO ]: Analyzing trace with hash -1109373139, now seen corresponding path program 1 times [2018-06-22 01:03:55,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:55,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:55,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:55,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:55,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:55,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:56,149 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:56,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:56,169 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:03:56,169 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:03:56,169 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:03:56,169 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:03:56,169 INFO ]: Start difference. First operand 79 states and 87 transitions. Second operand 10 states. [2018-06-22 01:03:56,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:56,423 INFO ]: Finished difference Result 190 states and 208 transitions. [2018-06-22 01:03:56,424 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:03:56,424 INFO ]: Start accepts. Automaton has 10 states. Word has length 52 [2018-06-22 01:03:56,424 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:56,425 INFO ]: With dead ends: 190 [2018-06-22 01:03:56,425 INFO ]: Without dead ends: 187 [2018-06-22 01:03:56,426 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:03:56,426 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-22 01:03:56,429 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 77. [2018-06-22 01:03:56,430 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 01:03:56,430 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-06-22 01:03:56,431 INFO ]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 52 [2018-06-22 01:03:56,431 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:56,431 INFO ]: Abstraction has 77 states and 84 transitions. [2018-06-22 01:03:56,431 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:03:56,431 INFO ]: Start isEmpty. Operand 77 states and 84 transitions. [2018-06-22 01:03:56,432 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:03:56,432 INFO ]: Found error trace [2018-06-22 01:03:56,432 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:56,432 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:56,432 INFO ]: Analyzing trace with hash -1206736541, now seen corresponding path program 1 times [2018-06-22 01:03:56,432 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:56,432 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:56,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:56,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:56,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:56,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:56,659 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:56,659 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:56,659 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:03:56,659 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:03:56,660 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:03:56,660 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:03:56,660 INFO ]: Start difference. First operand 77 states and 84 transitions. Second operand 10 states. [2018-06-22 01:03:56,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:56,962 INFO ]: Finished difference Result 333 states and 367 transitions. [2018-06-22 01:03:56,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 01:03:56,962 INFO ]: Start accepts. Automaton has 10 states. Word has length 52 [2018-06-22 01:03:56,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:56,964 INFO ]: With dead ends: 333 [2018-06-22 01:03:56,964 INFO ]: Without dead ends: 332 [2018-06-22 01:03:56,965 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:03:56,965 INFO ]: Start minimizeSevpa. Operand 332 states. [2018-06-22 01:03:56,970 INFO ]: Finished minimizeSevpa. Reduced states from 332 to 79. [2018-06-22 01:03:56,970 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:03:56,971 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-06-22 01:03:56,971 INFO ]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 52 [2018-06-22 01:03:56,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:56,971 INFO ]: Abstraction has 79 states and 86 transitions. [2018-06-22 01:03:56,971 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:03:56,971 INFO ]: Start isEmpty. Operand 79 states and 86 transitions. [2018-06-22 01:03:56,974 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-22 01:03:56,974 INFO ]: Found error trace [2018-06-22 01:03:56,974 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:56,974 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:56,974 INFO ]: Analyzing trace with hash -1601683165, now seen corresponding path program 1 times [2018-06-22 01:03:56,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:56,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:56,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:56,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:56,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:57,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:57,720 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:57,720 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:57,720 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:03:57,720 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:03:57,720 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:03:57,720 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:03:57,720 INFO ]: Start difference. First operand 79 states and 86 transitions. Second operand 10 states. [2018-06-22 01:03:57,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:57,827 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-22 01:03:57,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:03:57,828 INFO ]: Start accepts. Automaton has 10 states. Word has length 52 [2018-06-22 01:03:57,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:57,828 INFO ]: With dead ends: 34 [2018-06-22 01:03:57,828 INFO ]: Without dead ends: 0 [2018-06-22 01:03:57,828 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:03:57,828 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:03:57,828 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:03:57,828 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:03:57,828 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:03:57,828 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-06-22 01:03:57,828 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:57,828 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:03:57,828 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:03:57,828 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:03:57,829 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:03:57,832 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:03:57 BoogieIcfgContainer [2018-06-22 01:03:57,832 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:03:57,833 INFO ]: Toolchain (without parser) took 17247.63 ms. Allocated memory was 305.1 MB in the beginning and 557.3 MB in the end (delta: 252.2 MB). Free memory was 211.1 MB in the beginning and 353.3 MB in the end (delta: -142.1 MB). Peak memory consumption was 110.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:57,834 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:03:57,834 INFO ]: ChcToBoogie took 102.80 ms. Allocated memory is still 305.1 MB. Free memory was 211.1 MB in the beginning and 207.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:57,834 INFO ]: Boogie Preprocessor took 86.78 ms. Allocated memory is still 305.1 MB. Free memory was 207.2 MB in the beginning and 205.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 01:03:57,834 INFO ]: RCFGBuilder took 1283.27 ms. Allocated memory was 305.1 MB in the beginning and 329.3 MB in the end (delta: 24.1 MB). Free memory was 205.2 MB in the beginning and 234.0 MB in the end (delta: -28.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:57,835 INFO ]: TraceAbstraction took 15762.81 ms. Allocated memory was 329.3 MB in the beginning and 557.3 MB in the end (delta: 228.1 MB). Free memory was 231.6 MB in the beginning and 353.3 MB in the end (delta: -121.6 MB). Peak memory consumption was 106.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:03:57,837 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 305.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 102.80 ms. Allocated memory is still 305.1 MB. Free memory was 211.1 MB in the beginning and 207.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 86.78 ms. Allocated memory is still 305.1 MB. Free memory was 207.2 MB in the beginning and 205.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1283.27 ms. Allocated memory was 305.1 MB in the beginning and 329.3 MB in the end (delta: 24.1 MB). Free memory was 205.2 MB in the beginning and 234.0 MB in the end (delta: -28.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15762.81 ms. Allocated memory was 329.3 MB in the beginning and 557.3 MB in the end (delta: 228.1 MB). Free memory was 231.6 MB in the beginning and 353.3 MB in the end (delta: -121.6 MB). Peak memory consumption was 106.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. SAFE Result, 15.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 956 SDtfs, 6871 SDslu, 8579 SDs, 0 SdLazy, 1589 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1359 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 36386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 72/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/33.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-03-57-854.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/33.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-03-57-854.csv Received shutdown request...