java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:55:57,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:55:57,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:55:57,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:55:57,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:55:57,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:55:57,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:55:57,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:55:57,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:55:57,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:55:57,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:55:57,343 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:55:57,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:55:57,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:55:57,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:55:57,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:55:57,350 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:55:57,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:55:57,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:55:57,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:55:57,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:55:57,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:55:57,365 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:55:57,365 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:55:57,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:55:57,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:55:57,371 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:55:57,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:55:57,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:55:57,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:55:57,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:55:57,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:55:57,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:55:57,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:55:57,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:55:57,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:55:57,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:55:57,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:55:57,397 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:55:57,397 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:55:57,399 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:55:57,399 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:55:57,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:55:57,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:55:57,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:55:57,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:55:57,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:55:57,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:55:57,400 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:55:57,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:55:57,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:55:57,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:55:57,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:55:57,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:55:57,401 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:55:57,403 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:55:57,404 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:55:57,450 INFO ]: Repository-Root is: /tmp [2018-06-22 11:55:57,467 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:55:57,472 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:55:57,473 INFO ]: Initializing SmtParser... [2018-06-22 11:55:57,474 INFO ]: SmtParser initialized [2018-06-22 11:55:57,474 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-22 11:55:57,476 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:55:57,568 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@49d59bf3 [2018-06-22 11:55:57,799 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-22 11:55:57,803 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:55:57,808 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:55:57,809 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:55:57,809 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:55:57,809 INFO ]: ChcToBoogie initialized [2018-06-22 11:55:57,812 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,860 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57 Unit [2018-06-22 11:55:57,860 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:55:57,861 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:55:57,861 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:55:57,861 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:55:57,886 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,886 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,894 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,895 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,899 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,903 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,904 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... [2018-06-22 11:55:57,908 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:55:57,909 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:55:57,909 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:55:57,909 INFO ]: RCFGBuilder initialized [2018-06-22 11:55:57,910 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:55:57,929 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:55:57,929 INFO ]: Found specification of procedure False [2018-06-22 11:55:57,929 INFO ]: Found implementation of procedure False [2018-06-22 11:55:57,929 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 11:55:57,929 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 11:55:57,929 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 11:55:57,929 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 11:55:57,929 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 11:55:57,929 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 11:55:57,929 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 11:55:57,929 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 11:55:57,930 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 11:55:57,930 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 11:55:57,930 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 11:55:57,930 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 11:55:57,930 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 11:55:57,930 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 11:55:57,930 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 11:55:57,930 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 11:55:57,930 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 11:55:57,930 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 11:55:57,930 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:55:57,930 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:55:57,930 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:55:58,378 INFO ]: Using library mode [2018-06-22 11:55:58,378 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:58 BoogieIcfgContainer [2018-06-22 11:55:58,378 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:55:58,380 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:55:58,380 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:55:58,383 INFO ]: TraceAbstraction initialized [2018-06-22 11:55:58,383 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:57" (1/3) ... [2018-06-22 11:55:58,384 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6439b7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:55:58, skipping insertion in model container [2018-06-22 11:55:58,384 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:57" (2/3) ... [2018-06-22 11:55:58,384 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6439b7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:55:58, skipping insertion in model container [2018-06-22 11:55:58,384 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:58" (3/3) ... [2018-06-22 11:55:58,386 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:55:58,395 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:55:58,403 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:55:58,449 INFO ]: Using default assertion order modulation [2018-06-22 11:55:58,449 INFO ]: Interprodecural is true [2018-06-22 11:55:58,449 INFO ]: Hoare is false [2018-06-22 11:55:58,449 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:55:58,449 INFO ]: Backedges is TWOTRACK [2018-06-22 11:55:58,449 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:55:58,449 INFO ]: Difference is false [2018-06-22 11:55:58,449 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:55:58,449 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:55:58,470 INFO ]: Start isEmpty. Operand 47 states. [2018-06-22 11:55:58,485 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:55:58,485 INFO ]: Found error trace [2018-06-22 11:55:58,486 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:55:58,486 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:58,490 INFO ]: Analyzing trace with hash 130004611, now seen corresponding path program 1 times [2018-06-22 11:55:58,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:58,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:58,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:58,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:58,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:58,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:58,561 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:58,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:58,563 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:55:58,564 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:55:58,575 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:55:58,575 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:55:58,577 INFO ]: Start difference. First operand 47 states. Second operand 2 states. [2018-06-22 11:55:58,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:58,601 INFO ]: Finished difference Result 44 states and 67 transitions. [2018-06-22 11:55:58,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:55:58,604 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:55:58,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:58,628 INFO ]: With dead ends: 44 [2018-06-22 11:55:58,628 INFO ]: Without dead ends: 44 [2018-06-22 11:55:58,630 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:55:58,649 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:55:58,678 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:55:58,679 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:55:58,681 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2018-06-22 11:55:58,682 INFO ]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 5 [2018-06-22 11:55:58,682 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:58,682 INFO ]: Abstraction has 44 states and 67 transitions. [2018-06-22 11:55:58,682 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:55:58,682 INFO ]: Start isEmpty. Operand 44 states and 67 transitions. [2018-06-22 11:55:58,685 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:58,685 INFO ]: Found error trace [2018-06-22 11:55:58,685 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:58,685 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:58,686 INFO ]: Analyzing trace with hash 1130571507, now seen corresponding path program 1 times [2018-06-22 11:55:58,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:58,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:58,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:58,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:58,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:58,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:58,772 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:58,772 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:58,772 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:58,773 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:58,774 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:58,774 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:58,774 INFO ]: Start difference. First operand 44 states and 67 transitions. Second operand 4 states. [2018-06-22 11:55:58,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:58,944 INFO ]: Finished difference Result 48 states and 71 transitions. [2018-06-22 11:55:58,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:58,946 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:58,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:58,948 INFO ]: With dead ends: 48 [2018-06-22 11:55:58,948 INFO ]: Without dead ends: 48 [2018-06-22 11:55:58,949 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:58,949 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:55:58,965 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 11:55:58,966 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:55:58,970 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2018-06-22 11:55:58,970 INFO ]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 13 [2018-06-22 11:55:58,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:58,971 INFO ]: Abstraction has 46 states and 69 transitions. [2018-06-22 11:55:58,971 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:58,971 INFO ]: Start isEmpty. Operand 46 states and 69 transitions. [2018-06-22 11:55:58,973 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:58,977 INFO ]: Found error trace [2018-06-22 11:55:58,977 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:58,977 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:58,977 INFO ]: Analyzing trace with hash -2001887942, now seen corresponding path program 1 times [2018-06-22 11:55:58,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:58,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:58,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:58,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:58,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:58,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:59,180 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:59,180 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:59,180 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:59,180 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:59,180 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:59,180 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:59,181 INFO ]: Start difference. First operand 46 states and 69 transitions. Second operand 4 states. [2018-06-22 11:55:59,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:59,271 INFO ]: Finished difference Result 48 states and 72 transitions. [2018-06-22 11:55:59,271 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:59,271 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:59,271 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:59,273 INFO ]: With dead ends: 48 [2018-06-22 11:55:59,273 INFO ]: Without dead ends: 48 [2018-06-22 11:55:59,273 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:59,274 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:55:59,281 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 11:55:59,282 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:55:59,283 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2018-06-22 11:55:59,283 INFO ]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 13 [2018-06-22 11:55:59,284 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:59,284 INFO ]: Abstraction has 48 states and 72 transitions. [2018-06-22 11:55:59,284 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:59,284 INFO ]: Start isEmpty. Operand 48 states and 72 transitions. [2018-06-22 11:55:59,285 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:59,285 INFO ]: Found error trace [2018-06-22 11:55:59,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:59,286 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:59,286 INFO ]: Analyzing trace with hash 1420929981, now seen corresponding path program 1 times [2018-06-22 11:55:59,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:59,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:59,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:59,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:59,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:59,309 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:59,835 WARN ]: Spent 422.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 27 [2018-06-22 11:56:00,072 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:56:00,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:00,072 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:00,072 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:00,072 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:00,072 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:00,073 INFO ]: Start difference. First operand 48 states and 72 transitions. Second operand 6 states. [2018-06-22 11:56:00,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:00,290 INFO ]: Finished difference Result 56 states and 81 transitions. [2018-06-22 11:56:00,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:56:00,291 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:56:00,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:00,293 INFO ]: With dead ends: 56 [2018-06-22 11:56:00,293 INFO ]: Without dead ends: 56 [2018-06-22 11:56:00,293 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:00,293 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:56:00,301 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-06-22 11:56:00,301 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:56:00,303 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2018-06-22 11:56:00,303 INFO ]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 21 [2018-06-22 11:56:00,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:00,303 INFO ]: Abstraction has 48 states and 72 transitions. [2018-06-22 11:56:00,303 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:00,303 INFO ]: Start isEmpty. Operand 48 states and 72 transitions. [2018-06-22 11:56:00,305 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:00,305 INFO ]: Found error trace [2018-06-22 11:56:00,305 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:00,305 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:00,305 INFO ]: Analyzing trace with hash -1951621033, now seen corresponding path program 1 times [2018-06-22 11:56:00,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:00,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:00,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:00,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:00,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:00,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:00,365 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:00,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:00,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:00,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:00,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:00,417 INFO ]: Computing forward predicates... [2018-06-22 11:56:00,560 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:00,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:00,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:56:00,598 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:00,599 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:00,599 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:00,599 INFO ]: Start difference. First operand 48 states and 72 transitions. Second operand 7 states. [2018-06-22 11:56:00,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:00,942 INFO ]: Finished difference Result 58 states and 83 transitions. [2018-06-22 11:56:00,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:00,943 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:56:00,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:00,946 INFO ]: With dead ends: 58 [2018-06-22 11:56:00,946 INFO ]: Without dead ends: 36 [2018-06-22 11:56:00,946 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:56:00,947 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:56:00,952 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 11:56:00,952 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:56:00,953 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2018-06-22 11:56:00,953 INFO ]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 21 [2018-06-22 11:56:00,953 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:00,953 INFO ]: Abstraction has 34 states and 48 transitions. [2018-06-22 11:56:00,953 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:00,954 INFO ]: Start isEmpty. Operand 34 states and 48 transitions. [2018-06-22 11:56:00,955 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:56:00,955 INFO ]: Found error trace [2018-06-22 11:56:00,955 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:00,955 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:00,955 INFO ]: Analyzing trace with hash -63087738, now seen corresponding path program 1 times [2018-06-22 11:56:00,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:00,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:00,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:00,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:00,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:00,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:00,992 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:00,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:00,992 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:56:00,992 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:00,993 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:00,993 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:00,993 INFO ]: Start difference. First operand 34 states and 48 transitions. Second operand 4 states. [2018-06-22 11:56:01,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:01,142 INFO ]: Finished difference Result 34 states and 47 transitions. [2018-06-22 11:56:01,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:56:01,143 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:56:01,143 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:01,144 INFO ]: With dead ends: 34 [2018-06-22 11:56:01,144 INFO ]: Without dead ends: 33 [2018-06-22 11:56:01,145 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:01,145 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:56:01,153 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 11:56:01,153 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:56:01,155 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-06-22 11:56:01,156 INFO ]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 21 [2018-06-22 11:56:01,156 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:01,156 INFO ]: Abstraction has 33 states and 45 transitions. [2018-06-22 11:56:01,156 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:01,156 INFO ]: Start isEmpty. Operand 33 states and 45 transitions. [2018-06-22 11:56:01,157 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:01,157 INFO ]: Found error trace [2018-06-22 11:56:01,157 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:01,157 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:01,157 INFO ]: Analyzing trace with hash 1342565025, now seen corresponding path program 1 times [2018-06-22 11:56:01,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:01,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:01,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:01,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:01,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:01,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:01,521 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:01,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:01,521 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 11:56:01,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:01,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:01,547 INFO ]: Computing forward predicates... [2018-06-22 11:56:01,840 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:01,878 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:01,878 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:56:01,878 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:56:01,878 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:56:01,879 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:56:01,879 INFO ]: Start difference. First operand 33 states and 45 transitions. Second operand 14 states. [2018-06-22 11:56:02,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:02,269 INFO ]: Finished difference Result 37 states and 50 transitions. [2018-06-22 11:56:02,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:56:02,270 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-22 11:56:02,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:02,271 INFO ]: With dead ends: 37 [2018-06-22 11:56:02,271 INFO ]: Without dead ends: 37 [2018-06-22 11:56:02,271 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:56:02,271 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:56:02,275 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:56:02,275 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:56:02,276 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-06-22 11:56:02,276 INFO ]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 29 [2018-06-22 11:56:02,277 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:02,277 INFO ]: Abstraction has 35 states and 47 transitions. [2018-06-22 11:56:02,277 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:56:02,277 INFO ]: Start isEmpty. Operand 35 states and 47 transitions. [2018-06-22 11:56:02,278 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:56:02,278 INFO ]: Found error trace [2018-06-22 11:56:02,278 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:02,278 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:02,278 INFO ]: Analyzing trace with hash 370069637, now seen corresponding path program 2 times [2018-06-22 11:56:02,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:02,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:02,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:02,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:02,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:02,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:02,540 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2018-06-22 11:56:02,633 INFO ]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:56:02,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:02,633 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 11:56:02,639 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:56:02,665 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:56:02,665 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:02,668 INFO ]: Computing forward predicates... [2018-06-22 11:56:03,481 INFO ]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:03,511 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:03,511 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-06-22 11:56:03,511 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:56:03,511 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:56:03,511 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:56:03,511 INFO ]: Start difference. First operand 35 states and 47 transitions. Second operand 19 states. [2018-06-22 11:56:04,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:04,305 INFO ]: Finished difference Result 46 states and 65 transitions. [2018-06-22 11:56:04,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:56:04,306 INFO ]: Start accepts. Automaton has 19 states. Word has length 37 [2018-06-22 11:56:04,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:04,307 INFO ]: With dead ends: 46 [2018-06-22 11:56:04,307 INFO ]: Without dead ends: 46 [2018-06-22 11:56:04,307 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:56:04,307 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:56:04,312 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-06-22 11:56:04,312 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:56:04,313 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-06-22 11:56:04,313 INFO ]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 37 [2018-06-22 11:56:04,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:04,314 INFO ]: Abstraction has 37 states and 49 transitions. [2018-06-22 11:56:04,314 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:56:04,314 INFO ]: Start isEmpty. Operand 37 states and 49 transitions. [2018-06-22 11:56:04,315 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:56:04,315 INFO ]: Found error trace [2018-06-22 11:56:04,315 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:04,315 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:04,315 INFO ]: Analyzing trace with hash -1792513527, now seen corresponding path program 1 times [2018-06-22 11:56:04,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:04,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:04,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:04,316 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:04,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:04,323 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:04,377 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:56:04,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:04,377 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 11:56:04,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:04,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:04,410 INFO ]: Computing forward predicates... [2018-06-22 11:56:04,443 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:56:04,462 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:56:04,462 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2018-06-22 11:56:04,462 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:56:04,463 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:56:04,463 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:04,463 INFO ]: Start difference. First operand 37 states and 49 transitions. Second operand 7 states. [2018-06-22 11:56:04,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:04,533 INFO ]: Finished difference Result 41 states and 54 transitions. [2018-06-22 11:56:04,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:56:04,534 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-22 11:56:04,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:04,534 INFO ]: With dead ends: 41 [2018-06-22 11:56:04,534 INFO ]: Without dead ends: 41 [2018-06-22 11:56:04,535 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:04,535 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:56:04,539 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-22 11:56:04,539 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:56:04,540 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2018-06-22 11:56:04,540 INFO ]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 29 [2018-06-22 11:56:04,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:04,540 INFO ]: Abstraction has 39 states and 52 transitions. [2018-06-22 11:56:04,540 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:56:04,540 INFO ]: Start isEmpty. Operand 39 states and 52 transitions. [2018-06-22 11:56:04,541 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:56:04,541 INFO ]: Found error trace [2018-06-22 11:56:04,541 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:04,541 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:04,541 INFO ]: Analyzing trace with hash 510565737, now seen corresponding path program 3 times [2018-06-22 11:56:04,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:04,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:04,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:04,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:04,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:04,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:05,046 INFO ]: Checked inductivity of 42 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-22 11:56:05,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:05,046 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 11:56:05,053 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:56:05,110 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:56:05,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:05,114 INFO ]: Computing forward predicates... [2018-06-22 11:56:05,839 INFO ]: Checked inductivity of 42 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:56:05,857 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:05,857 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-22 11:56:05,858 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:56:05,858 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:56:05,858 INFO ]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:56:05,858 INFO ]: Start difference. First operand 39 states and 52 transitions. Second operand 23 states. [2018-06-22 11:56:06,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:06,780 INFO ]: Finished difference Result 53 states and 81 transitions. [2018-06-22 11:56:06,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:56:06,780 INFO ]: Start accepts. Automaton has 23 states. Word has length 45 [2018-06-22 11:56:06,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:06,781 INFO ]: With dead ends: 53 [2018-06-22 11:56:06,781 INFO ]: Without dead ends: 53 [2018-06-22 11:56:06,781 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:56:06,782 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:56:06,788 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-22 11:56:06,788 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:56:06,789 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-06-22 11:56:06,789 INFO ]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 45 [2018-06-22 11:56:06,789 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:06,789 INFO ]: Abstraction has 41 states and 54 transitions. [2018-06-22 11:56:06,789 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:56:06,789 INFO ]: Start isEmpty. Operand 41 states and 54 transitions. [2018-06-22 11:56:06,790 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:56:06,790 INFO ]: Found error trace [2018-06-22 11:56:06,790 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:06,790 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:06,791 INFO ]: Analyzing trace with hash 1362596173, now seen corresponding path program 4 times [2018-06-22 11:56:06,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:06,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:06,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:06,791 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:06,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:06,812 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:07,124 WARN ]: Spent 203.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2018-06-22 11:56:07,286 INFO ]: Checked inductivity of 72 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-22 11:56:07,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:07,286 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 11:56:07,299 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:56:07,325 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:56:07,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:07,329 INFO ]: Computing forward predicates... [2018-06-22 11:56:07,738 INFO ]: Checked inductivity of 72 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-22 11:56:07,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:07,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-22 11:56:07,771 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:56:07,771 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:56:07,771 INFO ]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:56:07,771 INFO ]: Start difference. First operand 41 states and 54 transitions. Second operand 23 states. [2018-06-22 11:56:08,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:08,313 INFO ]: Finished difference Result 45 states and 58 transitions. [2018-06-22 11:56:08,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:56:08,313 INFO ]: Start accepts. Automaton has 23 states. Word has length 53 [2018-06-22 11:56:08,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:08,314 INFO ]: With dead ends: 45 [2018-06-22 11:56:08,314 INFO ]: Without dead ends: 45 [2018-06-22 11:56:08,315 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:56:08,315 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 11:56:08,319 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-22 11:56:08,319 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:56:08,319 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2018-06-22 11:56:08,320 INFO ]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 53 [2018-06-22 11:56:08,320 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:08,320 INFO ]: Abstraction has 43 states and 56 transitions. [2018-06-22 11:56:08,320 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:56:08,320 INFO ]: Start isEmpty. Operand 43 states and 56 transitions. [2018-06-22 11:56:08,321 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:56:08,321 INFO ]: Found error trace [2018-06-22 11:56:08,321 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, 1, 1, 1] [2018-06-22 11:56:08,321 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:08,321 INFO ]: Analyzing trace with hash -1939702222, now seen corresponding path program 1 times [2018-06-22 11:56:08,321 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:08,321 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:08,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:08,322 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:08,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:08,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:08,384 INFO ]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:56:08,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:08,384 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 11:56:08,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:08,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:08,407 INFO ]: Computing forward predicates... [2018-06-22 11:56:08,487 INFO ]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:56:08,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:08,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-06-22 11:56:08,506 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:56:08,507 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:56:08,507 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:56:08,507 INFO ]: Start difference. First operand 43 states and 56 transitions. Second operand 10 states. [2018-06-22 11:56:08,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:08,633 INFO ]: Finished difference Result 51 states and 67 transitions. [2018-06-22 11:56:08,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:56:08,634 INFO ]: Start accepts. Automaton has 10 states. Word has length 41 [2018-06-22 11:56:08,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:08,634 INFO ]: With dead ends: 51 [2018-06-22 11:56:08,634 INFO ]: Without dead ends: 51 [2018-06-22 11:56:08,635 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:56:08,635 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:56:08,640 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-06-22 11:56:08,640 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:56:08,640 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2018-06-22 11:56:08,641 INFO ]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 41 [2018-06-22 11:56:08,641 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:08,641 INFO ]: Abstraction has 43 states and 56 transitions. [2018-06-22 11:56:08,641 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:56:08,641 INFO ]: Start isEmpty. Operand 43 states and 56 transitions. [2018-06-22 11:56:08,642 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:08,642 INFO ]: Found error trace [2018-06-22 11:56:08,642 INFO ]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:08,642 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:08,642 INFO ]: Analyzing trace with hash -1427379151, now seen corresponding path program 5 times [2018-06-22 11:56:08,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:08,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:08,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:08,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:08,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:08,667 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:08,944 WARN ]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2018-06-22 11:56:09,256 INFO ]: Checked inductivity of 110 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 11:56:09,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:09,257 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 11:56:09,262 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:56:09,290 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:56:09,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:09,295 INFO ]: Computing forward predicates... [2018-06-22 11:56:09,896 INFO ]: Checked inductivity of 110 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-06-22 11:56:09,915 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:09,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-06-22 11:56:09,915 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:56:09,915 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:56:09,915 INFO ]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:56:09,915 INFO ]: Start difference. First operand 43 states and 56 transitions. Second operand 29 states. [2018-06-22 11:56:11,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:11,297 INFO ]: Finished difference Result 70 states and 105 transitions. [2018-06-22 11:56:11,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:56:11,297 INFO ]: Start accepts. Automaton has 29 states. Word has length 61 [2018-06-22 11:56:11,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:11,298 INFO ]: With dead ends: 70 [2018-06-22 11:56:11,298 INFO ]: Without dead ends: 70 [2018-06-22 11:56:11,298 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 11:56:11,298 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:56:11,310 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 45. [2018-06-22 11:56:11,310 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:56:11,311 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2018-06-22 11:56:11,311 INFO ]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 61 [2018-06-22 11:56:11,312 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:11,312 INFO ]: Abstraction has 45 states and 58 transitions. [2018-06-22 11:56:11,312 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:56:11,312 INFO ]: Start isEmpty. Operand 45 states and 58 transitions. [2018-06-22 11:56:11,312 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:56:11,312 INFO ]: Found error trace [2018-06-22 11:56:11,312 INFO ]: trace histogram [4, 4, 3, 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, 1, 1, 1] [2018-06-22 11:56:11,313 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:11,313 INFO ]: Analyzing trace with hash -1454935605, now seen corresponding path program 1 times [2018-06-22 11:56:11,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:11,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:11,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:11,313 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:11,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:11,321 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:11,410 INFO ]: Checked inductivity of 35 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:56:11,410 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:56:11,410 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:56:11,410 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:56:11,410 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:56:11,410 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:56:11,410 INFO ]: Start difference. First operand 45 states and 58 transitions. Second operand 6 states. [2018-06-22 11:56:11,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:11,437 INFO ]: Finished difference Result 51 states and 64 transitions. [2018-06-22 11:56:11,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:56:11,437 INFO ]: Start accepts. Automaton has 6 states. Word has length 49 [2018-06-22 11:56:11,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:11,437 INFO ]: With dead ends: 51 [2018-06-22 11:56:11,438 INFO ]: Without dead ends: 41 [2018-06-22 11:56:11,438 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:56:11,438 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:56:11,440 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-22 11:56:11,440 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:56:11,440 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-06-22 11:56:11,441 INFO ]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 49 [2018-06-22 11:56:11,441 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:11,441 INFO ]: Abstraction has 39 states and 47 transitions. [2018-06-22 11:56:11,441 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:56:11,441 INFO ]: Start isEmpty. Operand 39 states and 47 transitions. [2018-06-22 11:56:11,441 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:56:11,441 INFO ]: Found error trace [2018-06-22 11:56:11,441 INFO ]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:11,441 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:11,441 INFO ]: Analyzing trace with hash -528617963, now seen corresponding path program 6 times [2018-06-22 11:56:11,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:11,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:11,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:11,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:11,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:11,468 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:11,897 INFO ]: Checked inductivity of 156 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 11:56:11,897 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:11,897 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:11,903 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:56:11,936 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:56:11,936 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:11,942 INFO ]: Computing forward predicates... [2018-06-22 11:56:13,248 INFO ]: Checked inductivity of 156 backedges. 26 proven. 48 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-22 11:56:13,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:13,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-22 11:56:13,280 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:56:13,281 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:56:13,281 INFO ]: CoverageRelationStatistics Valid=96, Invalid=895, Unknown=1, NotChecked=0, Total=992 [2018-06-22 11:56:13,281 INFO ]: Start difference. First operand 39 states and 47 transitions. Second operand 32 states. [2018-06-22 11:56:14,224 WARN ]: Spent 181.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 68 [2018-06-22 11:56:14,432 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 62 [2018-06-22 11:56:14,893 WARN ]: Spent 207.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2018-06-22 11:56:15,131 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 46 [2018-06-22 11:56:15,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:15,277 INFO ]: Finished difference Result 47 states and 68 transitions. [2018-06-22 11:56:15,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:56:15,278 INFO ]: Start accepts. Automaton has 32 states. Word has length 69 [2018-06-22 11:56:15,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:15,278 INFO ]: With dead ends: 47 [2018-06-22 11:56:15,279 INFO ]: Without dead ends: 47 [2018-06-22 11:56:15,279 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=257, Invalid=1634, Unknown=1, NotChecked=0, Total=1892 [2018-06-22 11:56:15,279 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:56:15,285 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-06-22 11:56:15,285 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:56:15,286 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-06-22 11:56:15,286 INFO ]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 69 [2018-06-22 11:56:15,286 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:15,286 INFO ]: Abstraction has 41 states and 49 transitions. [2018-06-22 11:56:15,286 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:56:15,286 INFO ]: Start isEmpty. Operand 41 states and 49 transitions. [2018-06-22 11:56:15,296 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:56:15,296 INFO ]: Found error trace [2018-06-22 11:56:15,296 INFO ]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:15,296 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:15,296 INFO ]: Analyzing trace with hash 55564025, now seen corresponding path program 7 times [2018-06-22 11:56:15,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:15,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:15,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:15,297 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:56:15,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:15,322 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:16,308 WARN ]: Spent 892.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 26 [2018-06-22 11:56:16,486 INFO ]: Checked inductivity of 210 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-22 11:56:16,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:16,486 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:16,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:16,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:16,528 INFO ]: Computing forward predicates... [2018-06-22 11:56:17,674 WARN ]: Spent 396.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-06-22 11:56:18,300 INFO ]: Checked inductivity of 210 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-22 11:56:18,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:18,320 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-22 11:56:18,321 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:56:18,321 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:56:18,321 INFO ]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:56:18,321 INFO ]: Start difference. First operand 41 states and 49 transitions. Second operand 28 states. [2018-06-22 11:56:18,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:18,992 INFO ]: Finished difference Result 43 states and 51 transitions. [2018-06-22 11:56:18,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:56:18,992 INFO ]: Start accepts. Automaton has 28 states. Word has length 77 [2018-06-22 11:56:18,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:18,992 INFO ]: With dead ends: 43 [2018-06-22 11:56:18,992 INFO ]: Without dead ends: 43 [2018-06-22 11:56:18,993 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:56:18,993 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:56:18,996 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-22 11:56:18,996 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:56:18,997 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-06-22 11:56:18,997 INFO ]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 77 [2018-06-22 11:56:18,997 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:18,997 INFO ]: Abstraction has 43 states and 51 transitions. [2018-06-22 11:56:18,997 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:56:18,997 INFO ]: Start isEmpty. Operand 43 states and 51 transitions. [2018-06-22 11:56:18,998 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:56:18,998 INFO ]: Found error trace [2018-06-22 11:56:18,998 INFO ]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:18,998 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:18,998 INFO ]: Analyzing trace with hash 624158429, now seen corresponding path program 8 times [2018-06-22 11:56:18,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:18,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:18,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:18,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:18,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:19,018 INFO ]: Conjunction of SSA is sat [2018-06-22 11:56:19,021 INFO ]: Counterexample might be feasible [2018-06-22 11:56:19,044 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:56:19 BoogieIcfgContainer [2018-06-22 11:56:19,044 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:56:19,045 INFO ]: Toolchain (without parser) took 21241.35 ms. Allocated memory was 309.3 MB in the beginning and 492.8 MB in the end (delta: 183.5 MB). Free memory was 263.7 MB in the beginning and 315.9 MB in the end (delta: -52.2 MB). Peak memory consumption was 131.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:19,046 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:56:19,046 INFO ]: ChcToBoogie took 51.63 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.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 11:56:19,047 INFO ]: Boogie Preprocessor took 47.12 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:19,047 INFO ]: RCFGBuilder took 469.58 ms. Allocated memory is still 309.3 MB. Free memory was 260.6 MB in the beginning and 248.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:19,047 INFO ]: TraceAbstraction took 20664.74 ms. Allocated memory was 309.3 MB in the beginning and 492.8 MB in the end (delta: 183.5 MB). Free memory was 247.6 MB in the beginning and 315.9 MB in the end (delta: -68.3 MB). Peak memory consumption was 115.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:19,054 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 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.63 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.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 47.12 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 469.58 ms. Allocated memory is still 309.3 MB. Free memory was 260.6 MB in the beginning and 248.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20664.74 ms. Allocated memory was 309.3 MB in the beginning and 492.8 MB in the end (delta: 183.5 MB). Free memory was 247.6 MB in the beginning and 315.9 MB in the end (delta: -68.3 MB). Peak memory consumption was 115.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume ((!(hbv_False_2_Int <= 1) && !(hbv_False_1_Int <= 0)) && !(hbv_False_1_Int + hbv_False_3_Int == (if hbv_False_2_Int == 10 then 10 else hbv_False_2_Int + hbv_False_4_Int))) && hbv_False_1_Int == hbv_False_2_Int; [L0] CALL call INV_REC_f^f(hbv_False_1_Int - 1, hbv_False_2_Int - 1, hbv_False_3_Int, hbv_False_4_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == hhv_INV_REC_f^f_1_Int) && hhv_INV_REC_f^f_1_Int <= 1; [L0] CALL call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call INV_REC_f^f_PRE(hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int); [L0] CALL call INV_REC_f__1(hhv_INV_REC_f^f_0_Int - 1, hbv_INV_REC_f^f_1_Int); [L0] assume hhv_INV_REC_f__1_0_Int <= 0 && hhv_INV_REC_f__1_1_Int == hhv_INV_REC_f__1_0_Int; [L0] CALL call INV_REC_f__1_PRE(hhv_INV_REC_f__1_0_Int); [L0] assume ((hbv_INV_REC_f__1_PRE_2_Int == hbv_INV_REC_f__1_PRE_1_Int && hhv_INV_REC_f__1_PRE_0_Int == hbv_INV_REC_f__1_PRE_2_Int - 1) && hbv_INV_REC_f__1_PRE_1_Int <= 1) && !(hbv_INV_REC_f__1_PRE_2_Int <= 0); [L0] RET call INV_REC_f__1_PRE(hhv_INV_REC_f__1_0_Int); [L0] RET call INV_REC_f__1(hhv_INV_REC_f^f_0_Int - 1, hbv_INV_REC_f^f_1_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int); [L0] RET call INV_REC_f^f(hbv_False_1_Int - 1, hbv_False_2_Int - 1, hbv_False_3_Int, hbv_False_4_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 47 locations, 1 error locations. UNSAFE Result, 20.6s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 755 SDtfs, 142 SDslu, 5089 SDs, 0 SdLazy, 2318 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 405 SyntacticMatches, 3 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, 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, 80 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1020 ConstructedInterpolants, 18 QuantifiedInterpolants, 555712 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1752 ConjunctsInSsa, 573 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 905/1333 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-56-19-076.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-56-19-076.csv Received shutdown request...