java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/coreutils__md5sum.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:42:06,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:42:06,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:42:06,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:42:06,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:42:06,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:42:06,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:42:06,921 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:42:06,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:42:06,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:42:06,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:42:06,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:42:06,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:42:06,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:42:06,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:42:06,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:42:06,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:42:06,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:42:06,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:42:06,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:42:06,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:42:06,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:42:06,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:42:06,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:42:06,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:42:06,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:42:06,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:42:06,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:42:06,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:42:06,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:42:06,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:42:06,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:42:06,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:42:06,962 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:42:06,969 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:42:06,970 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:42:07,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:42:07,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:42:07,024 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:42:07,025 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:42:07,025 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:42:07,026 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:42:07,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:42:07,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:42:07,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:42:07,026 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:42:07,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:42:07,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:42:07,027 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:42:07,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:42:07,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:42:07,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:42:07,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:42:07,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:42:07,028 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:42:07,030 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:42:07,030 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:42:07,089 INFO ]: Repository-Root is: /tmp [2018-06-22 11:42:07,107 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:42:07,144 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:42:07,145 INFO ]: Initializing SmtParser... [2018-06-22 11:42:07,145 INFO ]: SmtParser initialized [2018-06-22 11:42:07,146 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/coreutils__md5sum.array.smt2 [2018-06-22 11:42:07,147 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 11:42:07,211 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/coreutils__md5sum.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2c6bf745 [2018-06-22 11:42:07,714 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/coreutils__md5sum.array.smt2 [2018-06-22 11:42:07,718 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:42:07,724 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:42:07,724 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:42:07,724 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:42:07,724 INFO ]: ChcToBoogie initialized [2018-06-22 11:42:07,727 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,791 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07 Unit [2018-06-22 11:42:07,791 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:42:07,792 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:42:07,792 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:42:07,792 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:42:07,811 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,811 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,821 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,821 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,834 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,839 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,841 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (1/1) ... [2018-06-22 11:42:07,844 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:42:07,844 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:42:07,844 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:42:07,844 INFO ]: RCFGBuilder initialized [2018-06-22 11:42:07,845 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (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 11:42:07,872 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:42:07,872 INFO ]: Found specification of procedure False [2018-06-22 11:42:07,872 INFO ]: Found implementation of procedure False [2018-06-22 11:42:07,872 INFO ]: Specification and implementation of procedure INV_MAIN_3 given in one single declaration [2018-06-22 11:42:07,872 INFO ]: Found specification of procedure INV_MAIN_3 [2018-06-22 11:42:07,872 INFO ]: Found implementation of procedure INV_MAIN_3 [2018-06-22 11:42:07,872 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-22 11:42:07,872 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-22 11:42:07,872 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-22 11:42:07,873 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:42:07,873 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:42:07,873 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:42:07,873 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:42:07,873 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:42:07,873 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 11:42:08,806 INFO ]: Using library mode [2018-06-22 11:42:09,310 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:42:09 BoogieIcfgContainer [2018-06-22 11:42:09,311 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:42:09,314 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:42:09,314 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:42:09,328 INFO ]: TraceAbstraction initialized [2018-06-22 11:42:09,329 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:42:07" (1/3) ... [2018-06-22 11:42:09,330 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747d8ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:42:09, skipping insertion in model container [2018-06-22 11:42:09,330 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:42:07" (2/3) ... [2018-06-22 11:42:09,331 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747d8ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:42:09, skipping insertion in model container [2018-06-22 11:42:09,331 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:42:09" (3/3) ... [2018-06-22 11:42:09,335 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:42:09,350 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:42:09,359 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:42:09,411 INFO ]: Using default assertion order modulation [2018-06-22 11:42:09,411 INFO ]: Interprodecural is true [2018-06-22 11:42:09,411 INFO ]: Hoare is false [2018-06-22 11:42:09,412 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:42:09,412 INFO ]: Backedges is TWOTRACK [2018-06-22 11:42:09,412 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:42:09,412 INFO ]: Difference is false [2018-06-22 11:42:09,412 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:42:09,412 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:42:09,432 INFO ]: Start isEmpty. Operand 57 states. [2018-06-22 11:42:09,469 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:42:09,469 INFO ]: Found error trace [2018-06-22 11:42:09,470 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:42:09,470 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:09,474 INFO ]: Analyzing trace with hash 346874870, now seen corresponding path program 1 times [2018-06-22 11:42:09,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:09,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:09,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:09,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:09,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:09,531 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:09,557 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:09,560 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:09,560 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:42:09,562 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:42:09,577 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:42:09,578 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:42:09,580 INFO ]: Start difference. First operand 57 states. Second operand 2 states. [2018-06-22 11:42:09,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:09,619 INFO ]: Finished difference Result 48 states and 107 transitions. [2018-06-22 11:42:09,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:42:09,620 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:42:09,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:09,636 INFO ]: With dead ends: 48 [2018-06-22 11:42:09,636 INFO ]: Without dead ends: 48 [2018-06-22 11:42:09,638 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:42:09,655 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:42:09,686 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 11:42:09,687 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:42:09,689 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 107 transitions. [2018-06-22 11:42:09,690 INFO ]: Start accepts. Automaton has 48 states and 107 transitions. Word has length 5 [2018-06-22 11:42:09,692 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:09,692 INFO ]: Abstraction has 48 states and 107 transitions. [2018-06-22 11:42:09,692 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:42:09,692 INFO ]: Start isEmpty. Operand 48 states and 107 transitions. [2018-06-22 11:42:09,698 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:09,698 INFO ]: Found error trace [2018-06-22 11:42:09,698 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:09,698 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:09,698 INFO ]: Analyzing trace with hash -1961981202, now seen corresponding path program 1 times [2018-06-22 11:42:09,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:09,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:09,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:09,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:09,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:09,741 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:10,509 WARN ]: Spent 445.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-06-22 11:42:10,726 WARN ]: Spent 180.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 8 [2018-06-22 11:42:10,752 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:10,752 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:10,752 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:10,753 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:10,754 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:10,754 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:10,754 INFO ]: Start difference. First operand 48 states and 107 transitions. Second operand 4 states. [2018-06-22 11:42:11,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:11,063 INFO ]: Finished difference Result 48 states and 106 transitions. [2018-06-22 11:42:11,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:11,064 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:11,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:11,066 INFO ]: With dead ends: 48 [2018-06-22 11:42:11,066 INFO ]: Without dead ends: 47 [2018-06-22 11:42:11,067 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:11,067 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:42:11,077 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-22 11:42:11,077 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:42:11,078 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 104 transitions. [2018-06-22 11:42:11,078 INFO ]: Start accepts. Automaton has 47 states and 104 transitions. Word has length 9 [2018-06-22 11:42:11,078 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:11,078 INFO ]: Abstraction has 47 states and 104 transitions. [2018-06-22 11:42:11,078 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:11,078 INFO ]: Start isEmpty. Operand 47 states and 104 transitions. [2018-06-22 11:42:11,081 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:11,081 INFO ]: Found error trace [2018-06-22 11:42:11,081 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:11,081 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:11,081 INFO ]: Analyzing trace with hash -191299971, now seen corresponding path program 1 times [2018-06-22 11:42:11,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:11,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:11,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:11,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:11,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:11,102 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:11,177 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:11,177 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:11,177 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:11,177 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:11,178 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:11,178 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:11,178 INFO ]: Start difference. First operand 47 states and 104 transitions. Second operand 4 states. [2018-06-22 11:42:11,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:11,404 INFO ]: Finished difference Result 47 states and 103 transitions. [2018-06-22 11:42:11,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:11,405 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:11,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:11,407 INFO ]: With dead ends: 47 [2018-06-22 11:42:11,407 INFO ]: Without dead ends: 46 [2018-06-22 11:42:11,407 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:11,407 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:42:11,414 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 11:42:11,414 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:42:11,416 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2018-06-22 11:42:11,416 INFO ]: Start accepts. Automaton has 46 states and 101 transitions. Word has length 9 [2018-06-22 11:42:11,416 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:11,416 INFO ]: Abstraction has 46 states and 101 transitions. [2018-06-22 11:42:11,416 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:11,416 INFO ]: Start isEmpty. Operand 46 states and 101 transitions. [2018-06-22 11:42:11,418 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:11,418 INFO ]: Found error trace [2018-06-22 11:42:11,418 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:11,418 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:11,418 INFO ]: Analyzing trace with hash 866411731, now seen corresponding path program 1 times [2018-06-22 11:42:11,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:11,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:11,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:11,419 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:11,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:11,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:11,799 WARN ]: Spent 340.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-06-22 11:42:11,805 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:11,805 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:11,805 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:11,805 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:11,805 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:11,805 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:11,805 INFO ]: Start difference. First operand 46 states and 101 transitions. Second operand 4 states. [2018-06-22 11:42:11,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:11,883 INFO ]: Finished difference Result 50 states and 113 transitions. [2018-06-22 11:42:11,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:11,883 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:11,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:11,885 INFO ]: With dead ends: 50 [2018-06-22 11:42:11,885 INFO ]: Without dead ends: 50 [2018-06-22 11:42:11,886 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:11,886 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:42:11,900 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 11:42:11,902 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:42:11,903 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 111 transitions. [2018-06-22 11:42:11,903 INFO ]: Start accepts. Automaton has 48 states and 111 transitions. Word has length 9 [2018-06-22 11:42:11,903 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:11,904 INFO ]: Abstraction has 48 states and 111 transitions. [2018-06-22 11:42:11,904 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:11,904 INFO ]: Start isEmpty. Operand 48 states and 111 transitions. [2018-06-22 11:42:11,909 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:11,909 INFO ]: Found error trace [2018-06-22 11:42:11,910 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:11,910 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:11,910 INFO ]: Analyzing trace with hash -2090483998, now seen corresponding path program 1 times [2018-06-22 11:42:11,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:11,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:11,910 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:11,910 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:11,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:11,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:12,097 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:12,097 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:12,099 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:12,099 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:12,099 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:12,099 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:12,099 INFO ]: Start difference. First operand 48 states and 111 transitions. Second operand 4 states. [2018-06-22 11:42:12,279 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:12,279 INFO ]: Finished difference Result 48 states and 109 transitions. [2018-06-22 11:42:12,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:12,279 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:12,280 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:12,281 INFO ]: With dead ends: 48 [2018-06-22 11:42:12,281 INFO ]: Without dead ends: 47 [2018-06-22 11:42:12,281 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:12,281 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:42:12,288 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-22 11:42:12,288 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:42:12,290 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 107 transitions. [2018-06-22 11:42:12,290 INFO ]: Start accepts. Automaton has 47 states and 107 transitions. Word has length 9 [2018-06-22 11:42:12,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:12,290 INFO ]: Abstraction has 47 states and 107 transitions. [2018-06-22 11:42:12,290 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:12,290 INFO ]: Start isEmpty. Operand 47 states and 107 transitions. [2018-06-22 11:42:12,292 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:42:12,292 INFO ]: Found error trace [2018-06-22 11:42:12,292 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:12,292 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:12,292 INFO ]: Analyzing trace with hash -126917663, now seen corresponding path program 1 times [2018-06-22 11:42:12,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:12,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:12,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:12,293 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:12,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:12,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:12,384 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:12,384 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:12,384 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:42:12,384 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:42:12,384 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:42:12,384 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:12,384 INFO ]: Start difference. First operand 47 states and 107 transitions. Second operand 4 states. [2018-06-22 11:42:12,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:12,511 INFO ]: Finished difference Result 49 states and 108 transitions. [2018-06-22 11:42:12,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:42:12,513 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:42:12,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:12,514 INFO ]: With dead ends: 49 [2018-06-22 11:42:12,514 INFO ]: Without dead ends: 49 [2018-06-22 11:42:12,514 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:42:12,515 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:42:12,524 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-22 11:42:12,524 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:42:12,526 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 106 transitions. [2018-06-22 11:42:12,526 INFO ]: Start accepts. Automaton has 47 states and 106 transitions. Word has length 9 [2018-06-22 11:42:12,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:12,526 INFO ]: Abstraction has 47 states and 106 transitions. [2018-06-22 11:42:12,526 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:42:12,526 INFO ]: Start isEmpty. Operand 47 states and 106 transitions. [2018-06-22 11:42:12,527 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:12,527 INFO ]: Found error trace [2018-06-22 11:42:12,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:12,527 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:12,528 INFO ]: Analyzing trace with hash -779232099, now seen corresponding path program 1 times [2018-06-22 11:42:12,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:12,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:12,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:12,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:12,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:12,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:13,132 WARN ]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2018-06-22 11:42:13,328 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-06-22 11:42:13,333 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:13,333 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:13,333 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:42:13,335 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:42:13,335 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:42:13,336 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:42:13,336 INFO ]: Start difference. First operand 47 states and 106 transitions. Second operand 6 states. [2018-06-22 11:42:14,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:14,350 INFO ]: Finished difference Result 53 states and 133 transitions. [2018-06-22 11:42:14,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:14,351 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:42:14,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:14,353 INFO ]: With dead ends: 53 [2018-06-22 11:42:14,353 INFO ]: Without dead ends: 53 [2018-06-22 11:42:14,353 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:42:14,353 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:42:14,366 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:42:14,366 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:42:14,369 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 118 transitions. [2018-06-22 11:42:14,369 INFO ]: Start accepts. Automaton has 49 states and 118 transitions. Word has length 13 [2018-06-22 11:42:14,369 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:14,370 INFO ]: Abstraction has 49 states and 118 transitions. [2018-06-22 11:42:14,370 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:42:14,370 INFO ]: Start isEmpty. Operand 49 states and 118 transitions. [2018-06-22 11:42:14,371 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:14,371 INFO ]: Found error trace [2018-06-22 11:42:14,371 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:14,372 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:14,372 INFO ]: Analyzing trace with hash 1185915903, now seen corresponding path program 1 times [2018-06-22 11:42:14,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:14,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:14,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:14,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:14,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:14,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:14,478 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:14,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:14,478 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:42:14,481 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:42:14,482 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:42:14,482 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:42:14,482 INFO ]: Start difference. First operand 49 states and 118 transitions. Second operand 6 states. [2018-06-22 11:42:14,849 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-22 11:42:14,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:14,998 INFO ]: Finished difference Result 55 states and 144 transitions. [2018-06-22 11:42:14,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:42:14,999 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:42:14,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:15,000 INFO ]: With dead ends: 55 [2018-06-22 11:42:15,000 INFO ]: Without dead ends: 55 [2018-06-22 11:42:15,001 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:42:15,001 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:42:15,011 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:42:15,011 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:42:15,012 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 129 transitions. [2018-06-22 11:42:15,012 INFO ]: Start accepts. Automaton has 51 states and 129 transitions. Word has length 13 [2018-06-22 11:42:15,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:15,012 INFO ]: Abstraction has 51 states and 129 transitions. [2018-06-22 11:42:15,012 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:42:15,012 INFO ]: Start isEmpty. Operand 51 states and 129 transitions. [2018-06-22 11:42:15,014 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:15,014 INFO ]: Found error trace [2018-06-22 11:42:15,014 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:15,014 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:15,014 INFO ]: Analyzing trace with hash -782751044, now seen corresponding path program 1 times [2018-06-22 11:42:15,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:15,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:15,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:15,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:15,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:15,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:15,428 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-06-22 11:42:15,756 WARN ]: Spent 300.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-06-22 11:42:15,860 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:42:15,860 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:15,860 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:42:15,860 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:42:15,860 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:42:15,860 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:42:15,861 INFO ]: Start difference. First operand 51 states and 129 transitions. Second operand 6 states. [2018-06-22 11:42:16,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:16,467 INFO ]: Finished difference Result 55 states and 143 transitions. [2018-06-22 11:42:16,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:16,467 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:42:16,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:16,469 INFO ]: With dead ends: 55 [2018-06-22 11:42:16,469 INFO ]: Without dead ends: 55 [2018-06-22 11:42:16,469 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:42:16,469 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:42:16,478 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:42:16,478 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:42:16,479 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 128 transitions. [2018-06-22 11:42:16,479 INFO ]: Start accepts. Automaton has 51 states and 128 transitions. Word has length 13 [2018-06-22 11:42:16,479 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:16,479 INFO ]: Abstraction has 51 states and 128 transitions. [2018-06-22 11:42:16,479 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:42:16,479 INFO ]: Start isEmpty. Operand 51 states and 128 transitions. [2018-06-22 11:42:16,481 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:16,481 INFO ]: Found error trace [2018-06-22 11:42:16,481 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:16,481 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:16,481 INFO ]: Analyzing trace with hash -741364040, now seen corresponding path program 1 times [2018-06-22 11:42:16,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:16,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:16,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:16,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:16,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:16,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:16,587 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:16,587 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:16,587 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:42:16,587 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:42:16,587 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:42:16,587 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:42:16,587 INFO ]: Start difference. First operand 51 states and 128 transitions. Second operand 5 states. [2018-06-22 11:42:16,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:16,677 INFO ]: Finished difference Result 57 states and 149 transitions. [2018-06-22 11:42:16,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:16,677 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:42:16,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:16,678 INFO ]: With dead ends: 57 [2018-06-22 11:42:16,678 INFO ]: Without dead ends: 57 [2018-06-22 11:42:16,678 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:42:16,679 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:42:16,687 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:42:16,687 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:42:16,688 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 137 transitions. [2018-06-22 11:42:16,688 INFO ]: Start accepts. Automaton has 53 states and 137 transitions. Word has length 13 [2018-06-22 11:42:16,688 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:16,688 INFO ]: Abstraction has 53 states and 137 transitions. [2018-06-22 11:42:16,688 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:42:16,688 INFO ]: Start isEmpty. Operand 53 states and 137 transitions. [2018-06-22 11:42:16,690 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:16,690 INFO ]: Found error trace [2018-06-22 11:42:16,690 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:16,690 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:16,690 INFO ]: Analyzing trace with hash 1329582278, now seen corresponding path program 1 times [2018-06-22 11:42:16,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:16,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:16,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:16,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:16,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:16,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:16,790 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:42:16,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:42:16,790 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:42:16,790 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:42:16,790 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:42:16,790 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:42:16,790 INFO ]: Start difference. First operand 53 states and 137 transitions. Second operand 5 states. [2018-06-22 11:42:16,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:16,879 INFO ]: Finished difference Result 57 states and 148 transitions. [2018-06-22 11:42:16,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:42:16,880 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:42:16,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:16,881 INFO ]: With dead ends: 57 [2018-06-22 11:42:16,881 INFO ]: Without dead ends: 57 [2018-06-22 11:42:16,882 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:42:16,882 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:42:16,890 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:42:16,890 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:42:16,891 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 136 transitions. [2018-06-22 11:42:16,891 INFO ]: Start accepts. Automaton has 53 states and 136 transitions. Word has length 13 [2018-06-22 11:42:16,891 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:16,891 INFO ]: Abstraction has 53 states and 136 transitions. [2018-06-22 11:42:16,892 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:42:16,892 INFO ]: Start isEmpty. Operand 53 states and 136 transitions. [2018-06-22 11:42:16,893 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:42:16,893 INFO ]: Found error trace [2018-06-22 11:42:16,893 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:42:16,893 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:42:16,893 INFO ]: Analyzing trace with hash -593587883, now seen corresponding path program 1 times [2018-06-22 11:42:16,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:42:16,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:42:16,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:16,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:16,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:42:16,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:17,156 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:42:17,156 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:42:17,156 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:42:17,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:42:17,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:42:17,184 INFO ]: Computing forward predicates... [2018-06-22 11:42:17,312 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-06-22 11:42:17,314 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:42:17,339 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-22 11:42:17,339 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-06-22 11:42:17,525 INFO ]: detected not equals via solver [2018-06-22 11:42:17,536 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-06-22 11:42:17,537 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:42:17,566 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-06-22 11:42:17,566 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-22 11:42:17,593 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-06-22 11:42:17,593 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-22 11:42:17,610 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2018-06-22 11:42:17,611 INFO ]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-06-22 11:42:17,625 INFO ]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-06-22 11:42:17,625 INFO ]: Needed 5 recursive calls to eliminate 6 variables, input treesize:59, output treesize:28 [2018-06-22 11:42:17,643 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:42:17,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:42:17,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-06-22 11:42:17,663 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:42:17,663 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:42:17,663 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:42:17,663 INFO ]: Start difference. First operand 53 states and 136 transitions. Second operand 10 states. [2018-06-22 11:42:18,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:42:18,075 INFO ]: Finished difference Result 62 states and 174 transitions. [2018-06-22 11:42:18,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:42:18,075 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:42:18,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:42:18,075 INFO ]: With dead ends: 62 [2018-06-22 11:42:18,075 INFO ]: Without dead ends: 0 [2018-06-22 11:42:18,075 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:42:18,075 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:42:18,075 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:42:18,075 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:42:18,076 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:42:18,076 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-06-22 11:42:18,076 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:42:18,076 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:42:18,076 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:42:18,076 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:42:18,076 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:42:18,081 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:42:18 BoogieIcfgContainer [2018-06-22 11:42:18,081 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:42:18,082 INFO ]: Toolchain (without parser) took 10363.15 ms. Allocated memory was 308.8 MB in the beginning and 386.4 MB in the end (delta: 77.6 MB). Free memory was 247.3 MB in the beginning and 189.4 MB in the end (delta: 57.8 MB). Peak memory consumption was 135.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:18,083 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:42:18,083 INFO ]: ChcToBoogie took 67.67 ms. Allocated memory is still 308.8 MB. Free memory was 247.3 MB in the beginning and 244.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:18,083 INFO ]: Boogie Preprocessor took 51.62 ms. Allocated memory is still 308.8 MB. Free memory was 244.3 MB in the beginning and 242.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:18,084 INFO ]: RCFGBuilder took 1466.24 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 216.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:18,084 INFO ]: TraceAbstraction took 8766.64 ms. Allocated memory was 308.8 MB in the beginning and 386.4 MB in the end (delta: 77.6 MB). Free memory was 216.3 MB in the beginning and 189.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 104.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:42:18,087 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.67 ms. Allocated memory is still 308.8 MB. Free memory was 247.3 MB in the beginning and 244.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.62 ms. Allocated memory is still 308.8 MB. Free memory was 244.3 MB in the beginning and 242.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1466.24 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 216.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 8766.64 ms. Allocated memory was 308.8 MB in the beginning and 386.4 MB in the end (delta: 77.6 MB). Free memory was 216.3 MB in the beginning and 189.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 104.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 5 procedures, 57 locations, 1 error locations. SAFE Result, 8.6s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1096 SDtfs, 23 SDslu, 2556 SDs, 0 SdLazy, 1043 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, 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, 12 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 128 ConstructedInterpolants, 2 QuantifiedInterpolants, 61488 SizeOfPredicates, 12 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 8/12 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/coreutils__md5sum.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-42-18-217.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/coreutils__md5sum.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-42-18-217.csv Received shutdown request...