java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:32:23,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:32:23,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:32:23,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:32:23,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:32:23,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:32:23,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:32:23,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:32:23,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:32:23,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:32:23,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:32:23,788 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:32:23,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:32:23,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:32:23,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:32:23,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:32:23,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:32:23,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:32:23,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:32:23,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:32:23,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:32:23,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:32:23,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:32:23,806 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:32:23,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:32:23,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:32:23,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:32:23,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:32:23,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:32:23,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:32:23,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:32:23,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:32:23,811 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:32:23,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:32:23,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:32:23,813 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:32:23,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:32:23,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:32:23,831 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:32:23,831 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:32:23,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:32:23,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:32:23,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:32:23,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:32:23,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:32:23,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:32:23,833 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:32:23,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:32:23,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:32:23,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:32:23,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:32:23,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:32:23,838 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:32:23,839 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:32:23,840 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:32:23,885 INFO ]: Repository-Root is: /tmp [2018-06-22 01:32:23,903 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:32:23,908 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:32:23,909 INFO ]: Initializing SmtParser... [2018-06-22 01:32:23,909 INFO ]: SmtParser initialized [2018-06-22 01:32:23,910 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 [2018-06-22 01:32:23,911 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:32:24,002 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 unknown [2018-06-22 01:32:24,310 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 [2018-06-22 01:32:24,314 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:32:24,321 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:32:24,321 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:32:24,321 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:32:24,321 INFO ]: ChcToBoogie initialized [2018-06-22 01:32:24,329 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,397 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24 Unit [2018-06-22 01:32:24,398 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:32:24,425 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:32:24,425 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:32:24,426 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:32:24,445 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,445 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,454 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,454 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,460 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,474 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,476 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... [2018-06-22 01:32:24,478 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:32:24,479 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:32:24,479 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:32:24,479 INFO ]: RCFGBuilder initialized [2018-06-22 01:32:24,480 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:32:24,512 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:32:24,512 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:32:24,512 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:32:24,512 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:32:24,512 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:32:24,512 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:32:24,975 INFO ]: Using library mode [2018-06-22 01:32:24,976 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:24 BoogieIcfgContainer [2018-06-22 01:32:24,976 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:32:24,983 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:32:24,983 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:32:24,986 INFO ]: TraceAbstraction initialized [2018-06-22 01:32:24,986 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:32:24" (1/3) ... [2018-06-22 01:32:24,987 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fb9080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:32:24, skipping insertion in model container [2018-06-22 01:32:24,987 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:24" (2/3) ... [2018-06-22 01:32:24,988 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fb9080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:32:24, skipping insertion in model container [2018-06-22 01:32:24,992 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:24" (3/3) ... [2018-06-22 01:32:24,994 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:32:25,004 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:32:25,014 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:32:25,052 INFO ]: Using default assertion order modulation [2018-06-22 01:32:25,053 INFO ]: Interprodecural is true [2018-06-22 01:32:25,053 INFO ]: Hoare is false [2018-06-22 01:32:25,053 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:32:25,053 INFO ]: Backedges is TWOTRACK [2018-06-22 01:32:25,053 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:32:25,053 INFO ]: Difference is false [2018-06-22 01:32:25,053 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:32:25,053 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:32:25,070 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 01:32:25,084 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:32:25,085 INFO ]: Found error trace [2018-06-22 01:32:25,085 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:25,086 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:25,091 INFO ]: Analyzing trace with hash 564356652, now seen corresponding path program 1 times [2018-06-22 01:32:25,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:25,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:25,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:25,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:25,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:25,169 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:25,255 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:32:25,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:25,257 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:25,259 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:25,270 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:25,270 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:25,272 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-22 01:32:25,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:25,830 INFO ]: Finished difference Result 55 states and 89 transitions. [2018-06-22 01:32:25,830 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:25,831 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:32:25,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:25,842 INFO ]: With dead ends: 55 [2018-06-22 01:32:25,842 INFO ]: Without dead ends: 55 [2018-06-22 01:32:25,844 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:25,862 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:32:25,903 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 01:32:25,904 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:32:25,906 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2018-06-22 01:32:25,907 INFO ]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 8 [2018-06-22 01:32:25,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:25,908 INFO ]: Abstraction has 55 states and 89 transitions. [2018-06-22 01:32:25,908 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:25,908 INFO ]: Start isEmpty. Operand 55 states and 89 transitions. [2018-06-22 01:32:25,911 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:32:25,911 INFO ]: Found error trace [2018-06-22 01:32:25,911 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:25,912 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:25,912 INFO ]: Analyzing trace with hash 578209467, now seen corresponding path program 1 times [2018-06-22 01:32:25,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:25,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:25,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:25,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:25,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:25,919 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:26,052 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:32:26,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:26,052 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:26,054 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:26,054 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:26,054 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:26,054 INFO ]: Start difference. First operand 55 states and 89 transitions. Second operand 4 states. [2018-06-22 01:32:26,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:26,994 INFO ]: Finished difference Result 81 states and 132 transitions. [2018-06-22 01:32:26,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:26,994 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:32:26,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:27,000 INFO ]: With dead ends: 81 [2018-06-22 01:32:27,000 INFO ]: Without dead ends: 81 [2018-06-22 01:32:27,001 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:27,001 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:32:27,019 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-22 01:32:27,019 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 01:32:27,022 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 132 transitions. [2018-06-22 01:32:27,022 INFO ]: Start accepts. Automaton has 81 states and 132 transitions. Word has length 8 [2018-06-22 01:32:27,022 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:27,022 INFO ]: Abstraction has 81 states and 132 transitions. [2018-06-22 01:32:27,022 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:27,022 INFO ]: Start isEmpty. Operand 81 states and 132 transitions. [2018-06-22 01:32:27,025 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:32:27,025 INFO ]: Found error trace [2018-06-22 01:32:27,025 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:27,025 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:27,026 INFO ]: Analyzing trace with hash 782289457, now seen corresponding path program 1 times [2018-06-22 01:32:27,026 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:27,026 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:27,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:27,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:27,027 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:27,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:27,098 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:32:27,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:27,098 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:32:27,098 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:32:27,098 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:32:27,098 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:32:27,099 INFO ]: Start difference. First operand 81 states and 132 transitions. Second operand 3 states. [2018-06-22 01:32:27,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:27,186 INFO ]: Finished difference Result 141 states and 237 transitions. [2018-06-22 01:32:27,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:32:27,186 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:32:27,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:27,190 INFO ]: With dead ends: 141 [2018-06-22 01:32:27,190 INFO ]: Without dead ends: 141 [2018-06-22 01:32:27,191 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-22 01:32:27,191 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 01:32:27,209 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 84. [2018-06-22 01:32:27,209 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 01:32:27,212 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 141 transitions. [2018-06-22 01:32:27,212 INFO ]: Start accepts. Automaton has 84 states and 141 transitions. Word has length 9 [2018-06-22 01:32:27,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:27,212 INFO ]: Abstraction has 84 states and 141 transitions. [2018-06-22 01:32:27,212 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:32:27,212 INFO ]: Start isEmpty. Operand 84 states and 141 transitions. [2018-06-22 01:32:27,219 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:27,219 INFO ]: Found error trace [2018-06-22 01:32:27,219 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:27,219 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:27,219 INFO ]: Analyzing trace with hash -1846316989, now seen corresponding path program 1 times [2018-06-22 01:32:27,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:27,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:27,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:27,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:27,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:27,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:27,434 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:32:27,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:27,435 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:27,435 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:27,435 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:27,435 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:27,435 INFO ]: Start difference. First operand 84 states and 141 transitions. Second operand 5 states. [2018-06-22 01:32:28,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:28,368 INFO ]: Finished difference Result 274 states and 736 transitions. [2018-06-22 01:32:28,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:32:28,370 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-22 01:32:28,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:28,394 INFO ]: With dead ends: 274 [2018-06-22 01:32:28,394 INFO ]: Without dead ends: 274 [2018-06-22 01:32:28,395 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:32:28,395 INFO ]: Start minimizeSevpa. Operand 274 states. [2018-06-22 01:32:28,450 INFO ]: Finished minimizeSevpa. Reduced states from 274 to 84. [2018-06-22 01:32:28,450 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 01:32:28,452 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 141 transitions. [2018-06-22 01:32:28,452 INFO ]: Start accepts. Automaton has 84 states and 141 transitions. Word has length 19 [2018-06-22 01:32:28,452 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:28,452 INFO ]: Abstraction has 84 states and 141 transitions. [2018-06-22 01:32:28,452 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:28,453 INFO ]: Start isEmpty. Operand 84 states and 141 transitions. [2018-06-22 01:32:28,456 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:28,456 INFO ]: Found error trace [2018-06-22 01:32:28,456 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:28,457 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:28,457 INFO ]: Analyzing trace with hash 790051147, now seen corresponding path program 1 times [2018-06-22 01:32:28,457 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:28,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:28,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:28,458 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:28,458 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:28,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:28,568 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:32:28,568 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:28,568 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 01:32:28,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:28,619 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:28,626 INFO ]: Computing forward predicates... [2018-06-22 01:32:28,680 INFO ]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:32:28,713 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:28,713 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-22 01:32:28,714 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:32:28,714 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:32:28,714 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:32:28,714 INFO ]: Start difference. First operand 84 states and 141 transitions. Second operand 6 states. [2018-06-22 01:32:29,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:29,509 INFO ]: Finished difference Result 252 states and 520 transitions. [2018-06-22 01:32:29,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:29,531 INFO ]: Start accepts. Automaton has 6 states. Word has length 19 [2018-06-22 01:32:29,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:29,538 INFO ]: With dead ends: 252 [2018-06-22 01:32:29,538 INFO ]: Without dead ends: 252 [2018-06-22 01:32:29,539 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:32:29,539 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-22 01:32:29,574 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 96. [2018-06-22 01:32:29,574 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-22 01:32:29,576 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 171 transitions. [2018-06-22 01:32:29,576 INFO ]: Start accepts. Automaton has 96 states and 171 transitions. Word has length 19 [2018-06-22 01:32:29,576 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:29,576 INFO ]: Abstraction has 96 states and 171 transitions. [2018-06-22 01:32:29,576 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:32:29,576 INFO ]: Start isEmpty. Operand 96 states and 171 transitions. [2018-06-22 01:32:29,582 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:29,582 INFO ]: Found error trace [2018-06-22 01:32:29,582 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:29,582 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:29,582 INFO ]: Analyzing trace with hash -875936181, now seen corresponding path program 1 times [2018-06-22 01:32:29,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:29,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:29,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:29,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:29,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:29,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:29,694 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:32:29,694 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:29,694 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:32:29,694 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:32:29,695 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:32:29,695 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:32:29,695 INFO ]: Start difference. First operand 96 states and 171 transitions. Second operand 3 states. [2018-06-22 01:32:29,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:29,982 INFO ]: Finished difference Result 141 states and 249 transitions. [2018-06-22 01:32:29,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:32:29,982 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-22 01:32:29,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:29,985 INFO ]: With dead ends: 141 [2018-06-22 01:32:29,985 INFO ]: Without dead ends: 141 [2018-06-22 01:32:29,985 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-22 01:32:29,985 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 01:32:29,998 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 99. [2018-06-22 01:32:29,998 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 01:32:30,000 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 177 transitions. [2018-06-22 01:32:30,000 INFO ]: Start accepts. Automaton has 99 states and 177 transitions. Word has length 19 [2018-06-22 01:32:30,000 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:30,000 INFO ]: Abstraction has 99 states and 177 transitions. [2018-06-22 01:32:30,000 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:32:30,000 INFO ]: Start isEmpty. Operand 99 states and 177 transitions. [2018-06-22 01:32:30,007 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:32:30,007 INFO ]: Found error trace [2018-06-22 01:32:30,007 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:30,007 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:30,007 INFO ]: Analyzing trace with hash -936909836, now seen corresponding path program 1 times [2018-06-22 01:32:30,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:30,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:30,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,008 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:30,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:30,135 INFO ]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:32:30,135 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:30,135 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:30,136 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:30,136 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:30,136 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:30,136 INFO ]: Start difference. First operand 99 states and 177 transitions. Second operand 5 states. [2018-06-22 01:32:30,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:30,515 INFO ]: Finished difference Result 223 states and 407 transitions. [2018-06-22 01:32:30,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:32:30,516 INFO ]: Start accepts. Automaton has 5 states. Word has length 27 [2018-06-22 01:32:30,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:30,519 INFO ]: With dead ends: 223 [2018-06-22 01:32:30,519 INFO ]: Without dead ends: 138 [2018-06-22 01:32:30,519 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:32:30,519 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 01:32:30,529 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 100. [2018-06-22 01:32:30,529 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 01:32:30,530 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 177 transitions. [2018-06-22 01:32:30,530 INFO ]: Start accepts. Automaton has 100 states and 177 transitions. Word has length 27 [2018-06-22 01:32:30,530 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:30,530 INFO ]: Abstraction has 100 states and 177 transitions. [2018-06-22 01:32:30,530 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:30,530 INFO ]: Start isEmpty. Operand 100 states and 177 transitions. [2018-06-22 01:32:30,534 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:32:30,534 INFO ]: Found error trace [2018-06-22 01:32:30,534 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:30,534 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:30,535 INFO ]: Analyzing trace with hash 2016044291, now seen corresponding path program 1 times [2018-06-22 01:32:30,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:30,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:30,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:30,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:30,596 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 01:32:30,596 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:30,596 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:30,597 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:30,597 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:30,597 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:30,597 INFO ]: Start difference. First operand 100 states and 177 transitions. Second operand 4 states. [2018-06-22 01:32:30,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:30,688 INFO ]: Finished difference Result 125 states and 221 transitions. [2018-06-22 01:32:30,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:30,689 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 01:32:30,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:30,690 INFO ]: With dead ends: 125 [2018-06-22 01:32:30,690 INFO ]: Without dead ends: 100 [2018-06-22 01:32:30,690 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:30,690 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 01:32:30,696 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-06-22 01:32:30,696 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-22 01:32:30,697 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-06-22 01:32:30,697 INFO ]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 27 [2018-06-22 01:32:30,697 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:30,697 INFO ]: Abstraction has 100 states and 175 transitions. [2018-06-22 01:32:30,698 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:30,698 INFO ]: Start isEmpty. Operand 100 states and 175 transitions. [2018-06-22 01:32:30,700 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:32:30,700 INFO ]: Found error trace [2018-06-22 01:32:30,700 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:30,700 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:30,700 INFO ]: Analyzing trace with hash 720216290, now seen corresponding path program 1 times [2018-06-22 01:32:30,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:30,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:30,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:30,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:30,769 INFO ]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:32:30,769 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:30,769 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:30,769 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:30,769 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:30,769 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:30,769 INFO ]: Start difference. First operand 100 states and 175 transitions. Second operand 4 states. [2018-06-22 01:32:30,908 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:30,908 INFO ]: Finished difference Result 166 states and 335 transitions. [2018-06-22 01:32:30,908 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:30,908 INFO ]: Start accepts. Automaton has 4 states. Word has length 28 [2018-06-22 01:32:30,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:30,911 INFO ]: With dead ends: 166 [2018-06-22 01:32:30,911 INFO ]: Without dead ends: 166 [2018-06-22 01:32:30,912 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:30,912 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 01:32:30,921 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 103. [2018-06-22 01:32:30,921 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-22 01:32:30,922 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 181 transitions. [2018-06-22 01:32:30,922 INFO ]: Start accepts. Automaton has 103 states and 181 transitions. Word has length 28 [2018-06-22 01:32:30,923 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:30,923 INFO ]: Abstraction has 103 states and 181 transitions. [2018-06-22 01:32:30,923 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:30,923 INFO ]: Start isEmpty. Operand 103 states and 181 transitions. [2018-06-22 01:32:30,925 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:32:30,925 INFO ]: Found error trace [2018-06-22 01:32:30,925 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:30,925 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:30,925 INFO ]: Analyzing trace with hash -672730915, now seen corresponding path program 1 times [2018-06-22 01:32:30,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:30,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:30,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:30,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:30,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:31,013 INFO ]: Checked inductivity of 25 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:32:31,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:31,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:31,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:31,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:31,099 INFO ]: Computing forward predicates... [2018-06-22 01:32:31,279 INFO ]: Checked inductivity of 25 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:32:31,299 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:31,299 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-22 01:32:31,299 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:32:31,300 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:32:31,300 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:32:31,300 INFO ]: Start difference. First operand 103 states and 181 transitions. Second operand 9 states. [2018-06-22 01:32:32,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:32,259 INFO ]: Finished difference Result 228 states and 504 transitions. [2018-06-22 01:32:32,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 01:32:32,259 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 01:32:32,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:32,264 INFO ]: With dead ends: 228 [2018-06-22 01:32:32,264 INFO ]: Without dead ends: 228 [2018-06-22 01:32:32,264 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:32:32,265 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-22 01:32:32,277 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 129. [2018-06-22 01:32:32,277 INFO ]: Start removeUnreachable. Operand 129 states. [2018-06-22 01:32:32,279 INFO ]: Finished removeUnreachable. Reduced from 129 states to 129 states and 252 transitions. [2018-06-22 01:32:32,279 INFO ]: Start accepts. Automaton has 129 states and 252 transitions. Word has length 29 [2018-06-22 01:32:32,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:32,279 INFO ]: Abstraction has 129 states and 252 transitions. [2018-06-22 01:32:32,279 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:32:32,279 INFO ]: Start isEmpty. Operand 129 states and 252 transitions. [2018-06-22 01:32:32,283 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 01:32:32,283 INFO ]: Found error trace [2018-06-22 01:32:32,283 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:32,283 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:32,283 INFO ]: Analyzing trace with hash 315612389, now seen corresponding path program 1 times [2018-06-22 01:32:32,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:32,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:32,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:32,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:32,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:32,297 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:32,358 INFO ]: Checked inductivity of 25 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:32:32,358 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:32,358 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:32,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:32,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:32,433 INFO ]: Computing forward predicates... [2018-06-22 01:32:32,493 INFO ]: Checked inductivity of 25 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 01:32:32,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:32,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-22 01:32:32,514 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:32:32,514 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:32:32,514 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:32:32,514 INFO ]: Start difference. First operand 129 states and 252 transitions. Second operand 9 states. [2018-06-22 01:32:32,919 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-06-22 01:32:33,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:33,350 INFO ]: Finished difference Result 253 states and 596 transitions. [2018-06-22 01:32:33,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:32:33,351 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 01:32:33,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:33,357 INFO ]: With dead ends: 253 [2018-06-22 01:32:33,357 INFO ]: Without dead ends: 253 [2018-06-22 01:32:33,357 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:32:33,357 INFO ]: Start minimizeSevpa. Operand 253 states. [2018-06-22 01:32:33,373 INFO ]: Finished minimizeSevpa. Reduced states from 253 to 156. [2018-06-22 01:32:33,373 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-22 01:32:33,376 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 353 transitions. [2018-06-22 01:32:33,376 INFO ]: Start accepts. Automaton has 156 states and 353 transitions. Word has length 29 [2018-06-22 01:32:33,376 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:33,376 INFO ]: Abstraction has 156 states and 353 transitions. [2018-06-22 01:32:33,376 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:32:33,376 INFO ]: Start isEmpty. Operand 156 states and 353 transitions. [2018-06-22 01:32:33,382 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:32:33,382 INFO ]: Found error trace [2018-06-22 01:32:33,382 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:33,382 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:33,382 INFO ]: Analyzing trace with hash -1114877501, now seen corresponding path program 2 times [2018-06-22 01:32:33,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:33,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:33,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:33,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:33,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:33,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:33,607 INFO ]: Checked inductivity of 54 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 01:32:33,607 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:33,607 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:32:33,622 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:33,701 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:32:33,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:33,706 INFO ]: Computing forward predicates... [2018-06-22 01:32:34,039 INFO ]: Checked inductivity of 54 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:32:34,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:34,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-22 01:32:34,060 INFO ]: Interpolant automaton has 15 states [2018-06-22 01:32:34,060 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 01:32:34,060 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:32:34,060 INFO ]: Start difference. First operand 156 states and 353 transitions. Second operand 15 states. [2018-06-22 01:32:39,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:39,436 INFO ]: Finished difference Result 892 states and 5074 transitions. [2018-06-22 01:32:39,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:32:39,436 INFO ]: Start accepts. Automaton has 15 states. Word has length 39 [2018-06-22 01:32:39,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:39,534 INFO ]: With dead ends: 892 [2018-06-22 01:32:39,534 INFO ]: Without dead ends: 892 [2018-06-22 01:32:39,536 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 01:32:39,537 INFO ]: Start minimizeSevpa. Operand 892 states. [2018-06-22 01:32:39,843 INFO ]: Finished minimizeSevpa. Reduced states from 892 to 168. [2018-06-22 01:32:39,843 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-22 01:32:39,846 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 388 transitions. [2018-06-22 01:32:39,846 INFO ]: Start accepts. Automaton has 168 states and 388 transitions. Word has length 39 [2018-06-22 01:32:39,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:39,847 INFO ]: Abstraction has 168 states and 388 transitions. [2018-06-22 01:32:39,847 INFO ]: Interpolant automaton has 15 states. [2018-06-22 01:32:39,847 INFO ]: Start isEmpty. Operand 168 states and 388 transitions. [2018-06-22 01:32:39,850 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-22 01:32:39,850 INFO ]: Found error trace [2018-06-22 01:32:39,850 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:39,851 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:39,851 INFO ]: Analyzing trace with hash -730314805, now seen corresponding path program 2 times [2018-06-22 01:32:39,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:39,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:39,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:39,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:32:39,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:39,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:40,034 INFO ]: Checked inductivity of 54 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 01:32:40,035 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:40,035 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:32:40,050 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:40,127 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:32:40,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:40,132 INFO ]: Computing forward predicates... [2018-06-22 01:32:40,421 INFO ]: Checked inductivity of 54 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:32:40,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:40,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-06-22 01:32:40,443 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:32:40,443 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:32:40,443 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:32:40,443 INFO ]: Start difference. First operand 168 states and 388 transitions. Second operand 10 states. [2018-06-22 01:32:42,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:42,672 INFO ]: Finished difference Result 380 states and 799 transitions. [2018-06-22 01:32:42,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:32:42,672 INFO ]: Start accepts. Automaton has 10 states. Word has length 39 [2018-06-22 01:32:42,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:42,673 INFO ]: With dead ends: 380 [2018-06-22 01:32:42,673 INFO ]: Without dead ends: 0 [2018-06-22 01:32:42,673 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-06-22 01:32:42,673 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:32:42,673 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:32:42,673 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:32:42,673 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:32:42,673 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-06-22 01:32:42,673 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:42,673 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:32:42,673 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:32:42,673 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:32:42,673 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:32:42,679 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:42 BoogieIcfgContainer [2018-06-22 01:32:42,679 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:32:42,680 INFO ]: Toolchain (without parser) took 18364.91 ms. Allocated memory was 308.8 MB in the beginning and 495.5 MB in the end (delta: 186.6 MB). Free memory was 260.3 MB in the beginning and 415.2 MB in the end (delta: -154.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:42,681 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:32:42,686 INFO ]: ChcToBoogie took 104.02 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 258.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:42,686 INFO ]: Boogie Preprocessor took 52.76 ms. Allocated memory is still 308.8 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:42,687 INFO ]: RCFGBuilder took 497.31 ms. Allocated memory is still 308.8 MB. Free memory was 256.4 MB in the beginning and 236.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:42,687 INFO ]: TraceAbstraction took 17695.90 ms. Allocated memory was 308.8 MB in the beginning and 495.5 MB in the end (delta: 186.6 MB). Free memory was 236.3 MB in the beginning and 415.2 MB in the end (delta: -178.9 MB). Peak memory consumption was 7.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:42,690 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 104.02 ms. Allocated memory is still 308.8 MB. Free memory was 260.3 MB in the beginning and 258.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.76 ms. Allocated memory is still 308.8 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 497.31 ms. Allocated memory is still 308.8 MB. Free memory was 256.4 MB in the beginning and 236.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 17695.90 ms. Allocated memory was 308.8 MB in the beginning and 495.5 MB in the end (delta: 186.6 MB). Free memory was 236.3 MB in the beginning and 415.2 MB in the end (delta: -178.9 MB). Peak memory consumption was 7.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, 31 locations, 1 error locations. SAFE Result, 17.6s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 13.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1247 SDtfs, 1037 SDslu, 2870 SDs, 0 SdLazy, 6298 SolverSat, 1561 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=12, 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.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1466 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 29455 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1723 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 385/411 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/022b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-32-42-707.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-32-42-707.csv Received shutdown request...