java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:57:08,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:57:08,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:57:08,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:57:08,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:57:08,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:57:08,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:57:08,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:57:08,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:57:08,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:57:08,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:57:08,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:57:08,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:57:08,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:57:08,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:57:08,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:57:08,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:57:08,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:57:08,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:57:08,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:57:08,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:57:08,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:57:08,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:57:08,253 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:57:08,254 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:57:08,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:57:08,255 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:57:08,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:57:08,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:57:08,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:57:08,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:57:08,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:57:08,265 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:57:08,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:57:08,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:57:08,267 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:57:08,292 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:57:08,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:57:08,293 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:57:08,293 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:57:08,294 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:57:08,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:57:08,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:57:08,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:57:08,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:57:08,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:57:08,295 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:57:08,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:57:08,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:57:08,296 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:57:08,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:57:08,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:57:08,296 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:57:08,298 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:57:08,299 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:57:08,351 INFO ]: Repository-Root is: /tmp [2018-06-22 00:57:08,365 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:57:08,369 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:57:08,371 INFO ]: Initializing SmtParser... [2018-06-22 00:57:08,371 INFO ]: SmtParser initialized [2018-06-22 00:57:08,372 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 [2018-06-22 00:57:08,373 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 00:57:08,459 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 unknown [2018-06-22 00:57:08,879 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/14.c.smt2 [2018-06-22 00:57:08,884 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:57:08,890 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:57:08,890 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:57:08,890 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:57:08,890 INFO ]: ChcToBoogie initialized [2018-06-22 00:57:08,893 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:08,972 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08 Unit [2018-06-22 00:57:08,972 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:57:08,973 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:57:08,973 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:57:08,973 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:57:08,993 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:08,993 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:09,004 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:09,005 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:09,022 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:09,023 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:09,025 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (1/1) ... [2018-06-22 00:57:09,028 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:57:09,028 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:57:09,028 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:57:09,028 INFO ]: RCFGBuilder initialized [2018-06-22 00:57:09,037 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (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 00:57:09,051 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:57:09,052 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:57:09,052 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:57:09,052 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:57:09,052 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:57:09,052 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 00:57:09,673 INFO ]: Using library mode [2018-06-22 00:57:09,673 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:57:09 BoogieIcfgContainer [2018-06-22 00:57:09,673 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:57:09,675 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:57:09,675 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:57:09,678 INFO ]: TraceAbstraction initialized [2018-06-22 00:57:09,679 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:57:08" (1/3) ... [2018-06-22 00:57:09,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf24250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:57:09, skipping insertion in model container [2018-06-22 00:57:09,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:57:08" (2/3) ... [2018-06-22 00:57:09,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf24250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:57:09, skipping insertion in model container [2018-06-22 00:57:09,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:57:09" (3/3) ... [2018-06-22 00:57:09,682 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:57:09,691 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:57:09,703 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:57:09,758 INFO ]: Using default assertion order modulation [2018-06-22 00:57:09,758 INFO ]: Interprodecural is true [2018-06-22 00:57:09,758 INFO ]: Hoare is false [2018-06-22 00:57:09,758 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:57:09,758 INFO ]: Backedges is TWOTRACK [2018-06-22 00:57:09,758 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:57:09,758 INFO ]: Difference is false [2018-06-22 00:57:09,758 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:57:09,759 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:57:09,777 INFO ]: Start isEmpty. Operand 36 states. [2018-06-22 00:57:09,793 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 00:57:09,793 INFO ]: Found error trace [2018-06-22 00:57:09,794 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:09,795 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:09,800 INFO ]: Analyzing trace with hash -209602845, now seen corresponding path program 1 times [2018-06-22 00:57:09,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:09,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:09,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:09,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:09,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:09,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:10,995 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:10,998 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:10,998 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 00:57:11,000 INFO ]: Interpolant automaton has 14 states [2018-06-22 00:57:11,013 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 00:57:11,013 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 00:57:11,016 INFO ]: Start difference. First operand 36 states. Second operand 14 states. [2018-06-22 00:57:11,908 WARN ]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-06-22 00:57:12,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:12,208 INFO ]: Finished difference Result 78 states and 86 transitions. [2018-06-22 00:57:12,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:57:12,211 INFO ]: Start accepts. Automaton has 14 states. Word has length 20 [2018-06-22 00:57:12,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:12,221 INFO ]: With dead ends: 78 [2018-06-22 00:57:12,221 INFO ]: Without dead ends: 72 [2018-06-22 00:57:12,223 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:57:12,242 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 00:57:12,264 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 40. [2018-06-22 00:57:12,265 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 00:57:12,266 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 00:57:12,267 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 20 [2018-06-22 00:57:12,267 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:12,267 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 00:57:12,267 INFO ]: Interpolant automaton has 14 states. [2018-06-22 00:57:12,268 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 00:57:12,268 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 00:57:12,268 INFO ]: Found error trace [2018-06-22 00:57:12,268 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:12,269 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:12,269 INFO ]: Analyzing trace with hash 562408424, now seen corresponding path program 1 times [2018-06-22 00:57:12,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:12,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:12,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:12,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:12,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:12,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:12,809 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:12,809 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:12,809 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-22 00:57:12,810 INFO ]: Interpolant automaton has 16 states [2018-06-22 00:57:12,811 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 00:57:12,811 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-22 00:57:12,811 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 16 states. [2018-06-22 00:57:14,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:14,008 INFO ]: Finished difference Result 91 states and 101 transitions. [2018-06-22 00:57:14,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:57:14,013 INFO ]: Start accepts. Automaton has 16 states. Word has length 22 [2018-06-22 00:57:14,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:14,015 INFO ]: With dead ends: 91 [2018-06-22 00:57:14,015 INFO ]: Without dead ends: 85 [2018-06-22 00:57:14,016 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=895, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 00:57:14,016 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-22 00:57:14,020 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 36. [2018-06-22 00:57:14,020 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 00:57:14,021 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 00:57:14,021 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2018-06-22 00:57:14,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:14,021 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 00:57:14,021 INFO ]: Interpolant automaton has 16 states. [2018-06-22 00:57:14,021 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 00:57:14,022 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:14,022 INFO ]: Found error trace [2018-06-22 00:57:14,022 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:14,022 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:14,023 INFO ]: Analyzing trace with hash -1585898667, now seen corresponding path program 1 times [2018-06-22 00:57:14,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:14,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:14,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:14,023 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:14,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:14,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:14,451 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:14,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:14,451 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) [2018-06-22 00:57:14,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:14,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:14,557 INFO ]: Computing forward predicates... [2018-06-22 00:57:14,883 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:14,907 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:14,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 29 [2018-06-22 00:57:14,907 INFO ]: Interpolant automaton has 29 states [2018-06-22 00:57:14,907 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 00:57:14,907 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-22 00:57:14,908 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 29 states. [2018-06-22 00:57:15,551 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-06-22 00:57:17,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:17,336 INFO ]: Finished difference Result 132 states and 146 transitions. [2018-06-22 00:57:17,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 00:57:17,336 INFO ]: Start accepts. Automaton has 29 states. Word has length 29 [2018-06-22 00:57:17,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:17,338 INFO ]: With dead ends: 132 [2018-06-22 00:57:17,338 INFO ]: Without dead ends: 126 [2018-06-22 00:57:17,339 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=932, Invalid=3358, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 00:57:17,339 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 00:57:17,345 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 49. [2018-06-22 00:57:17,345 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 00:57:17,346 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-06-22 00:57:17,346 INFO ]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-06-22 00:57:17,347 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:17,347 INFO ]: Abstraction has 49 states and 53 transitions. [2018-06-22 00:57:17,347 INFO ]: Interpolant automaton has 29 states. [2018-06-22 00:57:17,347 INFO ]: Start isEmpty. Operand 49 states and 53 transitions. [2018-06-22 00:57:17,347 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:17,347 INFO ]: Found error trace [2018-06-22 00:57:17,348 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:17,348 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:17,348 INFO ]: Analyzing trace with hash 124132505, now seen corresponding path program 1 times [2018-06-22 00:57:17,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:17,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:17,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:17,349 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:17,349 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:17,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:18,150 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:18,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:18,150 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) [2018-06-22 00:57:18,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:18,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:18,254 INFO ]: Computing forward predicates... [2018-06-22 00:57:18,591 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:18,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:18,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2018-06-22 00:57:18,610 INFO ]: Interpolant automaton has 37 states [2018-06-22 00:57:18,610 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 00:57:18,612 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1252, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 00:57:18,612 INFO ]: Start difference. First operand 49 states and 53 transitions. Second operand 37 states. [2018-06-22 00:57:20,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:20,510 INFO ]: Finished difference Result 184 states and 203 transitions. [2018-06-22 00:57:20,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 00:57:20,511 INFO ]: Start accepts. Automaton has 37 states. Word has length 29 [2018-06-22 00:57:20,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:20,513 INFO ]: With dead ends: 184 [2018-06-22 00:57:20,513 INFO ]: Without dead ends: 178 [2018-06-22 00:57:20,515 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1079, Invalid=3751, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 00:57:20,515 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 00:57:20,522 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 58. [2018-06-22 00:57:20,522 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 00:57:20,523 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-06-22 00:57:20,523 INFO ]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 29 [2018-06-22 00:57:20,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:20,523 INFO ]: Abstraction has 58 states and 64 transitions. [2018-06-22 00:57:20,523 INFO ]: Interpolant automaton has 37 states. [2018-06-22 00:57:20,523 INFO ]: Start isEmpty. Operand 58 states and 64 transitions. [2018-06-22 00:57:20,526 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 00:57:20,526 INFO ]: Found error trace [2018-06-22 00:57:20,526 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:20,526 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:20,526 INFO ]: Analyzing trace with hash 836607193, now seen corresponding path program 1 times [2018-06-22 00:57:20,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:20,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:20,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:20,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:20,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:20,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:20,931 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:20,931 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:20,931 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 00:57:20,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:20,997 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:21,001 INFO ]: Computing forward predicates... [2018-06-22 00:57:21,413 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:21,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:21,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2018-06-22 00:57:21,433 INFO ]: Interpolant automaton has 37 states [2018-06-22 00:57:21,433 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 00:57:21,434 INFO ]: CoverageRelationStatistics Valid=80, Invalid=1252, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 00:57:21,434 INFO ]: Start difference. First operand 58 states and 64 transitions. Second operand 37 states. [2018-06-22 00:57:23,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:23,427 INFO ]: Finished difference Result 185 states and 206 transitions. [2018-06-22 00:57:23,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 00:57:23,427 INFO ]: Start accepts. Automaton has 37 states. Word has length 29 [2018-06-22 00:57:23,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:23,429 INFO ]: With dead ends: 185 [2018-06-22 00:57:23,429 INFO ]: Without dead ends: 179 [2018-06-22 00:57:23,430 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1079, Invalid=3751, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 00:57:23,430 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 00:57:23,438 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 68. [2018-06-22 00:57:23,438 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 00:57:23,439 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-06-22 00:57:23,439 INFO ]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 29 [2018-06-22 00:57:23,439 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:23,439 INFO ]: Abstraction has 68 states and 77 transitions. [2018-06-22 00:57:23,439 INFO ]: Interpolant automaton has 37 states. [2018-06-22 00:57:23,439 INFO ]: Start isEmpty. Operand 68 states and 77 transitions. [2018-06-22 00:57:23,440 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:57:23,440 INFO ]: Found error trace [2018-06-22 00:57:23,440 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:23,440 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:23,440 INFO ]: Analyzing trace with hash -1786250256, now seen corresponding path program 1 times [2018-06-22 00:57:23,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:23,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:23,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:23,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:23,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:23,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:24,480 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:24,480 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:24,480 INFO ]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-06-22 00:57:24,480 INFO ]: Interpolant automaton has 25 states [2018-06-22 00:57:24,480 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 00:57:24,480 INFO ]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-22 00:57:24,481 INFO ]: Start difference. First operand 68 states and 77 transitions. Second operand 25 states. [2018-06-22 00:57:26,171 WARN ]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-06-22 00:57:26,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:26,621 INFO ]: Finished difference Result 170 states and 191 transitions. [2018-06-22 00:57:26,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 00:57:26,621 INFO ]: Start accepts. Automaton has 25 states. Word has length 31 [2018-06-22 00:57:26,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:26,622 INFO ]: With dead ends: 170 [2018-06-22 00:57:26,622 INFO ]: Without dead ends: 164 [2018-06-22 00:57:26,623 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=941, Invalid=2251, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 00:57:26,623 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 00:57:26,633 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 77. [2018-06-22 00:57:26,633 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 00:57:26,634 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-06-22 00:57:26,634 INFO ]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 31 [2018-06-22 00:57:26,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:26,635 INFO ]: Abstraction has 77 states and 87 transitions. [2018-06-22 00:57:26,635 INFO ]: Interpolant automaton has 25 states. [2018-06-22 00:57:26,635 INFO ]: Start isEmpty. Operand 77 states and 87 transitions. [2018-06-22 00:57:26,636 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:57:26,636 INFO ]: Found error trace [2018-06-22 00:57:26,636 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:26,636 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:26,636 INFO ]: Analyzing trace with hash -76219084, now seen corresponding path program 1 times [2018-06-22 00:57:26,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:26,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:26,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:26,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:26,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:26,655 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:27,147 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:27,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:27,169 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:27,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:27,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:27,247 INFO ]: Computing forward predicates... [2018-06-22 00:57:28,196 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:28,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:28,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 39 [2018-06-22 00:57:28,219 INFO ]: Interpolant automaton has 39 states [2018-06-22 00:57:28,219 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 00:57:28,219 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1396, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 00:57:28,220 INFO ]: Start difference. First operand 77 states and 87 transitions. Second operand 39 states. [2018-06-22 00:57:29,650 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-06-22 00:57:30,544 WARN ]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-06-22 00:57:30,885 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-06-22 00:57:31,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:31,211 INFO ]: Finished difference Result 216 states and 241 transitions. [2018-06-22 00:57:31,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 00:57:31,213 INFO ]: Start accepts. Automaton has 39 states. Word has length 31 [2018-06-22 00:57:31,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:31,214 INFO ]: With dead ends: 216 [2018-06-22 00:57:31,214 INFO ]: Without dead ends: 210 [2018-06-22 00:57:31,216 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1523, Invalid=5787, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 00:57:31,216 INFO ]: Start minimizeSevpa. Operand 210 states. [2018-06-22 00:57:31,225 INFO ]: Finished minimizeSevpa. Reduced states from 210 to 82. [2018-06-22 00:57:31,225 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-22 00:57:31,227 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2018-06-22 00:57:31,227 INFO ]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 31 [2018-06-22 00:57:31,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:31,227 INFO ]: Abstraction has 82 states and 94 transitions. [2018-06-22 00:57:31,227 INFO ]: Interpolant automaton has 39 states. [2018-06-22 00:57:31,227 INFO ]: Start isEmpty. Operand 82 states and 94 transitions. [2018-06-22 00:57:31,228 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 00:57:31,228 INFO ]: Found error trace [2018-06-22 00:57:31,228 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:31,228 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:31,228 INFO ]: Analyzing trace with hash 636255604, now seen corresponding path program 1 times [2018-06-22 00:57:31,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:31,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:31,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:31,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:31,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:31,253 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:32,235 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:32,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:32,235 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:32,241 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:32,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:32,303 INFO ]: Computing forward predicates... [2018-06-22 00:57:32,618 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:32,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:32,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 39 [2018-06-22 00:57:32,638 INFO ]: Interpolant automaton has 39 states [2018-06-22 00:57:32,638 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-22 00:57:32,639 INFO ]: CoverageRelationStatistics Valid=86, Invalid=1396, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 00:57:32,639 INFO ]: Start difference. First operand 82 states and 94 transitions. Second operand 39 states. [2018-06-22 00:57:35,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:35,050 INFO ]: Finished difference Result 207 states and 231 transitions. [2018-06-22 00:57:35,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 00:57:35,053 INFO ]: Start accepts. Automaton has 39 states. Word has length 31 [2018-06-22 00:57:35,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:35,054 INFO ]: With dead ends: 207 [2018-06-22 00:57:35,054 INFO ]: Without dead ends: 201 [2018-06-22 00:57:35,056 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1523, Invalid=5787, Unknown=0, NotChecked=0, Total=7310 [2018-06-22 00:57:35,056 INFO ]: Start minimizeSevpa. Operand 201 states. [2018-06-22 00:57:35,066 INFO ]: Finished minimizeSevpa. Reduced states from 201 to 83. [2018-06-22 00:57:35,066 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 00:57:35,067 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-06-22 00:57:35,067 INFO ]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 31 [2018-06-22 00:57:35,067 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:35,067 INFO ]: Abstraction has 83 states and 95 transitions. [2018-06-22 00:57:35,067 INFO ]: Interpolant automaton has 39 states. [2018-06-22 00:57:35,067 INFO ]: Start isEmpty. Operand 83 states and 95 transitions. [2018-06-22 00:57:35,069 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:35,069 INFO ]: Found error trace [2018-06-22 00:57:35,069 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:35,069 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:35,069 INFO ]: Analyzing trace with hash 843487011, now seen corresponding path program 2 times [2018-06-22 00:57:35,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:35,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:35,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:35,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:35,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:35,089 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:35,721 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:35,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:35,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:35,727 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:57:35,804 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:57:35,804 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:35,817 INFO ]: Computing forward predicates... [2018-06-22 00:57:36,135 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:57:36,156 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:36,156 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 42 [2018-06-22 00:57:36,157 INFO ]: Interpolant automaton has 42 states [2018-06-22 00:57:36,157 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 00:57:36,157 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1629, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 00:57:36,157 INFO ]: Start difference. First operand 83 states and 95 transitions. Second operand 42 states. [2018-06-22 00:57:38,265 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:38,265 INFO ]: Finished difference Result 221 states and 248 transitions. [2018-06-22 00:57:38,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-22 00:57:38,265 INFO ]: Start accepts. Automaton has 42 states. Word has length 38 [2018-06-22 00:57:38,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:38,267 INFO ]: With dead ends: 221 [2018-06-22 00:57:38,267 INFO ]: Without dead ends: 215 [2018-06-22 00:57:38,268 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1189, Invalid=6293, Unknown=0, NotChecked=0, Total=7482 [2018-06-22 00:57:38,268 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-22 00:57:38,273 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 81. [2018-06-22 00:57:38,274 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 00:57:38,276 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2018-06-22 00:57:38,276 INFO ]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 38 [2018-06-22 00:57:38,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:38,276 INFO ]: Abstraction has 81 states and 93 transitions. [2018-06-22 00:57:38,276 INFO ]: Interpolant automaton has 42 states. [2018-06-22 00:57:38,277 INFO ]: Start isEmpty. Operand 81 states and 93 transitions. [2018-06-22 00:57:38,278 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:38,278 INFO ]: Found error trace [2018-06-22 00:57:38,278 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:38,278 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:38,278 INFO ]: Analyzing trace with hash -1741449113, now seen corresponding path program 1 times [2018-06-22 00:57:38,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:38,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:38,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:38,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:38,393 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:38,393 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:38,393 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:38,393 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:38,394 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:38,394 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:38,394 INFO ]: Start difference. First operand 81 states and 93 transitions. Second operand 11 states. [2018-06-22 00:57:38,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:38,666 INFO ]: Finished difference Result 176 states and 196 transitions. [2018-06-22 00:57:38,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 00:57:38,666 INFO ]: Start accepts. Automaton has 11 states. Word has length 38 [2018-06-22 00:57:38,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:38,668 INFO ]: With dead ends: 176 [2018-06-22 00:57:38,668 INFO ]: Without dead ends: 175 [2018-06-22 00:57:38,668 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2018-06-22 00:57:38,668 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-22 00:57:38,672 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 89. [2018-06-22 00:57:38,672 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-22 00:57:38,673 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2018-06-22 00:57:38,673 INFO ]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 38 [2018-06-22 00:57:38,673 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:38,673 INFO ]: Abstraction has 89 states and 103 transitions. [2018-06-22 00:57:38,673 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:38,673 INFO ]: Start isEmpty. Operand 89 states and 103 transitions. [2018-06-22 00:57:38,675 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:38,675 INFO ]: Found error trace [2018-06-22 00:57:38,675 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:38,676 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:38,676 INFO ]: Analyzing trace with hash -1028974425, now seen corresponding path program 1 times [2018-06-22 00:57:38,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:38,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:38,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:38,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:38,792 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:38,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:38,792 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:38,792 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:38,792 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:38,792 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:38,792 INFO ]: Start difference. First operand 89 states and 103 transitions. Second operand 11 states. [2018-06-22 00:57:38,923 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:38,923 INFO ]: Finished difference Result 124 states and 138 transitions. [2018-06-22 00:57:38,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:57:38,924 INFO ]: Start accepts. Automaton has 11 states. Word has length 38 [2018-06-22 00:57:38,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:38,925 INFO ]: With dead ends: 124 [2018-06-22 00:57:38,925 INFO ]: Without dead ends: 105 [2018-06-22 00:57:38,925 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:57:38,925 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 00:57:38,929 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 79. [2018-06-22 00:57:38,929 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 00:57:38,931 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-06-22 00:57:38,931 INFO ]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 38 [2018-06-22 00:57:38,931 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:38,931 INFO ]: Abstraction has 79 states and 89 transitions. [2018-06-22 00:57:38,931 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:38,931 INFO ]: Start isEmpty. Operand 79 states and 89 transitions. [2018-06-22 00:57:38,932 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:38,932 INFO ]: Found error trace [2018-06-22 00:57:38,932 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:38,932 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:38,933 INFO ]: Analyzing trace with hash 1408025183, now seen corresponding path program 2 times [2018-06-22 00:57:38,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:38,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:38,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:38,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:38,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:39,256 INFO ]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:39,256 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:39,256 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:39,256 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:39,257 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:39,257 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:39,257 INFO ]: Start difference. First operand 79 states and 89 transitions. Second operand 11 states. [2018-06-22 00:57:39,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:39,379 INFO ]: Finished difference Result 86 states and 94 transitions. [2018-06-22 00:57:39,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:57:39,379 INFO ]: Start accepts. Automaton has 11 states. Word has length 38 [2018-06-22 00:57:39,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:39,380 INFO ]: With dead ends: 86 [2018-06-22 00:57:39,380 INFO ]: Without dead ends: 84 [2018-06-22 00:57:39,380 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:57:39,380 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 00:57:39,382 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-06-22 00:57:39,382 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 00:57:39,383 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-06-22 00:57:39,383 INFO ]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 38 [2018-06-22 00:57:39,383 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:39,383 INFO ]: Abstraction has 70 states and 76 transitions. [2018-06-22 00:57:39,383 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:39,383 INFO ]: Start isEmpty. Operand 70 states and 76 transitions. [2018-06-22 00:57:39,384 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:39,384 INFO ]: Found error trace [2018-06-22 00:57:39,384 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:39,384 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:39,384 INFO ]: Analyzing trace with hash -464436253, now seen corresponding path program 1 times [2018-06-22 00:57:39,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:39,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:39,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:39,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,395 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:39,632 INFO ]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:39,632 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:39,632 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:39,632 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:39,632 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:39,633 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:39,633 INFO ]: Start difference. First operand 70 states and 76 transitions. Second operand 11 states. [2018-06-22 00:57:39,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:39,758 INFO ]: Finished difference Result 119 states and 127 transitions. [2018-06-22 00:57:39,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:57:39,759 INFO ]: Start accepts. Automaton has 11 states. Word has length 38 [2018-06-22 00:57:39,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:39,759 INFO ]: With dead ends: 119 [2018-06-22 00:57:39,759 INFO ]: Without dead ends: 101 [2018-06-22 00:57:39,760 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:57:39,760 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 00:57:39,762 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 75. [2018-06-22 00:57:39,762 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 00:57:39,763 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-06-22 00:57:39,763 INFO ]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 38 [2018-06-22 00:57:39,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:39,763 INFO ]: Abstraction has 75 states and 80 transitions. [2018-06-22 00:57:39,763 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:39,763 INFO ]: Start isEmpty. Operand 75 states and 80 transitions. [2018-06-22 00:57:39,764 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 00:57:39,764 INFO ]: Found error trace [2018-06-22 00:57:39,764 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:39,764 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:39,764 INFO ]: Analyzing trace with hash 808356707, now seen corresponding path program 2 times [2018-06-22 00:57:39,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:39,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:39,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:57:39,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:39,862 INFO ]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:39,862 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:57:39,862 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:57:39,863 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:57:39,863 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:57:39,863 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:57:39,863 INFO ]: Start difference. First operand 75 states and 80 transitions. Second operand 11 states. [2018-06-22 00:57:39,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:39,990 INFO ]: Finished difference Result 94 states and 98 transitions. [2018-06-22 00:57:39,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:57:39,994 INFO ]: Start accepts. Automaton has 11 states. Word has length 38 [2018-06-22 00:57:39,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:39,994 INFO ]: With dead ends: 94 [2018-06-22 00:57:39,995 INFO ]: Without dead ends: 67 [2018-06-22 00:57:39,995 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 00:57:39,995 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 00:57:39,997 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-06-22 00:57:39,997 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 00:57:39,997 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-06-22 00:57:39,997 INFO ]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 38 [2018-06-22 00:57:39,997 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:39,997 INFO ]: Abstraction has 57 states and 59 transitions. [2018-06-22 00:57:39,997 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:57:39,997 INFO ]: Start isEmpty. Operand 57 states and 59 transitions. [2018-06-22 00:57:39,997 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 00:57:39,997 INFO ]: Found error trace [2018-06-22 00:57:39,998 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:39,998 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:39,999 INFO ]: Analyzing trace with hash -1593941656, now seen corresponding path program 2 times [2018-06-22 00:57:39,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:39,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:39,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:39,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:39,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:40,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:40,762 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:40,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:40,762 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:40,769 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:57:40,895 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:57:40,895 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:40,902 INFO ]: Computing forward predicates... [2018-06-22 00:57:41,477 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:57:41,497 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:41,497 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 46 [2018-06-22 00:57:41,498 INFO ]: Interpolant automaton has 46 states [2018-06-22 00:57:41,498 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 00:57:41,498 INFO ]: CoverageRelationStatistics Valid=103, Invalid=1967, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 00:57:41,498 INFO ]: Start difference. First operand 57 states and 59 transitions. Second operand 46 states. [2018-06-22 00:57:42,528 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-22 00:57:43,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:43,407 INFO ]: Finished difference Result 70 states and 71 transitions. [2018-06-22 00:57:43,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-22 00:57:43,407 INFO ]: Start accepts. Automaton has 46 states. Word has length 40 [2018-06-22 00:57:43,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:43,407 INFO ]: With dead ends: 70 [2018-06-22 00:57:43,407 INFO ]: Without dead ends: 42 [2018-06-22 00:57:43,409 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=909, Invalid=5097, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 00:57:43,409 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 00:57:43,410 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-06-22 00:57:43,410 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 00:57:43,410 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-22 00:57:43,410 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 40 [2018-06-22 00:57:43,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:43,410 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-22 00:57:43,410 INFO ]: Interpolant automaton has 46 states. [2018-06-22 00:57:43,410 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-22 00:57:43,411 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 00:57:43,411 INFO ]: Found error trace [2018-06-22 00:57:43,411 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:57:43,411 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:57:43,411 INFO ]: Analyzing trace with hash 1103800680, now seen corresponding path program 2 times [2018-06-22 00:57:43,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:57:43,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:57:43,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:43,412 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 00:57:43,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:57:43,430 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:44,582 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:57:44,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:57:44,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 00:57:44,588 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 00:57:44,664 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 00:57:44,665 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:57:44,670 INFO ]: Computing forward predicates... [2018-06-22 00:57:45,015 INFO ]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 00:57:45,037 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:57:45,037 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 46 [2018-06-22 00:57:45,037 INFO ]: Interpolant automaton has 46 states [2018-06-22 00:57:45,037 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 00:57:45,038 INFO ]: CoverageRelationStatistics Valid=103, Invalid=1967, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 00:57:45,038 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 46 states. [2018-06-22 00:57:46,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:57:46,708 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-22 00:57:46,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 00:57:46,708 INFO ]: Start accepts. Automaton has 46 states. Word has length 40 [2018-06-22 00:57:46,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:57:46,708 INFO ]: With dead ends: 42 [2018-06-22 00:57:46,708 INFO ]: Without dead ends: 0 [2018-06-22 00:57:46,709 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=837, Invalid=4713, Unknown=0, NotChecked=0, Total=5550 [2018-06-22 00:57:46,709 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:57:46,709 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:57:46,709 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:57:46,709 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:57:46,709 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-06-22 00:57:46,709 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:57:46,709 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:57:46,709 INFO ]: Interpolant automaton has 46 states. [2018-06-22 00:57:46,709 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:57:46,709 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:57:46,713 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:57:46 BoogieIcfgContainer [2018-06-22 00:57:46,713 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:57:46,714 INFO ]: Toolchain (without parser) took 37829.67 ms. Allocated memory was 308.3 MB in the beginning and 632.8 MB in the end (delta: 324.5 MB). Free memory was 247.7 MB in the beginning and 306.9 MB in the end (delta: -59.3 MB). Peak memory consumption was 265.3 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:46,714 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:57:46,714 INFO ]: ChcToBoogie took 82.23 ms. Allocated memory is still 308.3 MB. Free memory was 246.7 MB in the beginning and 244.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:46,714 INFO ]: Boogie Preprocessor took 55.02 ms. Allocated memory is still 308.3 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:46,715 INFO ]: RCFGBuilder took 645.20 ms. Allocated memory is still 308.3 MB. Free memory was 242.7 MB in the beginning and 211.6 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:46,715 INFO ]: TraceAbstraction took 37037.93 ms. Allocated memory was 308.3 MB in the beginning and 632.8 MB in the end (delta: 324.5 MB). Free memory was 211.6 MB in the beginning and 306.9 MB in the end (delta: -95.3 MB). Peak memory consumption was 229.2 MB. Max. memory is 3.6 GB. [2018-06-22 00:57:46,717 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 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.23 ms. Allocated memory is still 308.3 MB. Free memory was 246.7 MB in the beginning and 244.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 55.02 ms. Allocated memory is still 308.3 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 645.20 ms. Allocated memory is still 308.3 MB. Free memory was 242.7 MB in the beginning and 211.6 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 37037.93 ms. Allocated memory was 308.3 MB in the beginning and 632.8 MB in the end (delta: 324.5 MB). Free memory was 211.6 MB in the beginning and 306.9 MB in the end (delta: -95.3 MB). Peak memory consumption was 229.2 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, 36 locations, 1 error locations. SAFE Result, 36.9s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 659 SDtfs, 6386 SDslu, 15008 SDs, 0 SdLazy, 7354 SolverSat, 1211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7615 ImplicationChecksByTransitivity, 27.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1019 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 97433 SizeOfPredicates, 406 NumberOfNonLiveVariables, 4837 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 65/157 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/14.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-57-46-726.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/14.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-57-46-726.csv Received shutdown request...