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/46.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:07:38,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:07:38,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:07:38,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:07:38,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:07:38,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:07:38,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:07:38,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:07:38,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:07:38,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:07:38,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:07:38,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:07:38,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:07:38,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:07:38,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:07:38,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:07:38,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:07:38,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:07:38,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:07:38,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:07:38,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:07:38,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:07:38,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:07:38,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:07:38,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:07:38,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:07:38,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:07:38,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:07:38,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:07:38,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:07:38,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:07:38,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:07:38,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:07:38,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:07:38,416 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:07:38,416 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:07:38,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:07:38,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:07:38,439 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:07:38,439 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:07:38,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:07:38,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:07:38,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:07:38,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:07:38,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:07:38,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:07:38,442 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:07:38,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:07:38,442 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:07:38,442 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:07:38,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:07:38,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:07:38,443 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:07:38,446 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:07:38,446 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:07:38,495 INFO ]: Repository-Root is: /tmp [2018-06-22 01:07:38,512 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:07:38,516 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:07:38,517 INFO ]: Initializing SmtParser... [2018-06-22 01:07:38,518 INFO ]: SmtParser initialized [2018-06-22 01:07:38,518 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 [2018-06-22 01:07:38,520 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:07:38,609 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 unknown [2018-06-22 01:07:39,051 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/46.c.smt2 [2018-06-22 01:07:39,060 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:07:39,074 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:07:39,074 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:07:39,074 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:07:39,075 INFO ]: ChcToBoogie initialized [2018-06-22 01:07:39,087 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,176 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39 Unit [2018-06-22 01:07:39,176 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:07:39,177 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:07:39,177 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:07:39,177 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:07:39,195 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,195 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,206 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,206 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,214 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,224 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,229 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... [2018-06-22 01:07:39,233 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:07:39,233 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:07:39,233 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:07:39,233 INFO ]: RCFGBuilder initialized [2018-06-22 01:07:39,234 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:07:39,256 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:07:39,257 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:07:39,257 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:07:39,257 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:07:39,257 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:07:39,257 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:07:39,890 INFO ]: Using library mode [2018-06-22 01:07:39,891 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:07:39 BoogieIcfgContainer [2018-06-22 01:07:39,891 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:07:39,893 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:07:39,893 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:07:39,896 INFO ]: TraceAbstraction initialized [2018-06-22 01:07:39,896 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:07:39" (1/3) ... [2018-06-22 01:07:39,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fc0fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:07:39, skipping insertion in model container [2018-06-22 01:07:39,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:39" (2/3) ... [2018-06-22 01:07:39,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fc0fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:07:39, skipping insertion in model container [2018-06-22 01:07:39,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:07:39" (3/3) ... [2018-06-22 01:07:39,899 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:07:39,909 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:07:39,918 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:07:39,960 INFO ]: Using default assertion order modulation [2018-06-22 01:07:39,961 INFO ]: Interprodecural is true [2018-06-22 01:07:39,961 INFO ]: Hoare is false [2018-06-22 01:07:39,961 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:07:39,961 INFO ]: Backedges is TWOTRACK [2018-06-22 01:07:39,961 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:07:39,961 INFO ]: Difference is false [2018-06-22 01:07:39,961 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:07:39,961 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:07:39,976 INFO ]: Start isEmpty. Operand 34 states. [2018-06-22 01:07:39,987 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:07:39,987 INFO ]: Found error trace [2018-06-22 01:07:39,987 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:07:39,987 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:39,991 INFO ]: Analyzing trace with hash -452840766, now seen corresponding path program 1 times [2018-06-22 01:07:39,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:39,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:40,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:40,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:40,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:40,125 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:40,853 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:07:40,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:40,858 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:07:40,860 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:07:40,877 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:07:40,878 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:07:40,881 INFO ]: Start difference. First operand 34 states. Second operand 13 states. [2018-06-22 01:07:41,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:41,663 INFO ]: Finished difference Result 54 states and 64 transitions. [2018-06-22 01:07:41,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:07:41,664 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 01:07:41,664 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:41,671 INFO ]: With dead ends: 54 [2018-06-22 01:07:41,671 INFO ]: Without dead ends: 51 [2018-06-22 01:07:41,674 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:07:41,688 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 01:07:41,705 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-06-22 01:07:41,706 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 01:07:41,707 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-06-22 01:07:41,708 INFO ]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 19 [2018-06-22 01:07:41,708 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:41,709 INFO ]: Abstraction has 36 states and 43 transitions. [2018-06-22 01:07:41,709 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:07:41,709 INFO ]: Start isEmpty. Operand 36 states and 43 transitions. [2018-06-22 01:07:41,710 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:41,710 INFO ]: Found error trace [2018-06-22 01:07:41,710 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] [2018-06-22 01:07:41,710 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:41,710 INFO ]: Analyzing trace with hash -308902300, now seen corresponding path program 1 times [2018-06-22 01:07:41,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:41,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:41,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:41,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:41,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:41,754 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:41,928 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:07:41,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:41,928 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:41,930 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:41,930 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:41,930 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:41,930 INFO ]: Start difference. First operand 36 states and 43 transitions. Second operand 11 states. [2018-06-22 01:07:42,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:42,585 INFO ]: Finished difference Result 162 states and 203 transitions. [2018-06-22 01:07:42,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:07:42,586 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:42,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:42,597 INFO ]: With dead ends: 162 [2018-06-22 01:07:42,597 INFO ]: Without dead ends: 161 [2018-06-22 01:07:42,598 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:42,599 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 01:07:42,614 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 40. [2018-06-22 01:07:42,614 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:07:42,615 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-06-22 01:07:42,615 INFO ]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2018-06-22 01:07:42,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:42,616 INFO ]: Abstraction has 40 states and 49 transitions. [2018-06-22 01:07:42,616 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:42,616 INFO ]: Start isEmpty. Operand 40 states and 49 transitions. [2018-06-22 01:07:42,616 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:42,616 INFO ]: Found error trace [2018-06-22 01:07:42,617 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] [2018-06-22 01:07:42,617 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:42,617 INFO ]: Analyzing trace with hash -637542876, now seen corresponding path program 1 times [2018-06-22 01:07:42,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:42,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:42,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:42,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:42,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:42,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:42,790 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:07:42,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:42,790 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:42,790 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:42,790 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:42,790 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:42,790 INFO ]: Start difference. First operand 40 states and 49 transitions. Second operand 11 states. [2018-06-22 01:07:43,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:43,050 INFO ]: Finished difference Result 96 states and 117 transitions. [2018-06-22 01:07:43,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:07:43,051 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:43,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:43,052 INFO ]: With dead ends: 96 [2018-06-22 01:07:43,052 INFO ]: Without dead ends: 93 [2018-06-22 01:07:43,053 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:07:43,053 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 01:07:43,058 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 38. [2018-06-22 01:07:43,058 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:07:43,058 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-06-22 01:07:43,059 INFO ]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2018-06-22 01:07:43,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:43,059 INFO ]: Abstraction has 38 states and 46 transitions. [2018-06-22 01:07:43,059 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:43,059 INFO ]: Start isEmpty. Operand 38 states and 46 transitions. [2018-06-22 01:07:43,059 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:43,059 INFO ]: Found error trace [2018-06-22 01:07:43,060 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] [2018-06-22 01:07:43,060 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:43,060 INFO ]: Analyzing trace with hash 647470554, now seen corresponding path program 1 times [2018-06-22 01:07:43,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:43,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:43,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:43,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:43,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:43,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:43,829 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:07:43,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:43,830 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:43,830 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:43,830 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:43,830 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:43,830 INFO ]: Start difference. First operand 38 states and 46 transitions. Second operand 11 states. [2018-06-22 01:07:44,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:44,297 INFO ]: Finished difference Result 161 states and 201 transitions. [2018-06-22 01:07:44,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:07:44,298 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:44,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:44,300 INFO ]: With dead ends: 161 [2018-06-22 01:07:44,300 INFO ]: Without dead ends: 160 [2018-06-22 01:07:44,300 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:44,301 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-22 01:07:44,308 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 40. [2018-06-22 01:07:44,308 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:07:44,309 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-06-22 01:07:44,309 INFO ]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 28 [2018-06-22 01:07:44,309 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:44,309 INFO ]: Abstraction has 40 states and 48 transitions. [2018-06-22 01:07:44,309 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:44,309 INFO ]: Start isEmpty. Operand 40 states and 48 transitions. [2018-06-22 01:07:44,310 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:44,310 INFO ]: Found error trace [2018-06-22 01:07:44,310 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] [2018-06-22 01:07:44,310 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:44,310 INFO ]: Analyzing trace with hash 318829978, now seen corresponding path program 1 times [2018-06-22 01:07:44,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:44,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:44,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:44,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:44,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:44,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:44,410 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:07:44,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:44,411 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:44,411 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:44,411 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:44,411 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:44,411 INFO ]: Start difference. First operand 40 states and 48 transitions. Second operand 11 states. [2018-06-22 01:07:44,911 WARN ]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 01:07:45,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:45,167 INFO ]: Finished difference Result 95 states and 115 transitions. [2018-06-22 01:07:45,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:07:45,168 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:45,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:45,169 INFO ]: With dead ends: 95 [2018-06-22 01:07:45,169 INFO ]: Without dead ends: 92 [2018-06-22 01:07:45,169 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:07:45,170 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-22 01:07:45,173 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 38. [2018-06-22 01:07:45,174 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:07:45,174 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-06-22 01:07:45,174 INFO ]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-06-22 01:07:45,174 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:45,174 INFO ]: Abstraction has 38 states and 45 transitions. [2018-06-22 01:07:45,174 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:45,175 INFO ]: Start isEmpty. Operand 38 states and 45 transitions. [2018-06-22 01:07:45,175 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:45,175 INFO ]: Found error trace [2018-06-22 01:07:45,175 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] [2018-06-22 01:07:45,175 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:45,176 INFO ]: Analyzing trace with hash -1621754230, now seen corresponding path program 1 times [2018-06-22 01:07:45,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:45,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:45,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:45,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:45,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:45,190 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:45,439 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:07:45,440 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:45,464 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:45,465 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:45,465 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:45,465 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:45,465 INFO ]: Start difference. First operand 38 states and 45 transitions. Second operand 11 states. [2018-06-22 01:07:45,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:45,899 INFO ]: Finished difference Result 163 states and 204 transitions. [2018-06-22 01:07:45,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:07:45,899 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:45,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:45,901 INFO ]: With dead ends: 163 [2018-06-22 01:07:45,901 INFO ]: Without dead ends: 162 [2018-06-22 01:07:45,901 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:45,902 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-22 01:07:45,910 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 42. [2018-06-22 01:07:45,910 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:07:45,911 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-06-22 01:07:45,911 INFO ]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 28 [2018-06-22 01:07:45,911 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:45,911 INFO ]: Abstraction has 42 states and 51 transitions. [2018-06-22 01:07:45,911 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:45,911 INFO ]: Start isEmpty. Operand 42 states and 51 transitions. [2018-06-22 01:07:45,912 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:45,912 INFO ]: Found error trace [2018-06-22 01:07:45,912 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] [2018-06-22 01:07:45,912 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:45,912 INFO ]: Analyzing trace with hash -1950394806, now seen corresponding path program 1 times [2018-06-22 01:07:45,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:45,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:45,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:45,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:45,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:45,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:46,030 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:07:46,030 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:46,030 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:46,030 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:46,031 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:46,031 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:46,031 INFO ]: Start difference. First operand 42 states and 51 transitions. Second operand 11 states. [2018-06-22 01:07:46,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:46,707 INFO ]: Finished difference Result 97 states and 118 transitions. [2018-06-22 01:07:46,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:07:46,710 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:46,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:46,711 INFO ]: With dead ends: 97 [2018-06-22 01:07:46,711 INFO ]: Without dead ends: 94 [2018-06-22 01:07:46,711 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:07:46,711 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 01:07:46,714 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 40. [2018-06-22 01:07:46,714 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:07:46,715 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-06-22 01:07:46,715 INFO ]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 28 [2018-06-22 01:07:46,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:46,715 INFO ]: Abstraction has 40 states and 48 transitions. [2018-06-22 01:07:46,715 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:46,715 INFO ]: Start isEmpty. Operand 40 states and 48 transitions. [2018-06-22 01:07:46,716 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:46,716 INFO ]: Found error trace [2018-06-22 01:07:46,716 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] [2018-06-22 01:07:46,716 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:46,716 INFO ]: Analyzing trace with hash -665381376, now seen corresponding path program 1 times [2018-06-22 01:07:46,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:46,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:46,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:46,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:46,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:46,729 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:46,811 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:07:46,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:46,811 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:46,811 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:46,812 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:46,812 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:46,812 INFO ]: Start difference. First operand 40 states and 48 transitions. Second operand 11 states. [2018-06-22 01:07:47,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:47,152 INFO ]: Finished difference Result 162 states and 202 transitions. [2018-06-22 01:07:47,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:07:47,153 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:47,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:47,155 INFO ]: With dead ends: 162 [2018-06-22 01:07:47,155 INFO ]: Without dead ends: 161 [2018-06-22 01:07:47,155 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:47,155 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-22 01:07:47,164 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 42. [2018-06-22 01:07:47,164 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:07:47,165 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-06-22 01:07:47,165 INFO ]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 28 [2018-06-22 01:07:47,165 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:47,165 INFO ]: Abstraction has 42 states and 50 transitions. [2018-06-22 01:07:47,165 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:47,165 INFO ]: Start isEmpty. Operand 42 states and 50 transitions. [2018-06-22 01:07:47,166 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:07:47,166 INFO ]: Found error trace [2018-06-22 01:07:47,166 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] [2018-06-22 01:07:47,166 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:47,166 INFO ]: Analyzing trace with hash -994021952, now seen corresponding path program 1 times [2018-06-22 01:07:47,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:47,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:47,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:47,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:47,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:47,179 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:47,965 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:07:47,965 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:47,965 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:47,965 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:47,965 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:47,965 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:47,966 INFO ]: Start difference. First operand 42 states and 50 transitions. Second operand 11 states. [2018-06-22 01:07:48,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:48,210 INFO ]: Finished difference Result 96 states and 116 transitions. [2018-06-22 01:07:48,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 01:07:48,210 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-22 01:07:48,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:48,211 INFO ]: With dead ends: 96 [2018-06-22 01:07:48,211 INFO ]: Without dead ends: 93 [2018-06-22 01:07:48,211 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:07:48,211 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 01:07:48,214 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 39. [2018-06-22 01:07:48,214 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:07:48,215 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-22 01:07:48,215 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 28 [2018-06-22 01:07:48,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:48,215 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-22 01:07:48,215 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:48,215 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-22 01:07:48,216 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:48,216 INFO ]: Found error trace [2018-06-22 01:07:48,216 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] [2018-06-22 01:07:48,216 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:48,216 INFO ]: Analyzing trace with hash 1807074692, now seen corresponding path program 1 times [2018-06-22 01:07:48,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:48,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:48,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:48,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:48,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:48,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:48,397 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:07:48,398 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:48,398 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:48,398 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:48,398 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:48,398 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:48,398 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 12 states. [2018-06-22 01:07:48,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:48,861 INFO ]: Finished difference Result 160 states and 199 transitions. [2018-06-22 01:07:48,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:07:48,861 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:48,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:48,862 INFO ]: With dead ends: 160 [2018-06-22 01:07:48,862 INFO ]: Without dead ends: 159 [2018-06-22 01:07:48,862 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:07:48,862 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 01:07:48,866 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 44. [2018-06-22 01:07:48,866 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:07:48,867 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-06-22 01:07:48,867 INFO ]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 29 [2018-06-22 01:07:48,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:48,867 INFO ]: Abstraction has 44 states and 53 transitions. [2018-06-22 01:07:48,867 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:48,867 INFO ]: Start isEmpty. Operand 44 states and 53 transitions. [2018-06-22 01:07:48,868 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:48,868 INFO ]: Found error trace [2018-06-22 01:07:48,868 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] [2018-06-22 01:07:48,868 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:48,868 INFO ]: Analyzing trace with hash 1478434116, now seen corresponding path program 1 times [2018-06-22 01:07:48,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:48,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:48,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:48,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:48,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:48,887 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:49,154 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:07:49,154 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:49,154 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:49,154 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:49,154 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:49,154 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:49,154 INFO ]: Start difference. First operand 44 states and 53 transitions. Second operand 12 states. [2018-06-22 01:07:49,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:49,417 INFO ]: Finished difference Result 94 states and 113 transitions. [2018-06-22 01:07:49,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:07:49,419 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:49,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:49,420 INFO ]: With dead ends: 94 [2018-06-22 01:07:49,420 INFO ]: Without dead ends: 91 [2018-06-22 01:07:49,420 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:07:49,420 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 01:07:49,423 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 42. [2018-06-22 01:07:49,423 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:07:49,423 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-06-22 01:07:49,423 INFO ]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 29 [2018-06-22 01:07:49,423 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:49,423 INFO ]: Abstraction has 42 states and 50 transitions. [2018-06-22 01:07:49,423 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:49,424 INFO ]: Start isEmpty. Operand 42 states and 50 transitions. [2018-06-22 01:07:49,424 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:49,424 INFO ]: Found error trace [2018-06-22 01:07:49,424 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] [2018-06-22 01:07:49,424 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:49,425 INFO ]: Analyzing trace with hash -1531519750, now seen corresponding path program 1 times [2018-06-22 01:07:49,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:49,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:49,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:49,425 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:49,425 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:49,436 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:49,538 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:07:49,538 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:49,538 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:49,538 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:49,538 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:49,538 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:49,538 INFO ]: Start difference. First operand 42 states and 50 transitions. Second operand 12 states. [2018-06-22 01:07:49,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:49,962 INFO ]: Finished difference Result 159 states and 197 transitions. [2018-06-22 01:07:49,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 01:07:49,962 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:49,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:49,963 INFO ]: With dead ends: 159 [2018-06-22 01:07:49,963 INFO ]: Without dead ends: 158 [2018-06-22 01:07:49,964 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:07:49,964 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-22 01:07:49,966 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 44. [2018-06-22 01:07:49,966 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:07:49,967 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-06-22 01:07:49,967 INFO ]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 29 [2018-06-22 01:07:49,967 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:49,967 INFO ]: Abstraction has 44 states and 52 transitions. [2018-06-22 01:07:49,967 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:49,967 INFO ]: Start isEmpty. Operand 44 states and 52 transitions. [2018-06-22 01:07:49,968 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:49,968 INFO ]: Found error trace [2018-06-22 01:07:49,968 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] [2018-06-22 01:07:49,968 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:49,968 INFO ]: Analyzing trace with hash -1860160326, now seen corresponding path program 1 times [2018-06-22 01:07:49,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:49,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:49,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:49,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:49,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:49,986 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:50,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:07:50,069 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:50,069 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:50,069 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:50,070 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:50,070 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:50,070 INFO ]: Start difference. First operand 44 states and 52 transitions. Second operand 12 states. [2018-06-22 01:07:50,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:50,797 INFO ]: Finished difference Result 93 states and 111 transitions. [2018-06-22 01:07:50,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 01:07:50,797 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:50,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:50,798 INFO ]: With dead ends: 93 [2018-06-22 01:07:50,798 INFO ]: Without dead ends: 90 [2018-06-22 01:07:50,798 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:07:50,798 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 01:07:50,801 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 41. [2018-06-22 01:07:50,801 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 01:07:50,801 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-06-22 01:07:50,801 INFO ]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 29 [2018-06-22 01:07:50,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:50,801 INFO ]: Abstraction has 41 states and 48 transitions. [2018-06-22 01:07:50,801 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:50,801 INFO ]: Start isEmpty. Operand 41 states and 48 transitions. [2018-06-22 01:07:50,802 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:50,802 INFO ]: Found error trace [2018-06-22 01:07:50,802 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] [2018-06-22 01:07:50,802 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:50,802 INFO ]: Analyzing trace with hash -1080436690, now seen corresponding path program 1 times [2018-06-22 01:07:50,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:50,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:50,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:50,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:50,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:50,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:50,983 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:07:50,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:50,983 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:50,983 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:50,983 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:50,983 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:50,983 INFO ]: Start difference. First operand 41 states and 48 transitions. Second operand 12 states. [2018-06-22 01:07:51,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:51,374 INFO ]: Finished difference Result 141 states and 174 transitions. [2018-06-22 01:07:51,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:07:51,374 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:51,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:51,375 INFO ]: With dead ends: 141 [2018-06-22 01:07:51,375 INFO ]: Without dead ends: 140 [2018-06-22 01:07:51,375 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:07:51,376 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 01:07:51,378 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 45. [2018-06-22 01:07:51,378 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 01:07:51,380 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-22 01:07:51,380 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 29 [2018-06-22 01:07:51,380 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:51,380 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-22 01:07:51,380 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:51,380 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-22 01:07:51,380 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:51,380 INFO ]: Found error trace [2018-06-22 01:07:51,381 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] [2018-06-22 01:07:51,381 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:51,381 INFO ]: Analyzing trace with hash -1409077266, now seen corresponding path program 1 times [2018-06-22 01:07:51,381 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:51,381 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:51,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:51,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:51,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:51,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:51,519 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:07:51,519 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:51,519 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:51,519 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:51,519 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:51,519 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:51,520 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 12 states. [2018-06-22 01:07:51,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:51,672 INFO ]: Finished difference Result 54 states and 61 transitions. [2018-06-22 01:07:51,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:07:51,672 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:51,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:51,672 INFO ]: With dead ends: 54 [2018-06-22 01:07:51,672 INFO ]: Without dead ends: 48 [2018-06-22 01:07:51,673 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:07:51,673 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:07:51,674 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-06-22 01:07:51,674 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 01:07:51,675 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-06-22 01:07:51,675 INFO ]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 29 [2018-06-22 01:07:51,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:51,675 INFO ]: Abstraction has 40 states and 46 transitions. [2018-06-22 01:07:51,675 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:51,675 INFO ]: Start isEmpty. Operand 40 states and 46 transitions. [2018-06-22 01:07:51,676 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:51,676 INFO ]: Found error trace [2018-06-22 01:07:51,676 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] [2018-06-22 01:07:51,676 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:51,676 INFO ]: Analyzing trace with hash 1170826440, now seen corresponding path program 1 times [2018-06-22 01:07:51,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:51,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:51,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:51,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:51,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:51,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:51,944 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:07:51,944 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:51,944 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:51,945 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:51,945 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:51,945 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:51,945 INFO ]: Start difference. First operand 40 states and 46 transitions. Second operand 12 states. [2018-06-22 01:07:52,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:52,321 INFO ]: Finished difference Result 140 states and 172 transitions. [2018-06-22 01:07:52,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 01:07:52,321 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:52,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:52,322 INFO ]: With dead ends: 140 [2018-06-22 01:07:52,322 INFO ]: Without dead ends: 139 [2018-06-22 01:07:52,323 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 01:07:52,323 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 01:07:52,325 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 44. [2018-06-22 01:07:52,326 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:07:52,326 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-06-22 01:07:52,326 INFO ]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 29 [2018-06-22 01:07:52,326 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:52,326 INFO ]: Abstraction has 44 states and 50 transitions. [2018-06-22 01:07:52,326 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:52,326 INFO ]: Start isEmpty. Operand 44 states and 50 transitions. [2018-06-22 01:07:52,327 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:07:52,327 INFO ]: Found error trace [2018-06-22 01:07:52,327 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] [2018-06-22 01:07:52,327 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:52,327 INFO ]: Analyzing trace with hash 842185864, now seen corresponding path program 1 times [2018-06-22 01:07:52,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:52,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:52,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:52,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:52,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:52,337 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:52,497 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:07:52,497 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:52,497 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:52,497 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:52,497 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:52,497 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:52,497 INFO ]: Start difference. First operand 44 states and 50 transitions. Second operand 12 states. [2018-06-22 01:07:52,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:52,723 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-22 01:07:52,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:07:52,723 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-22 01:07:52,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:52,724 INFO ]: With dead ends: 53 [2018-06-22 01:07:52,724 INFO ]: Without dead ends: 47 [2018-06-22 01:07:52,724 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:07:52,724 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 01:07:52,725 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-22 01:07:52,725 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 01:07:52,726 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-06-22 01:07:52,726 INFO ]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 29 [2018-06-22 01:07:52,726 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:52,726 INFO ]: Abstraction has 39 states and 44 transitions. [2018-06-22 01:07:52,726 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:52,726 INFO ]: Start isEmpty. Operand 39 states and 44 transitions. [2018-06-22 01:07:52,726 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:07:52,726 INFO ]: Found error trace [2018-06-22 01:07:52,726 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] [2018-06-22 01:07:52,726 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:52,727 INFO ]: Analyzing trace with hash 90340622, now seen corresponding path program 1 times [2018-06-22 01:07:52,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:52,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:52,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:52,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:52,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:52,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:53,043 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:07:53,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:53,043 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:07:53,043 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:07:53,043 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:07:53,044 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:07:53,044 INFO ]: Start difference. First operand 39 states and 44 transitions. Second operand 13 states. [2018-06-22 01:07:53,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:53,387 INFO ]: Finished difference Result 130 states and 160 transitions. [2018-06-22 01:07:53,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 01:07:53,387 INFO ]: Start accepts. Automaton has 13 states. Word has length 30 [2018-06-22 01:07:53,387 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:53,388 INFO ]: With dead ends: 130 [2018-06-22 01:07:53,388 INFO ]: Without dead ends: 129 [2018-06-22 01:07:53,388 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 01:07:53,388 INFO ]: Start minimizeSevpa. Operand 129 states. [2018-06-22 01:07:53,391 INFO ]: Finished minimizeSevpa. Reduced states from 129 to 42. [2018-06-22 01:07:53,391 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 01:07:53,391 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-06-22 01:07:53,391 INFO ]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-06-22 01:07:53,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:53,391 INFO ]: Abstraction has 42 states and 47 transitions. [2018-06-22 01:07:53,391 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:07:53,391 INFO ]: Start isEmpty. Operand 42 states and 47 transitions. [2018-06-22 01:07:53,392 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:07:53,392 INFO ]: Found error trace [2018-06-22 01:07:53,392 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] [2018-06-22 01:07:53,392 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:53,392 INFO ]: Analyzing trace with hash -238299954, now seen corresponding path program 1 times [2018-06-22 01:07:53,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:53,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:53,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:53,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:53,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:53,406 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:53,518 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:07:53,518 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:53,518 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:07:53,518 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:07:53,518 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:07:53,518 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:07:53,518 INFO ]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-06-22 01:07:53,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:53,662 INFO ]: Finished difference Result 19 states and 18 transitions. [2018-06-22 01:07:53,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:07:53,662 INFO ]: Start accepts. Automaton has 13 states. Word has length 30 [2018-06-22 01:07:53,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:53,662 INFO ]: With dead ends: 19 [2018-06-22 01:07:53,662 INFO ]: Without dead ends: 0 [2018-06-22 01:07:53,662 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:07:53,662 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:07:53,662 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:07:53,662 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:07:53,662 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:07:53,662 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-06-22 01:07:53,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:53,662 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:07:53,662 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:07:53,662 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:07:53,662 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:07:53,666 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:07:53 BoogieIcfgContainer [2018-06-22 01:07:53,666 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:07:53,667 INFO ]: Toolchain (without parser) took 14606.14 ms. Allocated memory was 303.0 MB in the beginning and 461.9 MB in the end (delta: 158.9 MB). Free memory was 245.6 MB in the beginning and 299.3 MB in the end (delta: -53.8 MB). Peak memory consumption was 105.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:07:53,667 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:07:53,668 INFO ]: ChcToBoogie took 101.84 ms. Allocated memory is still 303.0 MB. Free memory was 244.5 MB in the beginning and 242.5 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:07:53,668 INFO ]: Boogie Preprocessor took 56.05 ms. Allocated memory is still 303.0 MB. Free memory was 242.5 MB in the beginning and 240.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:07:53,668 INFO ]: RCFGBuilder took 657.89 ms. Allocated memory is still 303.0 MB. Free memory was 240.5 MB in the beginning and 210.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:07:53,669 INFO ]: TraceAbstraction took 13773.27 ms. Allocated memory was 303.0 MB in the beginning and 461.9 MB in the end (delta: 158.9 MB). Free memory was 210.4 MB in the beginning and 299.3 MB in the end (delta: -88.9 MB). Peak memory consumption was 70.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:07:53,671 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 101.84 ms. Allocated memory is still 303.0 MB. Free memory was 244.5 MB in the beginning and 242.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 56.05 ms. Allocated memory is still 303.0 MB. Free memory was 242.5 MB in the beginning and 240.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 657.89 ms. Allocated memory is still 303.0 MB. Free memory was 240.5 MB in the beginning and 210.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 13773.27 ms. Allocated memory was 303.0 MB in the beginning and 461.9 MB in the end (delta: 158.9 MB). Free memory was 210.4 MB in the beginning and 299.3 MB in the end (delta: -88.9 MB). Peak memory consumption was 70.0 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, 34 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 764 SDtfs, 4935 SDslu, 7491 SDs, 0 SdLazy, 1913 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3322 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=14, 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, 19 MinimizatonAttempts, 1332 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 24348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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/46.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-07-53-680.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/46.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-07-53-680.csv Received shutdown request...