java -Xss4m -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/hopv/lia/fpice/inductive.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:21:32,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:21:32,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:21:32,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:21:32,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:21:32,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:21:32,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:21:32,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:21:32,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:21:32,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:21:32,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:21:32,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:21:32,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:21:32,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:21:32,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:21:32,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:21:32,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:21:33,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:21:33,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:21:33,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:21:33,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:21:33,009 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:21:33,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:21:33,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:21:33,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:21:33,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:21:33,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:21:33,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:21:33,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:21:33,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:21:33,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:21:33,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:21:33,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:21:33,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:21:33,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:21:33,021 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:21:33,037 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:21:33,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:21:33,037 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:21:33,037 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:21:33,038 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:21:33,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:21:33,039 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:21:33,039 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:21:33,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:21:33,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:21:33,040 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:21:33,040 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:21:33,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:21:33,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:21:33,041 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:21:33,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:21:33,041 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:21:33,042 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:21:33,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:21:33,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:21:33,042 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:21:33,043 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:21:33,048 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:21:33,092 INFO ]: Repository-Root is: /tmp [2018-06-25 09:21:33,110 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:21:33,115 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:21:33,117 INFO ]: Initializing SmtParser... [2018-06-25 09:21:33,117 INFO ]: SmtParser initialized [2018-06-25 09:21:33,117 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/fpice/inductive.smt2 [2018-06-25 09:21:33,119 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-25 09:21:33,210 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/fpice/inductive.smt2 unknown [2018-06-25 09:21:33,407 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/fpice/inductive.smt2 [2018-06-25 09:21:33,412 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:21:33,427 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:21:33,428 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:21:33,428 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:21:33,428 INFO ]: ChcToBoogie initialized [2018-06-25 09:21:33,431 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,489 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33 Unit [2018-06-25 09:21:33,489 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:21:33,490 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:21:33,490 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:21:33,490 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:21:33,513 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,513 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,518 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,518 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,521 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,524 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,525 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (1/1) ... [2018-06-25 09:21:33,528 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:21:33,528 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:21:33,528 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:21:33,529 INFO ]: RCFGBuilder initialized [2018-06-25 09:21:33,529 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (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-25 09:21:33,551 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:21:33,551 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:21:33,551 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:21:33,552 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:21:33,552 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:21:33,552 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-25 09:21:33,744 INFO ]: Using library mode [2018-06-25 09:21:33,744 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:21:33 BoogieIcfgContainer [2018-06-25 09:21:33,744 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:21:33,745 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:21:33,746 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:21:33,750 INFO ]: TraceAbstraction initialized [2018-06-25 09:21:33,750 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:21:33" (1/3) ... [2018-06-25 09:21:33,751 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c1b936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:21:33, skipping insertion in model container [2018-06-25 09:21:33,751 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:21:33" (2/3) ... [2018-06-25 09:21:33,751 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c1b936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:21:33, skipping insertion in model container [2018-06-25 09:21:33,752 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:21:33" (3/3) ... [2018-06-25 09:21:33,753 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:21:33,760 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:21:33,766 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:21:33,807 INFO ]: Using default assertion order modulation [2018-06-25 09:21:33,807 INFO ]: Interprodecural is true [2018-06-25 09:21:33,807 INFO ]: Hoare is false [2018-06-25 09:21:33,807 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:21:33,807 INFO ]: Backedges is TWOTRACK [2018-06-25 09:21:33,807 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:21:33,807 INFO ]: Difference is false [2018-06-25 09:21:33,807 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:21:33,808 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:21:33,821 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:21:33,832 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:21:33,832 INFO ]: Found error trace [2018-06-25 09:21:33,832 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:33,833 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:33,836 INFO ]: Analyzing trace with hash 1111609261, now seen corresponding path program 1 times [2018-06-25 09:21:33,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:33,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:33,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:33,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:33,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:33,902 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:34,057 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:21:34,060 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:21:34,060 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:21:34,062 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:21:34,077 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:21:34,077 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:21:34,079 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-25 09:21:34,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:34,208 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-25 09:21:34,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:21:34,210 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:21:34,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:34,218 INFO ]: With dead ends: 19 [2018-06-25 09:21:34,218 INFO ]: Without dead ends: 19 [2018-06-25 09:21:34,219 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:21:34,236 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:21:34,260 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:21:34,261 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:21:34,262 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-25 09:21:34,263 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 7 [2018-06-25 09:21:34,265 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:34,265 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-25 09:21:34,265 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:21:34,265 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-25 09:21:34,266 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:21:34,266 INFO ]: Found error trace [2018-06-25 09:21:34,266 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:34,266 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:34,266 INFO ]: Analyzing trace with hash 149683687, now seen corresponding path program 1 times [2018-06-25 09:21:34,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:34,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:34,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:34,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,281 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:34,357 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:21:34,357 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:21:34,357 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:21:34,358 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:21:34,358 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:21:34,358 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:21:34,359 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 3 states. [2018-06-25 09:21:34,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:34,544 INFO ]: Finished difference Result 21 states and 35 transitions. [2018-06-25 09:21:34,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:21:34,546 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:21:34,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:34,546 INFO ]: With dead ends: 21 [2018-06-25 09:21:34,546 INFO ]: Without dead ends: 21 [2018-06-25 09:21:34,547 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:21:34,547 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:21:34,552 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:21:34,552 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:21:34,553 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-06-25 09:21:34,553 INFO ]: Start accepts. Automaton has 21 states and 35 transitions. Word has length 8 [2018-06-25 09:21:34,553 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:34,553 INFO ]: Abstraction has 21 states and 35 transitions. [2018-06-25 09:21:34,553 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:21:34,553 INFO ]: Start isEmpty. Operand 21 states and 35 transitions. [2018-06-25 09:21:34,553 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:21:34,553 INFO ]: Found error trace [2018-06-25 09:21:34,553 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:34,554 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:34,554 INFO ]: Analyzing trace with hash 347662394, now seen corresponding path program 1 times [2018-06-25 09:21:34,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:34,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:34,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:34,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,570 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:34,644 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:21:34,644 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:21:34,644 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:21:34,644 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:21:34,644 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:21:34,644 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:21:34,644 INFO ]: Start difference. First operand 21 states and 35 transitions. Second operand 3 states. [2018-06-25 09:21:34,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:34,744 INFO ]: Finished difference Result 27 states and 40 transitions. [2018-06-25 09:21:34,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:21:34,745 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:21:34,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:34,747 INFO ]: With dead ends: 27 [2018-06-25 09:21:34,747 INFO ]: Without dead ends: 25 [2018-06-25 09:21:34,748 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:21:34,748 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:21:34,753 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-25 09:21:34,753 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:21:34,754 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-06-25 09:21:34,754 INFO ]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 9 [2018-06-25 09:21:34,754 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:34,754 INFO ]: Abstraction has 21 states and 31 transitions. [2018-06-25 09:21:34,754 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:21:34,754 INFO ]: Start isEmpty. Operand 21 states and 31 transitions. [2018-06-25 09:21:34,755 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:21:34,755 INFO ]: Found error trace [2018-06-25 09:21:34,755 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:34,755 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:34,755 INFO ]: Analyzing trace with hash -1092139682, now seen corresponding path program 1 times [2018-06-25 09:21:34,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:34,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:34,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:34,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,771 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:34,858 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:21:34,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:21:34,858 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:21:34,859 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:21:34,859 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:21:34,859 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:21:34,859 INFO ]: Start difference. First operand 21 states and 31 transitions. Second operand 4 states. [2018-06-25 09:21:34,987 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:34,987 INFO ]: Finished difference Result 25 states and 39 transitions. [2018-06-25 09:21:34,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:21:34,987 INFO ]: Start accepts. Automaton has 4 states. Word has length 15 [2018-06-25 09:21:34,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:34,988 INFO ]: With dead ends: 25 [2018-06-25 09:21:34,988 INFO ]: Without dead ends: 23 [2018-06-25 09:21:34,988 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-25 09:21:34,989 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:21:34,991 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:21:34,992 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:21:34,992 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-06-25 09:21:34,992 INFO ]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 15 [2018-06-25 09:21:34,993 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:34,993 INFO ]: Abstraction has 23 states and 35 transitions. [2018-06-25 09:21:34,993 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:21:34,993 INFO ]: Start isEmpty. Operand 23 states and 35 transitions. [2018-06-25 09:21:34,993 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:21:34,993 INFO ]: Found error trace [2018-06-25 09:21:34,993 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:34,994 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:34,994 INFO ]: Analyzing trace with hash 505843619, now seen corresponding path program 1 times [2018-06-25 09:21:34,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:34,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:34,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:34,994 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:34,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:35,009 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:35,238 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:21:35,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:35,238 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-25 09:21:35,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:35,316 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:35,326 INFO ]: Computing forward predicates... [2018-06-25 09:21:35,446 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:21:35,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:35,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 09:21:35,469 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:21:35,469 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:21:35,469 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:21:35,470 INFO ]: Start difference. First operand 23 states and 35 transitions. Second operand 7 states. [2018-06-25 09:21:35,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:35,681 INFO ]: Finished difference Result 30 states and 44 transitions. [2018-06-25 09:21:35,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:21:35,682 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-25 09:21:35,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:35,683 INFO ]: With dead ends: 30 [2018-06-25 09:21:35,683 INFO ]: Without dead ends: 24 [2018-06-25 09:21:35,683 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:21:35,683 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:21:35,686 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:21:35,686 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:21:35,687 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2018-06-25 09:21:35,687 INFO ]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 16 [2018-06-25 09:21:35,687 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:35,687 INFO ]: Abstraction has 24 states and 38 transitions. [2018-06-25 09:21:35,687 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:21:35,687 INFO ]: Start isEmpty. Operand 24 states and 38 transitions. [2018-06-25 09:21:35,688 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:21:35,688 INFO ]: Found error trace [2018-06-25 09:21:35,688 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:35,688 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:35,688 INFO ]: Analyzing trace with hash 6684434, now seen corresponding path program 2 times [2018-06-25 09:21:35,688 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:35,688 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:35,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:35,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:35,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:35,706 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:35,748 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:21:35,748 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:35,748 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:35,756 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:21:35,800 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:21:35,800 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:35,802 INFO ]: Computing forward predicates... [2018-06-25 09:21:36,096 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:21:36,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:36,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-25 09:21:36,119 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:21:36,119 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:21:36,119 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:21:36,119 INFO ]: Start difference. First operand 24 states and 38 transitions. Second operand 9 states. [2018-06-25 09:21:36,427 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:21:36,904 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-25 09:21:37,106 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:37,106 INFO ]: Finished difference Result 46 states and 76 transitions. [2018-06-25 09:21:37,107 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:21:37,107 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-25 09:21:37,107 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:37,108 INFO ]: With dead ends: 46 [2018-06-25 09:21:37,108 INFO ]: Without dead ends: 29 [2018-06-25 09:21:37,108 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:21:37,108 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:21:37,112 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-06-25 09:21:37,112 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:21:37,113 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-06-25 09:21:37,113 INFO ]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 17 [2018-06-25 09:21:37,113 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:37,113 INFO ]: Abstraction has 24 states and 35 transitions. [2018-06-25 09:21:37,113 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:21:37,113 INFO ]: Start isEmpty. Operand 24 states and 35 transitions. [2018-06-25 09:21:37,113 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:21:37,113 INFO ]: Found error trace [2018-06-25 09:21:37,114 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:37,114 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:37,114 INFO ]: Analyzing trace with hash -1172396596, now seen corresponding path program 1 times [2018-06-25 09:21:37,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:37,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:37,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:37,115 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:21:37,115 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:37,129 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:37,175 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:21:37,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:21:37,176 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:21:37,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:37,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:37,215 INFO ]: Computing forward predicates... [2018-06-25 09:21:37,318 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:21:37,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:21:37,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:21:37,338 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:21:37,338 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:21:37,338 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:21:37,338 INFO ]: Start difference. First operand 24 states and 35 transitions. Second operand 8 states. [2018-06-25 09:21:37,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:37,415 INFO ]: Finished difference Result 31 states and 44 transitions. [2018-06-25 09:21:37,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:21:37,415 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-25 09:21:37,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:37,416 INFO ]: With dead ends: 31 [2018-06-25 09:21:37,416 INFO ]: Without dead ends: 29 [2018-06-25 09:21:37,416 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:21:37,416 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:21:37,419 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-25 09:21:37,419 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:21:37,420 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-25 09:21:37,420 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2018-06-25 09:21:37,420 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:37,420 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-25 09:21:37,420 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:21:37,420 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-25 09:21:37,420 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:21:37,420 INFO ]: Found error trace [2018-06-25 09:21:37,420 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:21:37,421 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:21:37,421 INFO ]: Analyzing trace with hash -1168702512, now seen corresponding path program 1 times [2018-06-25 09:21:37,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:21:37,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:21:37,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:37,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:21:37,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:21:37,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:21:37,470 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:21:37,470 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:21:37,470 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:21:37,470 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:21:37,470 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:21:37,470 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:21:37,470 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-06-25 09:21:37,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:21:37,507 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-25 09:21:37,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:21:37,507 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-25 09:21:37,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:21:37,507 INFO ]: With dead ends: 19 [2018-06-25 09:21:37,507 INFO ]: Without dead ends: 0 [2018-06-25 09:21:37,508 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-25 09:21:37,508 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:21:37,508 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:21:37,508 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:21:37,508 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:21:37,508 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-25 09:21:37,508 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:21:37,508 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:21:37,508 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:21:37,508 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:21:37,508 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:21:37,512 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:21:37 BoogieIcfgContainer [2018-06-25 09:21:37,512 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:21:37,513 INFO ]: Toolchain (without parser) took 4100.53 ms. Allocated memory was 304.6 MB in the beginning and 324.0 MB in the end (delta: 19.4 MB). Free memory was 260.0 MB in the beginning and 216.5 MB in the end (delta: 43.5 MB). Peak memory consumption was 62.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:37,514 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:21:37,514 INFO ]: ChcToBoogie took 61.54 ms. Allocated memory is still 304.6 MB. Free memory was 260.0 MB in the beginning and 257.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:37,515 INFO ]: Boogie Preprocessor took 38.44 ms. Allocated memory is still 304.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:37,515 INFO ]: RCFGBuilder took 216.01 ms. Allocated memory is still 304.6 MB. Free memory was 255.9 MB in the beginning and 247.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:37,516 INFO ]: TraceAbstraction took 3766.71 ms. Allocated memory was 304.6 MB in the beginning and 324.0 MB in the end (delta: 19.4 MB). Free memory was 246.8 MB in the beginning and 216.5 MB in the end (delta: 30.3 MB). Peak memory consumption was 49.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:21:37,521 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.54 ms. Allocated memory is still 304.6 MB. Free memory was 260.0 MB in the beginning and 257.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.44 ms. Allocated memory is still 304.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 216.01 ms. Allocated memory is still 304.6 MB. Free memory was 255.9 MB in the beginning and 247.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3766.71 ms. Allocated memory was 304.6 MB in the beginning and 324.0 MB in the end (delta: 19.4 MB). Free memory was 246.8 MB in the beginning and 216.5 MB in the end (delta: 30.3 MB). Peak memory consumption was 49.7 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, 13 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 62 SDslu, 177 SDs, 0 SdLazy, 237 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 4260 SizeOfPredicates, 10 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 64/70 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/inductive.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-21-37-530.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inductive.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-21-37-530.csv Received shutdown request...