java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:03:36,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:03:36,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:03:36,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:03:36,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:03:36,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:03:36,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:03:36,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:03:36,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:03:36,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:03:36,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:03:36,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:03:36,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:03:36,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:03:36,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:03:36,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:03:36,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:03:36,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:03:36,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:03:36,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:03:36,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:03:36,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:03:36,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:03:36,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:03:36,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:03:36,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:03:36,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:03:36,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:03:36,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:03:36,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:03:36,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:03:36,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:03:36,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:03:36,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:03:36,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:03:36,417 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:03:36,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:03:36,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:03:36,430 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:03:36,431 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:03:36,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:03:36,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:03:36,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:03:36,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:03:36,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:03:36,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:03:36,433 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:03:36,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:03:36,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:03:36,434 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:03:36,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:03:36,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:03:36,434 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:03:36,436 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:03:36,436 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:03:36,474 INFO ]: Repository-Root is: /tmp [2018-06-22 01:03:36,489 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:03:36,492 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:03:36,493 INFO ]: Initializing SmtParser... [2018-06-22 01:03:36,494 INFO ]: SmtParser initialized [2018-06-22 01:03:36,494 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 [2018-06-22 01:03:36,495 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:03:36,578 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 unknown [2018-06-22 01:03:36,979 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/32.c.smt2 [2018-06-22 01:03:36,983 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:03:36,988 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:03:36,989 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:03:36,989 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:03:36,989 INFO ]: ChcToBoogie initialized [2018-06-22 01:03:36,992 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:03:36" (1/1) ... [2018-06-22 01:03:37,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37 Unit [2018-06-22 01:03:37,072 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:03:37,073 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:03:37,073 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:03:37,073 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:03:37,091 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,091 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,100 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,100 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,105 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,107 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,109 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... [2018-06-22 01:03:37,111 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:03:37,112 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:03:37,112 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:03:37,112 INFO ]: RCFGBuilder initialized [2018-06-22 01:03:37,112 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:03:37,122 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:03:37,122 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:03:37,122 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:03:37,122 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:03:37,122 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:03:37,122 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:03:37,743 INFO ]: Using library mode [2018-06-22 01:03:37,743 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:03:37 BoogieIcfgContainer [2018-06-22 01:03:37,743 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:03:37,745 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:03:37,745 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:03:37,748 INFO ]: TraceAbstraction initialized [2018-06-22 01:03:37,748 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:03:36" (1/3) ... [2018-06-22 01:03:37,749 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480c2ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:03:37, skipping insertion in model container [2018-06-22 01:03:37,749 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:03:37" (2/3) ... [2018-06-22 01:03:37,749 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480c2ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:03:37, skipping insertion in model container [2018-06-22 01:03:37,749 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:03:37" (3/3) ... [2018-06-22 01:03:37,751 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:03:37,760 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:03:37,768 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:03:37,808 INFO ]: Using default assertion order modulation [2018-06-22 01:03:37,808 INFO ]: Interprodecural is true [2018-06-22 01:03:37,808 INFO ]: Hoare is false [2018-06-22 01:03:37,808 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:03:37,808 INFO ]: Backedges is TWOTRACK [2018-06-22 01:03:37,808 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:03:37,809 INFO ]: Difference is false [2018-06-22 01:03:37,809 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:03:37,809 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:03:37,824 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 01:03:37,836 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 01:03:37,836 INFO ]: Found error trace [2018-06-22 01:03:37,836 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:37,837 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:37,841 INFO ]: Analyzing trace with hash -874827260, now seen corresponding path program 1 times [2018-06-22 01:03:37,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:37,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:37,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:37,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:37,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:37,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:38,304 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:38,306 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:38,307 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:03:38,308 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:03:38,320 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:03:38,321 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:03:38,323 INFO ]: Start difference. First operand 29 states. Second operand 11 states. [2018-06-22 01:03:39,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:39,113 INFO ]: Finished difference Result 41 states and 54 transitions. [2018-06-22 01:03:39,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:03:39,114 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 01:03:39,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:39,122 INFO ]: With dead ends: 41 [2018-06-22 01:03:39,122 INFO ]: Without dead ends: 38 [2018-06-22 01:03:39,124 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-06-22 01:03:39,140 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:03:39,165 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-06-22 01:03:39,166 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 01:03:39,168 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-06-22 01:03:39,170 INFO ]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2018-06-22 01:03:39,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:39,170 INFO ]: Abstraction has 29 states and 36 transitions. [2018-06-22 01:03:39,170 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:03:39,170 INFO ]: Start isEmpty. Operand 29 states and 36 transitions. [2018-06-22 01:03:39,171 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:03:39,171 INFO ]: Found error trace [2018-06-22 01:03:39,171 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:39,171 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:39,171 INFO ]: Analyzing trace with hash 1951444212, now seen corresponding path program 1 times [2018-06-22 01:03:39,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:39,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:39,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:39,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:39,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:39,243 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:39,851 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:39,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:39,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:03:39,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:39,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:39,950 INFO ]: Computing forward predicates... [2018-06-22 01:03:40,636 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:40,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:40,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:03:40,667 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:03:40,668 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:03:40,669 INFO ]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:03:40,669 INFO ]: Start difference. First operand 29 states and 36 transitions. Second operand 26 states. [2018-06-22 01:03:43,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:43,406 INFO ]: Finished difference Result 192 states and 259 transitions. [2018-06-22 01:03:43,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 01:03:43,406 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-22 01:03:43,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:43,415 INFO ]: With dead ends: 192 [2018-06-22 01:03:43,415 INFO ]: Without dead ends: 186 [2018-06-22 01:03:43,419 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1081, Invalid=4031, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 01:03:43,419 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 01:03:43,438 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 43. [2018-06-22 01:03:43,438 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:03:43,442 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2018-06-22 01:03:43,442 INFO ]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 24 [2018-06-22 01:03:43,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:43,443 INFO ]: Abstraction has 43 states and 62 transitions. [2018-06-22 01:03:43,443 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:03:43,443 INFO ]: Start isEmpty. Operand 43 states and 62 transitions. [2018-06-22 01:03:43,444 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:03:43,444 INFO ]: Found error trace [2018-06-22 01:03:43,444 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:43,444 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:43,445 INFO ]: Analyzing trace with hash 2139134512, now seen corresponding path program 1 times [2018-06-22 01:03:43,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:43,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:43,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:43,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:43,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:43,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:43,581 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:43,581 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:43,581 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:03:43,581 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:03:43,581 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:03:43,581 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:03:43,581 INFO ]: Start difference. First operand 43 states and 62 transitions. Second operand 4 states. [2018-06-22 01:03:43,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:43,613 INFO ]: Finished difference Result 72 states and 104 transitions. [2018-06-22 01:03:43,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:03:43,614 INFO ]: Start accepts. Automaton has 4 states. Word has length 24 [2018-06-22 01:03:43,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:43,615 INFO ]: With dead ends: 72 [2018-06-22 01:03:43,615 INFO ]: Without dead ends: 71 [2018-06-22 01:03:43,615 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:03:43,615 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 01:03:43,620 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-06-22 01:03:43,620 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 01:03:43,621 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2018-06-22 01:03:43,621 INFO ]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 24 [2018-06-22 01:03:43,621 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:43,621 INFO ]: Abstraction has 46 states and 65 transitions. [2018-06-22 01:03:43,621 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:03:43,621 INFO ]: Start isEmpty. Operand 46 states and 65 transitions. [2018-06-22 01:03:43,622 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:03:43,622 INFO ]: Found error trace [2018-06-22 01:03:43,622 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:43,622 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:43,622 INFO ]: Analyzing trace with hash 116900012, now seen corresponding path program 1 times [2018-06-22 01:03:43,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:43,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:43,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:43,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:43,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:43,649 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:43,843 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:43,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:43,843 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:03:43,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:43,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:43,919 INFO ]: Computing forward predicates... [2018-06-22 01:03:44,871 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:44,891 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:44,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:03:44,891 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:03:44,891 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:03:44,892 INFO ]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:03:44,892 INFO ]: Start difference. First operand 46 states and 65 transitions. Second operand 26 states. [2018-06-22 01:03:47,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:47,346 INFO ]: Finished difference Result 200 states and 272 transitions. [2018-06-22 01:03:47,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-22 01:03:47,346 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-22 01:03:47,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:47,348 INFO ]: With dead ends: 200 [2018-06-22 01:03:47,348 INFO ]: Without dead ends: 194 [2018-06-22 01:03:47,350 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1081, Invalid=4031, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 01:03:47,350 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-22 01:03:47,360 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 54. [2018-06-22 01:03:47,361 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:03:47,362 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2018-06-22 01:03:47,362 INFO ]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 24 [2018-06-22 01:03:47,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:47,362 INFO ]: Abstraction has 54 states and 79 transitions. [2018-06-22 01:03:47,362 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:03:47,362 INFO ]: Start isEmpty. Operand 54 states and 79 transitions. [2018-06-22 01:03:47,363 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:03:47,363 INFO ]: Found error trace [2018-06-22 01:03:47,363 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:47,363 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:47,363 INFO ]: Analyzing trace with hash -28066386, now seen corresponding path program 1 times [2018-06-22 01:03:47,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:47,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:47,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:47,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:47,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:47,376 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:47,430 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:47,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:47,430 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:03:47,430 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:03:47,431 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:03:47,431 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:03:47,431 INFO ]: Start difference. First operand 54 states and 79 transitions. Second operand 4 states. [2018-06-22 01:03:47,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:47,453 INFO ]: Finished difference Result 56 states and 80 transitions. [2018-06-22 01:03:47,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:03:47,453 INFO ]: Start accepts. Automaton has 4 states. Word has length 24 [2018-06-22 01:03:47,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:47,453 INFO ]: With dead ends: 56 [2018-06-22 01:03:47,453 INFO ]: Without dead ends: 54 [2018-06-22 01:03:47,454 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:03:47,454 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:03:47,458 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 01:03:47,458 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:03:47,459 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2018-06-22 01:03:47,459 INFO ]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 24 [2018-06-22 01:03:47,459 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:47,459 INFO ]: Abstraction has 54 states and 71 transitions. [2018-06-22 01:03:47,459 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:03:47,459 INFO ]: Start isEmpty. Operand 54 states and 71 transitions. [2018-06-22 01:03:47,460 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:03:47,460 INFO ]: Found error trace [2018-06-22 01:03:47,460 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:03:47,460 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:47,460 INFO ]: Analyzing trace with hash 1233549160, now seen corresponding path program 1 times [2018-06-22 01:03:47,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:47,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:47,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:47,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:47,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:47,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:47,711 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:47,711 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:47,711 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:03:47,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:47,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:47,767 INFO ]: Computing forward predicates... [2018-06-22 01:03:48,092 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:48,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:48,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-22 01:03:48,111 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:03:48,111 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:03:48,112 INFO ]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:03:48,112 INFO ]: Start difference. First operand 54 states and 71 transitions. Second operand 26 states. [2018-06-22 01:03:49,786 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:49,786 INFO ]: Finished difference Result 132 states and 168 transitions. [2018-06-22 01:03:49,786 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-22 01:03:49,786 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-22 01:03:49,786 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:49,786 INFO ]: With dead ends: 132 [2018-06-22 01:03:49,787 INFO ]: Without dead ends: 126 [2018-06-22 01:03:49,788 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=824, Invalid=2958, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 01:03:49,788 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 01:03:49,794 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 63. [2018-06-22 01:03:49,794 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:03:49,795 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-06-22 01:03:49,795 INFO ]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2018-06-22 01:03:49,795 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:49,795 INFO ]: Abstraction has 63 states and 83 transitions. [2018-06-22 01:03:49,795 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:03:49,795 INFO ]: Start isEmpty. Operand 63 states and 83 transitions. [2018-06-22 01:03:49,796 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:03:49,796 INFO ]: Found error trace [2018-06-22 01:03:49,796 INFO ]: trace histogram [3, 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] [2018-06-22 01:03:49,796 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:49,796 INFO ]: Analyzing trace with hash -1822484548, now seen corresponding path program 1 times [2018-06-22 01:03:49,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:49,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:49,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:49,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:49,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:49,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:49,869 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:49,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:49,870 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:03:49,870 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:03:49,870 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:03:49,870 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:03:49,870 INFO ]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2018-06-22 01:03:50,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:50,013 INFO ]: Finished difference Result 112 states and 134 transitions. [2018-06-22 01:03:50,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:03:50,014 INFO ]: Start accepts. Automaton has 7 states. Word has length 31 [2018-06-22 01:03:50,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:50,014 INFO ]: With dead ends: 112 [2018-06-22 01:03:50,014 INFO ]: Without dead ends: 112 [2018-06-22 01:03:50,015 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:03:50,015 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 01:03:50,024 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 71. [2018-06-22 01:03:50,024 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-22 01:03:50,031 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-06-22 01:03:50,031 INFO ]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 31 [2018-06-22 01:03:50,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:50,032 INFO ]: Abstraction has 71 states and 89 transitions. [2018-06-22 01:03:50,032 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:03:50,032 INFO ]: Start isEmpty. Operand 71 states and 89 transitions. [2018-06-22 01:03:50,032 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:03:50,033 INFO ]: Found error trace [2018-06-22 01:03:50,033 INFO ]: trace histogram [3, 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] [2018-06-22 01:03:50,033 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:50,033 INFO ]: Analyzing trace with hash -1571986252, now seen corresponding path program 1 times [2018-06-22 01:03:50,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:50,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:50,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:50,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:50,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:50,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:50,221 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:03:50,221 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:50,221 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:03:50,221 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:03:50,221 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:03:50,221 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:03:50,221 INFO ]: Start difference. First operand 71 states and 89 transitions. Second operand 4 states. [2018-06-22 01:03:50,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:50,464 INFO ]: Finished difference Result 100 states and 124 transitions. [2018-06-22 01:03:50,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:03:50,465 INFO ]: Start accepts. Automaton has 4 states. Word has length 31 [2018-06-22 01:03:50,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:50,465 INFO ]: With dead ends: 100 [2018-06-22 01:03:50,465 INFO ]: Without dead ends: 97 [2018-06-22 01:03:50,466 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:03:50,466 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 01:03:50,473 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 64. [2018-06-22 01:03:50,473 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:03:50,474 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-06-22 01:03:50,474 INFO ]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 31 [2018-06-22 01:03:50,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:50,474 INFO ]: Abstraction has 64 states and 79 transitions. [2018-06-22 01:03:50,474 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:03:50,474 INFO ]: Start isEmpty. Operand 64 states and 79 transitions. [2018-06-22 01:03:50,475 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:03:50,475 INFO ]: Found error trace [2018-06-22 01:03:50,477 INFO ]: trace histogram [3, 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] [2018-06-22 01:03:50,477 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:50,477 INFO ]: Analyzing trace with hash -705835400, now seen corresponding path program 1 times [2018-06-22 01:03:50,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:50,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:50,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:50,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:50,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:50,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:51,006 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:51,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:51,006 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:03:51,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:03:51,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:51,088 INFO ]: Computing forward predicates... [2018-06-22 01:03:51,838 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:51,857 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:03:51,858 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-22 01:03:51,858 INFO ]: Interpolant automaton has 40 states [2018-06-22 01:03:51,858 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 01:03:51,858 INFO ]: CoverageRelationStatistics Valid=123, Invalid=1437, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:03:51,858 INFO ]: Start difference. First operand 64 states and 79 transitions. Second operand 40 states. [2018-06-22 01:03:54,292 WARN ]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-22 01:03:55,276 WARN ]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-22 01:03:56,453 WARN ]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-22 01:03:57,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:57,433 INFO ]: Finished difference Result 228 states and 281 transitions. [2018-06-22 01:03:57,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-06-22 01:03:57,434 INFO ]: Start accepts. Automaton has 40 states. Word has length 31 [2018-06-22 01:03:57,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:57,435 INFO ]: With dead ends: 228 [2018-06-22 01:03:57,435 INFO ]: Without dead ends: 222 [2018-06-22 01:03:57,438 INFO ]: 0 DeclaredPredicates, 134 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4953 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2575, Invalid=12187, Unknown=0, NotChecked=0, Total=14762 [2018-06-22 01:03:57,438 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-22 01:03:57,444 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 64. [2018-06-22 01:03:57,444 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:03:57,446 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-06-22 01:03:57,446 INFO ]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 31 [2018-06-22 01:03:57,446 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:57,446 INFO ]: Abstraction has 64 states and 79 transitions. [2018-06-22 01:03:57,446 INFO ]: Interpolant automaton has 40 states. [2018-06-22 01:03:57,446 INFO ]: Start isEmpty. Operand 64 states and 79 transitions. [2018-06-22 01:03:57,447 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:03:57,447 INFO ]: Found error trace [2018-06-22 01:03:57,447 INFO ]: trace histogram [3, 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] [2018-06-22 01:03:57,447 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:57,448 INFO ]: Analyzing trace with hash 1791182016, now seen corresponding path program 1 times [2018-06-22 01:03:57,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:57,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:57,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:57,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:57,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:57,463 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:57,544 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:03:57,544 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:03:57,544 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:03:57,545 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:03:57,545 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:03:57,545 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:03:57,545 INFO ]: Start difference. First operand 64 states and 79 transitions. Second operand 4 states. [2018-06-22 01:03:57,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:57,554 INFO ]: Finished difference Result 68 states and 80 transitions. [2018-06-22 01:03:57,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:03:57,555 INFO ]: Start accepts. Automaton has 4 states. Word has length 31 [2018-06-22 01:03:57,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:57,555 INFO ]: With dead ends: 68 [2018-06-22 01:03:57,555 INFO ]: Without dead ends: 62 [2018-06-22 01:03:57,555 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:03:57,555 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:03:57,558 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 01:03:57,558 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:03:57,558 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-06-22 01:03:57,558 INFO ]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 31 [2018-06-22 01:03:57,559 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:57,559 INFO ]: Abstraction has 62 states and 72 transitions. [2018-06-22 01:03:57,559 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:03:57,559 INFO ]: Start isEmpty. Operand 62 states and 72 transitions. [2018-06-22 01:03:57,560 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:03:57,560 INFO ]: Found error trace [2018-06-22 01:03:57,560 INFO ]: trace histogram [3, 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] [2018-06-22 01:03:57,560 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:57,560 INFO ]: Analyzing trace with hash -1449944128, now seen corresponding path program 1 times [2018-06-22 01:03:57,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:57,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:57,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:57,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:57,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:57,579 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:57,852 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:57,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:57,852 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 01:03:57,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:57,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:57,940 INFO ]: Computing forward predicates... [2018-06-22 01:03:58,020 INFO ]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:58,040 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:03:58,040 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 26 [2018-06-22 01:03:58,041 INFO ]: Interpolant automaton has 26 states [2018-06-22 01:03:58,041 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 01:03:58,041 INFO ]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:03:58,041 INFO ]: Start difference. First operand 62 states and 72 transitions. Second operand 26 states. [2018-06-22 01:03:59,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:03:59,378 INFO ]: Finished difference Result 127 states and 143 transitions. [2018-06-22 01:03:59,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:03:59,380 INFO ]: Start accepts. Automaton has 26 states. Word has length 31 [2018-06-22 01:03:59,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:03:59,380 INFO ]: With dead ends: 127 [2018-06-22 01:03:59,380 INFO ]: Without dead ends: 119 [2018-06-22 01:03:59,381 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=547, Invalid=3113, Unknown=0, NotChecked=0, Total=3660 [2018-06-22 01:03:59,381 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 01:03:59,387 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 60. [2018-06-22 01:03:59,387 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:03:59,387 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-06-22 01:03:59,387 INFO ]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 31 [2018-06-22 01:03:59,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:03:59,387 INFO ]: Abstraction has 60 states and 69 transitions. [2018-06-22 01:03:59,387 INFO ]: Interpolant automaton has 26 states. [2018-06-22 01:03:59,388 INFO ]: Start isEmpty. Operand 60 states and 69 transitions. [2018-06-22 01:03:59,388 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:03:59,388 INFO ]: Found error trace [2018-06-22 01:03:59,388 INFO ]: trace histogram [3, 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] [2018-06-22 01:03:59,388 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:03:59,389 INFO ]: Analyzing trace with hash -1789702384, now seen corresponding path program 2 times [2018-06-22 01:03:59,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:03:59,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:03:59,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:59,389 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:03:59,389 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:03:59,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:59,646 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:03:59,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:03:59,646 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 01:03:59,654 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:03:59,711 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:03:59,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:03:59,716 INFO ]: Computing forward predicates... [2018-06-22 01:04:00,213 INFO ]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:04:00,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:04:00,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2018-06-22 01:04:00,234 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:04:00,234 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:04:00,234 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1627, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:04:00,235 INFO ]: Start difference. First operand 60 states and 69 transitions. Second operand 42 states. [2018-06-22 01:04:08,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:04:08,149 INFO ]: Finished difference Result 351 states and 397 transitions. [2018-06-22 01:04:08,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-06-22 01:04:08,149 INFO ]: Start accepts. Automaton has 42 states. Word has length 31 [2018-06-22 01:04:08,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:04:08,153 INFO ]: With dead ends: 351 [2018-06-22 01:04:08,153 INFO ]: Without dead ends: 342 [2018-06-22 01:04:08,159 INFO ]: 0 DeclaredPredicates, 179 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8333 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=4116, Invalid=23940, Unknown=0, NotChecked=0, Total=28056 [2018-06-22 01:04:08,160 INFO ]: Start minimizeSevpa. Operand 342 states. [2018-06-22 01:04:08,168 INFO ]: Finished minimizeSevpa. Reduced states from 342 to 110. [2018-06-22 01:04:08,168 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-22 01:04:08,169 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2018-06-22 01:04:08,169 INFO ]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 31 [2018-06-22 01:04:08,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:04:08,170 INFO ]: Abstraction has 110 states and 130 transitions. [2018-06-22 01:04:08,170 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:04:08,170 INFO ]: Start isEmpty. Operand 110 states and 130 transitions. [2018-06-22 01:04:08,171 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 01:04:08,171 INFO ]: Found error trace [2018-06-22 01:04:08,171 INFO ]: trace histogram [3, 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] [2018-06-22 01:04:08,171 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:04:08,171 INFO ]: Analyzing trace with hash 670720712, now seen corresponding path program 2 times [2018-06-22 01:04:08,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:04:08,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:04:08,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:08,172 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:04:08,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:08,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:08,453 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:08,453 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:04:08,453 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 01:04:08,459 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:04:08,517 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:04:08,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:08,520 INFO ]: Computing forward predicates... [2018-06-22 01:04:08,973 INFO ]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:04:08,994 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:04:08,994 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2018-06-22 01:04:08,994 INFO ]: Interpolant automaton has 42 states [2018-06-22 01:04:08,994 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 01:04:08,994 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1627, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 01:04:08,994 INFO ]: Start difference. First operand 110 states and 130 transitions. Second operand 42 states. [2018-06-22 01:04:13,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:04:13,868 INFO ]: Finished difference Result 220 states and 255 transitions. [2018-06-22 01:04:13,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-06-22 01:04:13,870 INFO ]: Start accepts. Automaton has 42 states. Word has length 31 [2018-06-22 01:04:13,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:04:13,871 INFO ]: With dead ends: 220 [2018-06-22 01:04:13,871 INFO ]: Without dead ends: 204 [2018-06-22 01:04:13,874 INFO ]: 0 DeclaredPredicates, 123 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2705 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1861, Invalid=10571, Unknown=0, NotChecked=0, Total=12432 [2018-06-22 01:04:13,874 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-22 01:04:13,879 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 116. [2018-06-22 01:04:13,879 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-22 01:04:13,879 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2018-06-22 01:04:13,880 INFO ]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 31 [2018-06-22 01:04:13,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:04:13,880 INFO ]: Abstraction has 116 states and 137 transitions. [2018-06-22 01:04:13,880 INFO ]: Interpolant automaton has 42 states. [2018-06-22 01:04:13,880 INFO ]: Start isEmpty. Operand 116 states and 137 transitions. [2018-06-22 01:04:13,881 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:04:13,881 INFO ]: Found error trace [2018-06-22 01:04:13,881 INFO ]: trace histogram [4, 3, 3, 3, 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 01:04:13,881 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:04:13,881 INFO ]: Analyzing trace with hash 772143544, now seen corresponding path program 1 times [2018-06-22 01:04:13,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:04:13,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:04:13,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:13,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:04:13,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:13,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:14,673 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:14,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:04:14,673 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 01:04:14,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:04:14,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:14,756 INFO ]: Computing forward predicates... [2018-06-22 01:04:15,651 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:15,671 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:04:15,671 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-06-22 01:04:15,672 INFO ]: Interpolant automaton has 54 states [2018-06-22 01:04:15,672 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 01:04:15,673 INFO ]: CoverageRelationStatistics Valid=197, Invalid=2665, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:04:15,673 INFO ]: Start difference. First operand 116 states and 137 transitions. Second operand 54 states. [2018-06-22 01:04:18,995 WARN ]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-06-22 01:04:20,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:04:20,338 INFO ]: Finished difference Result 200 states and 233 transitions. [2018-06-22 01:04:20,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-22 01:04:20,339 INFO ]: Start accepts. Automaton has 54 states. Word has length 38 [2018-06-22 01:04:20,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:04:20,340 INFO ]: With dead ends: 200 [2018-06-22 01:04:20,340 INFO ]: Without dead ends: 192 [2018-06-22 01:04:20,341 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1920, Invalid=9000, Unknown=0, NotChecked=0, Total=10920 [2018-06-22 01:04:20,341 INFO ]: Start minimizeSevpa. Operand 192 states. [2018-06-22 01:04:20,346 INFO ]: Finished minimizeSevpa. Reduced states from 192 to 109. [2018-06-22 01:04:20,346 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 01:04:20,347 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2018-06-22 01:04:20,347 INFO ]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 38 [2018-06-22 01:04:20,347 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:04:20,347 INFO ]: Abstraction has 109 states and 128 transitions. [2018-06-22 01:04:20,347 INFO ]: Interpolant automaton has 54 states. [2018-06-22 01:04:20,347 INFO ]: Start isEmpty. Operand 109 states and 128 transitions. [2018-06-22 01:04:20,349 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:04:20,349 INFO ]: Found error trace [2018-06-22 01:04:20,351 INFO ]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:04:20,351 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:04:20,351 INFO ]: Analyzing trace with hash -911092516, now seen corresponding path program 3 times [2018-06-22 01:04:20,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:04:20,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:04:20,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:20,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:04:20,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:20,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:21,345 INFO ]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:21,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:04:21,345 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 01:04:21,354 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:04:21,442 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:04:21,442 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:21,448 INFO ]: Computing forward predicates... [2018-06-22 01:04:25,713 INFO ]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:25,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:04:25,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-06-22 01:04:25,743 INFO ]: Interpolant automaton has 54 states [2018-06-22 01:04:25,744 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 01:04:25,744 INFO ]: CoverageRelationStatistics Valid=200, Invalid=2662, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:04:25,744 INFO ]: Start difference. First operand 109 states and 128 transitions. Second operand 54 states. [2018-06-22 01:04:32,378 WARN ]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-06-22 01:04:34,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:04:34,049 INFO ]: Finished difference Result 279 states and 322 transitions. [2018-06-22 01:04:34,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-06-22 01:04:34,050 INFO ]: Start accepts. Automaton has 54 states. Word has length 38 [2018-06-22 01:04:34,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:04:34,051 INFO ]: With dead ends: 279 [2018-06-22 01:04:34,051 INFO ]: Without dead ends: 270 [2018-06-22 01:04:34,053 INFO ]: 0 DeclaredPredicates, 156 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6890 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3709, Invalid=16883, Unknown=0, NotChecked=0, Total=20592 [2018-06-22 01:04:34,053 INFO ]: Start minimizeSevpa. Operand 270 states. [2018-06-22 01:04:34,059 INFO ]: Finished minimizeSevpa. Reduced states from 270 to 138. [2018-06-22 01:04:34,059 INFO ]: Start removeUnreachable. Operand 138 states. [2018-06-22 01:04:34,060 INFO ]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2018-06-22 01:04:34,060 INFO ]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 38 [2018-06-22 01:04:34,060 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:04:34,060 INFO ]: Abstraction has 138 states and 163 transitions. [2018-06-22 01:04:34,060 INFO ]: Interpolant automaton has 54 states. [2018-06-22 01:04:34,060 INFO ]: Start isEmpty. Operand 138 states and 163 transitions. [2018-06-22 01:04:34,061 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:04:34,061 INFO ]: Found error trace [2018-06-22 01:04:34,061 INFO ]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:04:34,061 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:04:34,061 INFO ]: Analyzing trace with hash -1994959500, now seen corresponding path program 4 times [2018-06-22 01:04:34,061 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:04:34,061 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:04:34,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:34,062 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:04:34,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:34,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:34,669 INFO ]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:34,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:04:34,669 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 01:04:34,677 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:04:34,765 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:04:34,765 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:34,769 INFO ]: Computing forward predicates... [2018-06-22 01:04:34,878 INFO ]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:04:34,902 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:04:34,902 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 33 [2018-06-22 01:04:34,902 INFO ]: Interpolant automaton has 33 states [2018-06-22 01:04:34,902 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 01:04:34,902 INFO ]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:04:34,902 INFO ]: Start difference. First operand 138 states and 163 transitions. Second operand 33 states. [2018-06-22 01:04:36,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:04:36,534 INFO ]: Finished difference Result 159 states and 178 transitions. [2018-06-22 01:04:36,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-22 01:04:36,534 INFO ]: Start accepts. Automaton has 33 states. Word has length 38 [2018-06-22 01:04:36,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:04:36,535 INFO ]: With dead ends: 159 [2018-06-22 01:04:36,535 INFO ]: Without dead ends: 159 [2018-06-22 01:04:36,535 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=4089, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:04:36,536 INFO ]: Start minimizeSevpa. Operand 159 states. [2018-06-22 01:04:36,539 INFO ]: Finished minimizeSevpa. Reduced states from 159 to 130. [2018-06-22 01:04:36,539 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 01:04:36,540 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2018-06-22 01:04:36,540 INFO ]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 38 [2018-06-22 01:04:36,540 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:04:36,540 INFO ]: Abstraction has 130 states and 145 transitions. [2018-06-22 01:04:36,540 INFO ]: Interpolant automaton has 33 states. [2018-06-22 01:04:36,540 INFO ]: Start isEmpty. Operand 130 states and 145 transitions. [2018-06-22 01:04:36,541 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:04:36,541 INFO ]: Found error trace [2018-06-22 01:04:36,541 INFO ]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:04:36,541 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:04:36,541 INFO ]: Analyzing trace with hash -1595537729, now seen corresponding path program 1 times [2018-06-22 01:04:36,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:04:36,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:04:36,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:36,541 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:04:36,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:36,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:37,121 INFO ]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:37,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:04:37,148 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:04:37,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:04:37,236 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:37,241 INFO ]: Computing forward predicates... [2018-06-22 01:04:38,770 INFO ]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:38,790 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:04:38,790 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-06-22 01:04:38,791 INFO ]: Interpolant automaton has 54 states [2018-06-22 01:04:38,791 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 01:04:38,791 INFO ]: CoverageRelationStatistics Valid=200, Invalid=2662, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:04:38,791 INFO ]: Start difference. First operand 130 states and 145 transitions. Second operand 54 states. [2018-06-22 01:04:41,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:04:41,283 INFO ]: Finished difference Result 182 states and 203 transitions. [2018-06-22 01:04:41,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-22 01:04:41,283 INFO ]: Start accepts. Automaton has 54 states. Word has length 38 [2018-06-22 01:04:41,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:04:41,284 INFO ]: With dead ends: 182 [2018-06-22 01:04:41,284 INFO ]: Without dead ends: 179 [2018-06-22 01:04:41,285 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1636, Invalid=7294, Unknown=0, NotChecked=0, Total=8930 [2018-06-22 01:04:41,285 INFO ]: Start minimizeSevpa. Operand 179 states. [2018-06-22 01:04:41,289 INFO ]: Finished minimizeSevpa. Reduced states from 179 to 136. [2018-06-22 01:04:41,289 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-22 01:04:41,290 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2018-06-22 01:04:41,290 INFO ]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 38 [2018-06-22 01:04:41,290 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:04:41,290 INFO ]: Abstraction has 136 states and 151 transitions. [2018-06-22 01:04:41,290 INFO ]: Interpolant automaton has 54 states. [2018-06-22 01:04:41,290 INFO ]: Start isEmpty. Operand 136 states and 151 transitions. [2018-06-22 01:04:41,291 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 01:04:41,291 INFO ]: Found error trace [2018-06-22 01:04:41,291 INFO ]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:04:41,291 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:04:41,291 INFO ]: Analyzing trace with hash 1152094188, now seen corresponding path program 5 times [2018-06-22 01:04:41,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:04:41,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:04:41,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:41,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:04:41,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:04:41,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:41,934 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:41,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:04:41,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:04:41,947 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:04:42,037 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-22 01:04:42,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:04:42,043 INFO ]: Computing forward predicates... [2018-06-22 01:04:43,335 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:04:43,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:04:43,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-06-22 01:04:43,356 INFO ]: Interpolant automaton has 68 states [2018-06-22 01:04:43,356 INFO ]: Constructing interpolant automaton starting with 68 interpolants. [2018-06-22 01:04:43,357 INFO ]: CoverageRelationStatistics Valid=292, Invalid=4264, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 01:04:43,357 INFO ]: Start difference. First operand 136 states and 151 transitions. Second operand 68 states. Received shutdown request... [2018-06-22 01:04:45,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-22 01:04:45,033 WARN ]: Verification canceled [2018-06-22 01:04:45,037 WARN ]: Timeout [2018-06-22 01:04:45,038 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:04:45 BoogieIcfgContainer [2018-06-22 01:04:45,038 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:04:45,039 INFO ]: Toolchain (without parser) took 68054.62 ms. Allocated memory was 304.1 MB in the beginning and 690.0 MB in the end (delta: 385.9 MB). Free memory was 248.6 MB in the beginning and 541.1 MB in the end (delta: -292.5 MB). Peak memory consumption was 93.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:04:45,039 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:04:45,039 INFO ]: ChcToBoogie took 83.82 ms. Allocated memory is still 304.1 MB. Free memory was 247.6 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:04:45,040 INFO ]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 304.1 MB. Free memory was 245.6 MB in the beginning and 243.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:04:45,040 INFO ]: RCFGBuilder took 631.81 ms. Allocated memory is still 304.1 MB. Free memory was 243.6 MB in the beginning and 215.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:04:45,040 INFO ]: TraceAbstraction took 67292.74 ms. Allocated memory was 304.1 MB in the beginning and 690.0 MB in the end (delta: 385.9 MB). Free memory was 215.5 MB in the beginning and 541.1 MB in the end (delta: -325.5 MB). Peak memory consumption was 60.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:04:45,042 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.1 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 83.82 ms. Allocated memory is still 304.1 MB. Free memory was 247.6 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 304.1 MB. Free memory was 245.6 MB in the beginning and 243.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 631.81 ms. Allocated memory is still 304.1 MB. Free memory was 243.6 MB in the beginning and 215.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 67292.74 ms. Allocated memory was 304.1 MB in the beginning and 690.0 MB in the end (delta: 385.9 MB). Free memory was 215.5 MB in the beginning and 541.1 MB in the end (delta: -325.5 MB). Peak memory consumption was 60.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 34 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 99 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. TIMEOUT Result, 67.2s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 46.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 6497 SDslu, 13050 SDs, 0 SdLazy, 8954 SolverSat, 2593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1430 GetRequests, 212 SyntacticMatches, 14 SemanticMatches, 1203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36558 ImplicationChecksByTransitivity, 53.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=15, 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, 17 MinimizatonAttempts, 1278 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 944 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 914 ConstructedInterpolants, 166 QuantifiedInterpolants, 160452 SizeOfPredicates, 456 NumberOfNonLiveVariables, 7251 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 30 InterpolantComputations, 8 PerfectInterpolantSequences, 78/384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-04-45-052.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/32.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-04-45-052.csv Completed graceful shutdown